[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/partition.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/partition.pass.cpp:20: [ 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:02] setting up pass: fuse-ctors, options = [ 0:02] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.2/_klee_out" [ 0:04] KLEE: Using Z3 solver backend [ 0:04] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:04] 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:04] [ 0:04] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:07] KLEE: WARNING: undefined reference to function: klee_free [ 0:07] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:07] i:1 [ 0:07] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:07] about to __boot:0 [ 0:07] about to run the scheduler:0 [ 0:07] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:07] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:07] KLEE: NOTE: now ignoring this error at this location [ 0:07] KLEE: ERROR: EXITING ON ERROR: [ 0:07] Error: failed external call: __dios_tainted_init [ 0:07] File: /dios/libc/sys/start.cpp [ 0:07] Line: 87 [ 0:07] assembly.ll line: 38115 [ 0:07] Stack: [ 0:07] #000038115 in __dios_start (l=2, argc=1, argv=94828500201992, envp=94828500271112) at /dios/libc/sys/start.cpp:87 [ 0:07] #100014124 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:07] #200046363 in klee_boot (argc=2, argv=94828473170688) at /dios/arch/klee/boot.c:41 [ 0:07] [ 0:07] [ 0:07] 1 /* TAGS: c++ fin */ [ 0:07] 2 /* CC_OPTS: -std=c++2a */ [ 0:07] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:07] 4 //===----------------------------------------------------------------------===// [ 0:07] 5 // [ 0:07] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:07] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:07] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:07] 9 // [ 0:07] 10 //===----------------------------------------------------------------------===// [ 0:07] 11 [ 0:07] 12 // [ 0:07] 13 [ 0:07] 14 // template Pred> [ 0:07] 15 // requires ShuffleIterator [ 0:07] 16 // && CopyConstructible [ 0:07] 17 // Iter [ 0:07] 18 // partition(Iter first, Iter last, Pred pred); [ 0:07] 19 [ 0:07] 20 #include [ 0:07] 21 #include [ 0:07] 22 [ 0:07] 23 [ 0:07] 24 #include "test_macros.h" [ 0:07] 25 #include "test_iterators.h" [ 0:07] 26 [ 0:07] 27 struct is_odd [ 0:07] 28 { [ 0:07] 29 bool operator()(const int& i) const {return i & 1;} [ 0:07] 30 }; [ 0:07] 31 [ 0:07] 32 template [ 0:07] 33 void [ 0:07] 34 test() [ 0:07] 35 { [ 0:07] 36 // check mixed [ 0:07] 37 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8 ,9}; [ 0:07] 38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); [ 0:07] 39 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); [ 0:07] 40 assert(base(r) == ia + 5); [ 0:07] 41 for (int* i = ia; i < base(r); ++i) [ 0:07] 42 assert(is_odd()(*i)); [ 0:07] 43 for (int* i = base(r); i < ia+sa; ++i) [ 0:07] 44 assert(!is_odd()(*i)); [ 0:07] 45 // check empty [ 0:07] 46 r = std::partition(Iter(ia), Iter(ia), is_odd()); [ 0:07] 47 assert(base(r) == ia); [ 0:07] 48 // check all false [ 0:07] 49 for (unsigned i = 0; i < sa; ++i) [ 0:07] 50 ia[i] = 2*i; [ 0:07] 51 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); [ 0:07] 52 assert(base(r) == ia); [ 0:07] 53 // check all true [ 0:07] 54 for (unsigned i = 0; i < sa; ++i) [ 0:07] 55 ia[i] = 2*i+1; [ 0:07] 56 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); [ 0:07] 57 assert(base(r) == ia+sa); [ 0:07] 58 // check all true but last [ 0:07] 59 for (unsigned i = 0; i < sa; ++i) [ 0:07] 60 ia[i] = 2*i+1; [ 0:07] 61 ia[sa-1] = 10; [ 0:07] 62 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); [ 0:07] 63 assert(base(r) == ia+sa-1); [ 0:07] 64 for (int* i = ia; i < base(r); ++i) [ 0:07] 65 assert(is_odd()(*i)); [ 0:07] 66 for (int* i = base(r); i < ia+sa; ++i) [ 0:07] 67 assert(!is_odd()(*i)); [ 0:07] 68 // check all true but first [ 0:07] 69 for (unsigned i = 0; i < sa; ++i) [ 0:07] 70 ia[i] = 2*i+1; [ 0:07] 71 ia[0] = 10; [ 0:07] 72 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); [ 0:07] 73 assert(base(r) == ia+sa-1); [ 0:07] 74 for (int* i = ia; i < base(r); ++i) [ 0:07] 75 assert(is_odd()(*i)); [ 0:07] 76 for (int* i = base(r); i < ia+sa; ++i) [ 0:07] 77 assert(!is_odd()(*i)); [ 0:07] 78 // check all false but last [ 0:07] 79 for (unsigned i = 0; i < sa; ++i) [ 0:07] 80 ia[i] = 2*i; [ 0:07] 81 ia[sa-1] = 11; [ 0:07] 82 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); [ 0:07] 83 assert(base(r) == ia+1); [ 0:07] 84 for (int* i = ia; i < base(r); ++i) [ 0:07] 85 assert(is_odd()(*i)); [ 0:07] 86 for (int* i = base(r); i < ia+sa; ++i) [ 0:07] 87 assert(!is_odd()(*i)); [ 0:07] 88 // check all false but first [ 0:07] 89 for (unsigned i = 0; i < sa; ++i) [ 0:07] 90 ia[i] = 2*i; [ 0:07] 91 ia[0] = 11; [ 0:07] 92 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); [ 0:07] 93 assert(base(r) == ia+1); [ 0:07] 94 for (int* i = ia; i < base(r); ++i) [ 0:07] 95 assert(is_odd()(*i)); [ 0:07] 96 for (int* i = base(r); i < ia+sa; ++i) [ 0:07] 97 assert(!is_odd()(*i)); [ 0:07] 98 } [ 0:07] 99 [ 0:07] 100 int main(int, char**) [ 0:07] 101 { [ 0:07] 102 test >(); [ 0:07] 103 test >(); [ 0:07] 104 test(); [ 0:07] 105 [ 0:07] 106 return 0; [ 0:07] 107 } [ 0:07] # no errors were expected but one was found anyway