[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/assign_move.pass.cpp [ 0:00] 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.8/_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: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: 80303 [ 0:12] Stack: [ 0:12] #000080303 in __dios_start (l=0, argc=1, argv=93856850145800, envp=93856850206728) at /dios/libc/sys/start.cpp:87 [ 0:12] #100028305 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:12] #200088883 in klee_boot (argc=2, argv=93856820858240) 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 // forward_list& operator=(forward_list&& x); [ 0:12] 15 [ 0:12] 16 #include [ 0:12] 17 #include [ 0:12] 18 #include [ 0:12] 19 [ 0:12] 20 #include "test_allocator.h" [ 0:12] 21 #include "MoveOnly.h" [ 0:12] 22 #include "min_allocator.h" [ 0:12] 23 [ 0:12] 24 int main() [ 0:12] 25 { [ 0:12] 26 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES [ 0:12] 27 { [ 0:12] 28 typedef MoveOnly T; [ 0:12] 29 typedef test_allocator A; [ 0:12] 30 typedef std::forward_list C; [ 0:12] 31 T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 32 T t1[] = {10, 11, 12, 13}; [ 0:12] 33 typedef std::move_iterator I; [ 0:12] 34 C c0(I(std::begin(t0)), I(std::end(t0)), A(10)); [ 0:12] 35 C c1(I(std::begin(t1)), I(std::end(t1)), A(10)); [ 0:12] 36 c1 = std::move(c0); [ 0:12] 37 int n = 0; [ 0:12] 38 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 39 assert(*i == n); [ 0:12] 40 assert(n == 10); [ 0:12] 41 assert(c1.get_allocator() == A(10)); [ 0:12] 42 assert(c0.empty()); [ 0:12] 43 } [ 0:12] 44 { [ 0:12] 45 typedef MoveOnly T; [ 0:12] 46 typedef test_allocator A; [ 0:12] 47 typedef std::forward_list C; [ 0:12] 48 T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 49 T t1[] = {10, 11, 12, 13}; [ 0:12] 50 typedef std::move_iterator I; [ 0:12] 51 C c0(I(std::begin(t0)), I(std::end(t0)), A(10)); [ 0:12] 52 C c1(I(std::begin(t1)), I(std::end(t1)), A(11)); [ 0:12] 53 c1 = std::move(c0); [ 0:12] 54 int n = 0; [ 0:12] 55 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 56 assert(*i == n); [ 0:12] 57 assert(n == 10); [ 0:12] 58 assert(c1.get_allocator() == A(11)); [ 0:12] 59 assert(!c0.empty()); [ 0:12] 60 } [ 0:12] 61 { [ 0:12] 62 typedef MoveOnly T; [ 0:12] 63 typedef test_allocator A; [ 0:12] 64 typedef std::forward_list C; [ 0:12] 65 T t0[] = {10, 11, 12, 13}; [ 0:12] 66 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 67 typedef std::move_iterator I; [ 0:12] 68 C c0(I(std::begin(t0)), I(std::end(t0)), A(10)); [ 0:12] 69 C c1(I(std::begin(t1)), I(std::end(t1)), A(10)); [ 0:12] 70 c1 = std::move(c0); [ 0:12] 71 int n = 0; [ 0:12] 72 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 73 assert(*i == 10+n); [ 0:12] 74 assert(n == 4); [ 0:12] 75 assert(c1.get_allocator() == A(10)); [ 0:12] 76 assert(c0.empty()); [ 0:12] 77 } [ 0:12] 78 { [ 0:12] 79 typedef MoveOnly T; [ 0:12] 80 typedef test_allocator A; [ 0:12] 81 typedef std::forward_list C; [ 0:12] 82 T t0[] = {10, 11, 12, 13}; [ 0:12] 83 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 84 typedef std::move_iterator I; [ 0:12] 85 C c0(I(std::begin(t0)), I(std::end(t0)), A(10)); [ 0:12] 86 C c1(I(std::begin(t1)), I(std::end(t1)), A(11)); [ 0:12] 87 c1 = std::move(c0); [ 0:12] 88 int n = 0; [ 0:12] 89 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 90 assert(*i == 10+n); [ 0:12] 91 assert(n == 4); [ 0:12] 92 assert(c1.get_allocator() == A(11)); [ 0:12] 93 assert(!c0.empty()); [ 0:12] 94 } [ 0:12] 95 [ 0:12] 96 { [ 0:12] 97 typedef MoveOnly T; [ 0:12] 98 typedef other_allocator A; [ 0:12] 99 typedef std::forward_list C; [ 0:12] 100 T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 101 T t1[] = {10, 11, 12, 13}; [ 0:12] 102 typedef std::move_iterator I; [ 0:12] 103 C c0(I(std::begin(t0)), I(std::end(t0)), A(10)); [ 0:12] 104 C c1(I(std::begin(t1)), I(std::end(t1)), A(10)); [ 0:12] 105 c1 = std::move(c0); [ 0:12] 106 int n = 0; [ 0:12] 107 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 108 assert(*i == n); [ 0:12] 109 assert(n == 10); [ 0:12] 110 assert(c1.get_allocator() == A(10)); [ 0:12] 111 assert(c0.empty()); [ 0:12] 112 } [ 0:12] 113 { [ 0:12] 114 typedef MoveOnly T; [ 0:12] 115 typedef other_allocator A; [ 0:12] 116 typedef std::forward_list C; [ 0:12] 117 T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 118 T t1[] = {10, 11, 12, 13}; [ 0:12] 119 typedef std::move_iterator I; [ 0:12] 120 C c0(I(std::begin(t0)), I(std::end(t0)), A(10)); [ 0:12] 121 C c1(I(std::begin(t1)), I(std::end(t1)), A(11)); [ 0:12] 122 c1 = std::move(c0); [ 0:12] 123 int n = 0; [ 0:12] 124 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 125 assert(*i == n); [ 0:12] 126 assert(n == 10); [ 0:12] 127 assert(c1.get_allocator() == A(10)); [ 0:12] 128 assert(c0.empty()); [ 0:12] 129 } [ 0:12] 130 { [ 0:12] 131 typedef MoveOnly T; [ 0:12] 132 typedef other_allocator A; [ 0:12] 133 typedef std::forward_list C; [ 0:12] 134 T t0[] = {10, 11, 12, 13}; [ 0:12] 135 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 136 typedef std::move_iterator I; [ 0:12] 137 C c0(I(std::begin(t0)), I(std::end(t0)), A(10)); [ 0:12] 138 C c1(I(std::begin(t1)), I(std::end(t1)), A(10)); [ 0:12] 139 c1 = std::move(c0); [ 0:12] 140 int n = 0; [ 0:12] 141 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 142 assert(*i == 10+n); [ 0:12] 143 assert(n == 4); [ 0:12] 144 assert(c1.get_allocator() == A(10)); [ 0:12] 145 assert(c0.empty()); [ 0:12] 146 } [ 0:12] 147 { [ 0:12] 148 typedef MoveOnly T; [ 0:12] 149 typedef other_allocator A; [ 0:12] 150 typedef std::forward_list C; [ 0:12] 151 T t0[] = {10, 11, 12, 13}; [ 0:12] 152 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 153 typedef std::move_iterator I; [ 0:12] 154 C c0(I(std::begin(t0)), I(std::end(t0)), A(10)); [ 0:12] 155 C c1(I(std::begin(t1)), I(std::end(t1)), A(11)); [ 0:12] 156 c1 = std::move(c0); [ 0:12] 157 int n = 0; [ 0:12] 158 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 159 assert(*i == 10+n); [ 0:12] 160 assert(n == 4); [ 0:12] 161 assert(c1.get_allocator() == A(10)); [ 0:12] 162 assert(c0.empty()); [ 0:12] 163 } [ 0:12] 164 #if __cplusplus >= 201103L [ 0:12] 165 { [ 0:12] 166 typedef MoveOnly T; [ 0:12] 167 typedef min_allocator A; [ 0:12] 168 typedef std::forward_list C; [ 0:12] 169 T t0[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 170 T t1[] = {10, 11, 12, 13}; [ 0:12] 171 typedef std::move_iterator I; [ 0:12] 172 C c0(I(std::begin(t0)), I(std::end(t0)), A()); [ 0:12] 173 C c1(I(std::begin(t1)), I(std::end(t1)), A()); [ 0:12] 174 c1 = std::move(c0); [ 0:12] 175 int n = 0; [ 0:12] 176 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 177 assert(*i == n); [ 0:12] 178 assert(n == 10); [ 0:12] 179 assert(c1.get_allocator() == A()); [ 0:12] 180 assert(c0.empty()); [ 0:12] 181 } [ 0:12] 182 { [ 0:12] 183 typedef MoveOnly T; [ 0:12] 184 typedef min_allocator A; [ 0:12] 185 typedef std::forward_list C; [ 0:12] 186 T t0[] = {10, 11, 12, 13}; [ 0:12] 187 T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; [ 0:12] 188 typedef std::move_iterator I; [ 0:12] 189 C c0(I(std::begin(t0)), I(std::end(t0)), A()); [ 0:12] 190 C c1(I(std::begin(t1)), I(std::end(t1)), A()); [ 0:12] 191 c1 = std::move(c0); [ 0:12] 192 int n = 0; [ 0:12] 193 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n) [ 0:12] 194 assert(*i == 10+n); [ 0:12] 195 assert(n == 4); [ 0:12] 196 assert(c1.get_allocator() == A()); [ 0:12] 197 assert(c0.empty()); [ 0:12] 198 } [ 0:12] 199 #endif [ 0:12] 200 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES [ 0:12] 201 } [ 0:12] # no errors were expected but one was found anyway