[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/remove_if.pass.cpp [ 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.22/_klee_out" [ 0:06] KLEE: Using Z3 solver backend [ 0:06] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:06] 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:06] [ 0:06] KLEE: WARNING: undefined reference to function: _Z10klee_abortv [ 0:11] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:11] KLEE: WARNING: undefined reference to function: klee_free [ 0:11] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:11] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:11] i:1 [ 0:11] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:11] about to __boot:0 [ 0:11] about to run the scheduler:0 [ 0:11] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:11] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:11] KLEE: NOTE: now ignoring this error at this location [ 0:11] KLEE: ERROR: EXITING ON ERROR: [ 0:11] Error: failed external call: __dios_tainted_init [ 0:11] File: /dios/libc/sys/start.cpp [ 0:11] Line: 87 [ 0:11] assembly.ll line: 73369 [ 0:11] Stack: [ 0:11] #000073369 in __dios_start (l=0, argc=1, argv=94190728483336, envp=94190728552456) at /dios/libc/sys/start.cpp:87 [ 0:11] #100021198 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:11] #200081949 in klee_boot (argc=2, argv=94190695198080) at /dios/arch/klee/boot.c:41 [ 0:11] [ 0:11] [ 0:11] 1 /* TAGS: c++ */ [ 0:11] 2 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:11] 3 //===----------------------------------------------------------------------===// [ 0:11] 4 // [ 0:11] 5 // The LLVM Compiler Infrastructure [ 0:11] 6 // [ 0:11] 7 // This file is dual licensed under the MIT and the University of Illinois Open [ 0:11] 8 // Source Licenses. See LICENSE.TXT for details. [ 0:11] 9 // [ 0:11] 10 //===----------------------------------------------------------------------===// [ 0:11] 11 [ 0:11] 12 // [ 0:11] 13 [ 0:11] 14 // template void remove_if(Predicate pred); [ 0:11] 15 [ 0:11] 16 #include [ 0:11] 17 #include [ 0:11] 18 #include [ 0:11] 19 [ 0:11] 20 #include "min_allocator.h" [ 0:11] 21 #include "counting_predicates.hpp" [ 0:11] 22 [ 0:11] 23 [ 0:11] 24 bool g(int i) [ 0:11] 25 { [ 0:11] 26 return i < 3; [ 0:11] 27 } [ 0:11] 28 [ 0:11] 29 int main() [ 0:11] 30 { [ 0:11] 31 { [ 0:11] 32 typedef int T; [ 0:11] 33 typedef unary_counting_predicate Predicate; [ 0:11] 34 typedef std::forward_list C; [ 0:11] 35 const T t1[] = {0, 5, 5, 0, 0, 0, 5}; [ 0:11] 36 const T t2[] = {5, 5, 5}; [ 0:11] 37 C c1(std::begin(t1), std::end(t1)); [ 0:11] 38 C c2(std::begin(t2), std::end(t2)); [ 0:11] 39 Predicate cp(g); [ 0:11] 40 c1.remove_if(std::ref(cp)); [ 0:11] 41 assert(c1 == c2); [ 0:11] 42 assert(cp.count() == std::distance(std::begin(t1), std::end(t1))); [ 0:11] 43 } [ 0:11] 44 { [ 0:11] 45 typedef int T; [ 0:11] 46 typedef unary_counting_predicate Predicate; [ 0:11] 47 typedef std::forward_list C; [ 0:11] 48 const T t1[] = {0, 0, 0, 0}; [ 0:11] 49 C c1(std::begin(t1), std::end(t1)); [ 0:11] 50 C c2; [ 0:11] 51 Predicate cp(g); [ 0:11] 52 c1.remove_if(std::ref(cp)); [ 0:11] 53 assert(c1 == c2); [ 0:11] 54 assert(cp.count() == std::distance(std::begin(t1), std::end(t1))); [ 0:11] 55 } [ 0:11] 56 { [ 0:11] 57 typedef int T; [ 0:11] 58 typedef unary_counting_predicate Predicate; [ 0:11] 59 typedef std::forward_list C; [ 0:11] 60 const T t1[] = {5, 5, 5}; [ 0:11] 61 const T t2[] = {5, 5, 5}; [ 0:11] 62 C c1(std::begin(t1), std::end(t1)); [ 0:11] 63 C c2(std::begin(t2), std::end(t2)); [ 0:11] 64 Predicate cp(g); [ 0:11] 65 c1.remove_if(std::ref(cp)); [ 0:11] 66 assert(c1 == c2); [ 0:11] 67 assert(cp.count() == std::distance(std::begin(t1), std::end(t1))); [ 0:11] 68 } [ 0:11] 69 { [ 0:11] 70 typedef int T; [ 0:11] 71 typedef unary_counting_predicate Predicate; [ 0:11] 72 typedef std::forward_list C; [ 0:11] 73 C c1; [ 0:11] 74 C c2; [ 0:11] 75 Predicate cp(g); [ 0:11] 76 c1.remove_if(std::ref(cp)); [ 0:11] 77 assert(c1 == c2); [ 0:11] 78 assert(cp.count() == 0); [ 0:11] 79 } [ 0:11] 80 { [ 0:11] 81 typedef int T; [ 0:11] 82 typedef unary_counting_predicate Predicate; [ 0:11] 83 typedef std::forward_list C; [ 0:11] 84 const T t1[] = {5, 5, 5, 0}; [ 0:11] 85 const T t2[] = {5, 5, 5}; [ 0:11] 86 C c1(std::begin(t1), std::end(t1)); [ 0:11] 87 C c2(std::begin(t2), std::end(t2)); [ 0:11] 88 Predicate cp(g); [ 0:11] 89 c1.remove_if(std::ref(cp)); [ 0:11] 90 assert(c1 == c2); [ 0:11] 91 assert(cp.count() == std::distance(std::begin(t1), std::end(t1))); [ 0:11] 92 } [ 0:11] 93 #if __cplusplus >= 201103L [ 0:11] 94 { [ 0:11] 95 typedef int T; [ 0:11] 96 typedef unary_counting_predicate Predicate; [ 0:11] 97 typedef std::forward_list> C; [ 0:11] 98 const T t1[] = {0, 5, 5, 0, 0, 0, 5}; [ 0:11] 99 const T t2[] = {5, 5, 5}; [ 0:11] 100 C c1(std::begin(t1), std::end(t1)); [ 0:11] 101 C c2(std::begin(t2), std::end(t2)); [ 0:11] 102 Predicate cp(g); [ 0:11] 103 c1.remove_if(std::ref(cp)); [ 0:11] 104 assert(c1 == c2); [ 0:11] 105 assert(cp.count() == std::distance(std::begin(t1), std::end(t1))); [ 0:11] 106 } [ 0:11] 107 { [ 0:11] 108 typedef int T; [ 0:11] 109 typedef unary_counting_predicate Predicate; [ 0:11] 110 typedef std::forward_list> C; [ 0:11] 111 const T t1[] = {0, 0, 0, 0}; [ 0:11] 112 C c1(std::begin(t1), std::end(t1)); [ 0:11] 113 C c2; [ 0:11] 114 Predicate cp(g); [ 0:11] 115 c1.remove_if(std::ref(cp)); [ 0:11] 116 assert(c1 == c2); [ 0:11] 117 assert(cp.count() == std::distance(std::begin(t1), std::end(t1))); [ 0:11] 118 } [ 0:11] 119 { [ 0:11] 120 typedef int T; [ 0:11] 121 typedef unary_counting_predicate Predicate; [ 0:11] 122 typedef std::forward_list> C; [ 0:11] 123 const T t1[] = {5, 5, 5}; [ 0:11] 124 const T t2[] = {5, 5, 5}; [ 0:11] 125 C c1(std::begin(t1), std::end(t1)); [ 0:11] 126 C c2(std::begin(t2), std::end(t2)); [ 0:11] 127 Predicate cp(g); [ 0:11] 128 c1.remove_if(std::ref(cp)); [ 0:11] 129 assert(c1 == c2); [ 0:11] 130 assert(cp.count() == std::distance(std::begin(t1), std::end(t1))); [ 0:11] 131 } [ 0:11] 132 { [ 0:11] 133 typedef int T; [ 0:11] 134 typedef unary_counting_predicate Predicate; [ 0:11] 135 typedef std::forward_list> C; [ 0:11] 136 C c1; [ 0:11] 137 C c2; [ 0:11] 138 Predicate cp(g); [ 0:11] 139 c1.remove_if(std::ref(cp)); [ 0:11] 140 assert(c1 == c2); [ 0:11] 141 assert(cp.count() == 0); [ 0:11] 142 } [ 0:11] 143 { [ 0:11] 144 typedef int T; [ 0:11] 145 typedef unary_counting_predicate Predicate; [ 0:11] 146 typedef std::forward_list> C; [ 0:11] 147 const T t1[] = {5, 5, 5, 0}; [ 0:11] 148 const T t2[] = {5, 5, 5}; [ 0:11] 149 C c1(std::begin(t1), std::end(t1)); [ 0:11] 150 C c2(std::begin(t2), std::end(t2)); [ 0:11] 151 Predicate cp(g); [ 0:11] 152 c1.remove_if(std::ref(cp)); [ 0:11] 153 assert(c1 == c2); [ 0:11] 154 assert(cp.count() == std::distance(std::begin(t1), std::end(t1))); [ 0:11] 155 } [ 0:11] 156 #endif [ 0:11] 157 } [ 0:11] # no errors were expected but one was found anyway