[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/before_begin.pass.cpp [ 0:01] compiling /dios/lib/config/seqklee.bc [ 0:02] 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.23/_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: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: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: 71641 [ 0:12] Stack: [ 0:12] #000071641 in __dios_start (l=0, argc=1, argv=93981586330120, envp=93981586391048) at /dios/libc/sys/start.cpp:87 [ 0:12] #100019470 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:12] #200080221 in klee_boot (argc=2, argv=93981553134976) 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 // iterator before_begin(); [ 0:12] 15 // const_iterator before_begin() const; [ 0:12] 16 // const_iterator cbefore_begin() const; [ 0:12] 17 [ 0:12] 18 #include [ 0:12] 19 #include [ 0:12] 20 #include [ 0:12] 21 [ 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 C c; [ 0:12] 30 C::iterator i = c.before_begin(); [ 0:12] 31 assert(std::distance(i, c.end()) == 1); [ 0:12] 32 } [ 0:12] 33 { [ 0:12] 34 typedef int T; [ 0:12] 35 typedef std::forward_list C; [ 0:12] 36 const C c; [ 0:12] 37 C::const_iterator i = c.before_begin(); [ 0:12] 38 assert(std::distance(i, c.end()) == 1); [ 0:12] 39 } [ 0:12] 40 { [ 0:12] 41 typedef int T; [ 0:12] 42 typedef std::forward_list C; [ 0:12] 43 const C c; [ 0:12] 44 C::const_iterator i = c.cbefore_begin(); [ 0:12] 45 assert(std::distance(i, c.end()) == 1); [ 0:12] 46 assert(c.cbefore_begin() == c.before_begin()); [ 0:12] 47 } [ 0:12] 48 { [ 0:12] 49 typedef int T; [ 0:12] 50 typedef std::forward_list C; [ 0:12] 51 const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 52 C c(std::begin(t), std::end(t)); [ 0:12] 53 C::iterator i = c.before_begin(); [ 0:12] 54 assert(std::distance(i, c.end()) == 11); [ 0:12] 55 assert(std::next(c.before_begin()) == c.begin()); [ 0:12] 56 } [ 0:12] 57 { [ 0:12] 58 typedef int T; [ 0:12] 59 typedef std::forward_list C; [ 0:12] 60 const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 61 const C c(std::begin(t), std::end(t)); [ 0:12] 62 C::const_iterator i = c.before_begin(); [ 0:12] 63 assert(std::distance(i, c.end()) == 11); [ 0:12] 64 } [ 0:12] 65 #if __cplusplus >= 201103L [ 0:12] 66 { [ 0:12] 67 typedef int T; [ 0:12] 68 typedef std::forward_list> C; [ 0:12] 69 C c; [ 0:12] 70 C::iterator i = c.before_begin(); [ 0:12] 71 assert(std::distance(i, c.end()) == 1); [ 0:12] 72 } [ 0:12] 73 { [ 0:12] 74 typedef int T; [ 0:12] 75 typedef std::forward_list> C; [ 0:12] 76 const C c; [ 0:12] 77 C::const_iterator i = c.before_begin(); [ 0:12] 78 assert(std::distance(i, c.end()) == 1); [ 0:12] 79 } [ 0:12] 80 { [ 0:12] 81 typedef int T; [ 0:12] 82 typedef std::forward_list> C; [ 0:12] 83 const C c; [ 0:12] 84 C::const_iterator i = c.cbefore_begin(); [ 0:12] 85 assert(std::distance(i, c.end()) == 1); [ 0:12] 86 assert(c.cbefore_begin() == c.before_begin()); [ 0:12] 87 } [ 0:12] 88 { [ 0:12] 89 typedef int T; [ 0:12] 90 typedef std::forward_list> C; [ 0:12] 91 const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 92 C c(std::begin(t), std::end(t)); [ 0:12] 93 C::iterator i = c.before_begin(); [ 0:12] 94 assert(std::distance(i, c.end()) == 11); [ 0:12] 95 assert(std::next(c.before_begin()) == c.begin()); [ 0:12] 96 } [ 0:12] 97 { [ 0:12] 98 typedef int T; [ 0:12] 99 typedef std::forward_list> C; [ 0:12] 100 const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 101 const C c(std::begin(t), std::end(t)); [ 0:12] 102 C::const_iterator i = c.before_begin(); [ 0:12] 103 assert(std::distance(i, c.end()) == 11); [ 0:12] 104 } [ 0:12] 105 #endif [ 0:12] 106 } [ 0:12] # no errors were expected but one was found anyway