[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/minmax_init_list_comp.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/minmax_init_list_comp.pass.cpp:22: [ 0:01] In file included from /dios/libcxx/include/algorithm:639: [ 0:01] In file included from /dios/libcxx/include/initializer_list:46: [ 0:01] In file included from /dios/libcxx/include/cstddef:44: [ 0:01] In file included from /dios/include/stddef.h:10: [ 0:01] In file included from /dios/include/_PDCLIB/int.h:16: [ 0:01] /dios/include/_PDCLIB/cdefs.h:69:10: warning: Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011). [ 0:01] #warning Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011). [ 0:01] ^ [ 0:01] 1 warning generated. [ 0:01] compiling /dios/lib/config/seqklee.bc [ 0:01] setting up pass: functionmeta, options = [ 0:03] setting up pass: fuse-ctors, options = [ 0:03] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.12/_klee_out" [ 0:07] KLEE: Using Z3 solver backend [ 0:07] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:07] warning: Linking two modules of different target triples: klee_div_zero_check.bc' is 'x86_64-unknown-linux-gnu' whereas 'klee.bc' is 'x86_64-unknown-none-elf' [ 0:08] [ 0:08] KLEE: WARNING: undefined reference to function: _Z10klee_abortv [ 0:12] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:12] KLEE: WARNING: undefined reference to function: klee_free [ 0:12] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:12] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:12] i:1 [ 0:12] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:12] about to __boot:0 [ 0:12] about to run the scheduler:0 [ 0:12] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:12] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:12] KLEE: NOTE: now ignoring this error at this location [ 0:12] KLEE: ERROR: EXITING ON ERROR: [ 0:12] Error: failed external call: __dios_tainted_init [ 0:12] File: /dios/libc/sys/start.cpp [ 0:12] Line: 87 [ 0:12] assembly.ll line: 66221 [ 0:12] Stack: [ 0:12] #000066221 in __dios_start (l=2, argc=1, argv=94431989748232, envp=94431989825544) at /dios/libc/sys/start.cpp:87 [ 0:12] #100014216 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:12] #200074801 in klee_boot (argc=2, argv=94431958216064) at /dios/arch/klee/boot.c:41 [ 0:12] [ 0:12] [ 0:12] 1 /* TAGS: c++ fin */ [ 0:13] 2 /* CC_OPTS: -std=c++2a */ [ 0:13] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:13] 4 //===----------------------------------------------------------------------===// [ 0:13] 5 // [ 0:13] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:13] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:13] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:13] 9 // [ 0:13] 10 //===----------------------------------------------------------------------===// [ 0:13] 11 [ 0:13] 12 // UNSUPPORTED: c++98, c++03 [ 0:13] 13 [ 0:13] 14 // [ 0:13] 15 [ 0:13] 16 // template [ 0:13] 17 // pair [ 0:13] 18 // minmax(initializer_list t, Compare comp); [ 0:13] 19 // [ 0:13] 20 // Complexity: At most (3/2) * t.size() applications of the corresponding predicate. [ 0:13] 21 [ 0:13] 22 #include [ 0:13] 23 #include [ 0:13] 24 #include [ 0:13] 25 [ 0:13] 26 #include "test_macros.h" [ 0:13] 27 #include "counting_predicates.hpp" [ 0:13] 28 [ 0:13] 29 bool all_equal(int, int) { return false; } // everything is equal [ 0:13] 30 [ 0:13] 31 void test_all_equal(std::initializer_list il) [ 0:13] 32 { [ 0:13] 33 binary_counting_predicate pred (all_equal); [ 0:13] 34 std::pair p = std::minmax(il, std::ref(pred)); [ 0:13] 35 const int *ptr = il.end(); [ 0:13] 36 assert(p.first == *il.begin()); [ 0:13] 37 assert(p.second == *--ptr); [ 0:13] 38 assert(pred.count() <= ((3 * il.size()) / 2)); [ 0:13] 39 } [ 0:13] 40 [ 0:13] 41 int main(int, char**) [ 0:13] 42 { [ 0:13] 43 assert((std::minmax({1, 2, 3}, std::greater()) == std::pair(3, 1))); [ 0:13] 44 assert((std::minmax({1, 3, 2}, std::greater()) == std::pair(3, 1))); [ 0:13] 45 assert((std::minmax({2, 1, 3}, std::greater()) == std::pair(3, 1))); [ 0:13] 46 assert((std::minmax({2, 3, 1}, std::greater()) == std::pair(3, 1))); [ 0:13] 47 assert((std::minmax({3, 1, 2}, std::greater()) == std::pair(3, 1))); [ 0:13] 48 assert((std::minmax({3, 2, 1}, std::greater()) == std::pair(3, 1))); [ 0:13] 49 assert((std::minmax({1, 2, 3}, all_equal ) == std::pair(1, 3))); [ 0:13] 50 [ 0:13] 51 binary_counting_predicate, int, int> pred ((std::greater())); [ 0:13] 52 assert((std::minmax({1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 5, 3}, std::ref(pred)) == std::pair(5, 1))); [ 0:13] 53 assert(pred.count() <= 18); // size == 12 [ 0:13] 54 [ 0:13] 55 test_all_equal({0}); [ 0:13] 56 test_all_equal({0,1}); [ 0:13] 57 test_all_equal({0,1,2}); [ 0:13] 58 test_all_equal({0,1,2,3}); [ 0:13] 59 test_all_equal({0,1,2,3,4}); [ 0:13] 60 test_all_equal({0,1,2,3,4,5}); [ 0:13] 61 test_all_equal({0,1,2,3,4,5,6}); [ 0:13] 62 test_all_equal({0,1,2,3,4,5,6,7}); [ 0:13] 63 test_all_equal({0,1,2,3,4,5,6,7,8}); [ 0:13] 64 test_all_equal({0,1,2,3,4,5,6,7,8,9}); [ 0:13] 65 test_all_equal({0,1,2,3,4,5,6,7,8,9,10}); [ 0:13] 66 test_all_equal({0,1,2,3,4,5,6,7,8,9,10,11}); [ 0:13] 67 [ 0:13] 68 #if TEST_STD_VER >= 14 [ 0:13] 69 { [ 0:13] 70 static_assert((std::minmax({1, 2, 3}, std::greater()) == std::pair(3, 1)), ""); [ 0:13] 71 static_assert((std::minmax({1, 3, 2}, std::greater()) == std::pair(3, 1)), ""); [ 0:13] 72 static_assert((std::minmax({2, 1, 3}, std::greater()) == std::pair(3, 1)), ""); [ 0:13] 73 static_assert((std::minmax({2, 3, 1}, std::greater()) == std::pair(3, 1)), ""); [ 0:13] 74 static_assert((std::minmax({3, 1, 2}, std::greater()) == std::pair(3, 1)), ""); [ 0:13] 75 static_assert((std::minmax({3, 2, 1}, std::greater()) == std::pair(3, 1)), ""); [ 0:13] 76 } [ 0:13] 77 #endif [ 0:13] 78 [ 0:13] 79 return 0; [ 0:13] 80 } [ 0:13] # no errors were expected but one was found anyway