[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/insert_after_range.pass.cpp [ 0:01] compiling /dios/lib/config/seqklee.bc [ 0:01] setting up pass: functionmeta, options = [ 0:04] setting up pass: fuse-ctors, options = [ 0:04] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.16/_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:07] [ 0:07] 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: 79264 [ 0:12] Stack: [ 0:12] #000079264 in __dios_start (l=0, argc=1, argv=94806980063752, envp=94806980132872) at /dios/libc/sys/start.cpp:87 [ 0:12] #100027093 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:12] #200087844 in klee_boot (argc=2, argv=94806951071104) at /dios/arch/klee/boot.c:41 [ 0:12] [ 0:12] [ 0:12] 1 /* TAGS: c++ */ [ 0:12] 2 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:12] 3 //===----------------------------------------------------------------------===// [ 0:12] 4 // [ 0:12] 5 // The LLVM Compiler Infrastructure [ 0:12] 6 // [ 0:12] 7 // This file is dual licensed under the MIT and the University of Illinois Open [ 0:12] 8 // Source Licenses. See LICENSE.TXT for details. [ 0:12] 9 // [ 0:12] 10 //===----------------------------------------------------------------------===// [ 0:12] 11 [ 0:12] 12 // [ 0:12] 13 [ 0:12] 14 // template [ 0:12] 15 // iterator insert_after(const_iterator p, [ 0:12] 16 // InputIterator first, InputIterator last); [ 0:12] 17 [ 0:12] 18 #include [ 0:12] 19 #include [ 0:12] 20 [ 0:12] 21 #include "test_iterators.h" [ 0:12] 22 #include "min_allocator.h" [ 0:12] 23 [ 0:12] 24 int main() [ 0:12] 25 { [ 0:12] 26 { [ 0:12] 27 typedef int T; [ 0:12] 28 typedef std::forward_list C; [ 0:12] 29 typedef C::iterator I; [ 0:12] 30 typedef input_iterator J; [ 0:12] 31 C c; [ 0:12] 32 const T t[] = {0, 1, 2, 3, 4}; [ 0:12] 33 I i = c.insert_after(c.cbefore_begin(), J(t), J(t)); [ 0:12] 34 assert(i == c.before_begin()); [ 0:12] 35 assert(distance(c.begin(), c.end()) == 0); [ 0:12] 36 [ 0:12] 37 i = c.insert_after(c.cbefore_begin(), J(t), J(t+3)); [ 0:12] 38 assert(i == next(c.before_begin(), 3)); [ 0:12] 39 assert(distance(c.begin(), c.end()) == 3); [ 0:12] 40 assert(*next(c.begin(), 0) == 0); [ 0:12] 41 assert(*next(c.begin(), 1) == 1); [ 0:12] 42 assert(*next(c.begin(), 2) == 2); [ 0:12] 43 [ 0:12] 44 i = c.insert_after(c.begin(), J(t+3), J(t+5)); [ 0:12] 45 assert(i == next(c.begin(), 2)); [ 0:12] 46 assert(distance(c.begin(), c.end()) == 5); [ 0:12] 47 assert(*next(c.begin(), 0) == 0); [ 0:12] 48 assert(*next(c.begin(), 1) == 3); [ 0:12] 49 assert(*next(c.begin(), 2) == 4); [ 0:12] 50 assert(*next(c.begin(), 3) == 1); [ 0:12] 51 assert(*next(c.begin(), 4) == 2); [ 0:12] 52 } [ 0:12] 53 #if __cplusplus >= 201103L [ 0:12] 54 { [ 0:12] 55 typedef int T; [ 0:12] 56 typedef std::forward_list> C; [ 0:12] 57 typedef C::iterator I; [ 0:12] 58 typedef input_iterator J; [ 0:12] 59 C c; [ 0:12] 60 const T t[] = {0, 1, 2, 3, 4}; [ 0:12] 61 I i = c.insert_after(c.cbefore_begin(), J(t), J(t)); [ 0:12] 62 assert(i == c.before_begin()); [ 0:12] 63 assert(distance(c.begin(), c.end()) == 0); [ 0:12] 64 [ 0:12] 65 i = c.insert_after(c.cbefore_begin(), J(t), J(t+3)); [ 0:12] 66 assert(i == next(c.before_begin(), 3)); [ 0:12] 67 assert(distance(c.begin(), c.end()) == 3); [ 0:12] 68 assert(*next(c.begin(), 0) == 0); [ 0:12] 69 assert(*next(c.begin(), 1) == 1); [ 0:12] 70 assert(*next(c.begin(), 2) == 2); [ 0:12] 71 [ 0:12] 72 i = c.insert_after(c.begin(), J(t+3), J(t+5)); [ 0:12] 73 assert(i == next(c.begin(), 2)); [ 0:12] 74 assert(distance(c.begin(), c.end()) == 5); [ 0:12] 75 assert(*next(c.begin(), 0) == 0); [ 0:12] 76 assert(*next(c.begin(), 1) == 3); [ 0:12] 77 assert(*next(c.begin(), 2) == 4); [ 0:12] 78 assert(*next(c.begin(), 3) == 1); [ 0:12] 79 assert(*next(c.begin(), 4) == 2); [ 0:12] 80 } [ 0:12] 81 #endif [ 0:12] 82 } [ 0:12] # no errors were expected but one was found anyway