[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/splice_pos_list_iter_iter.pass.cpp [ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/splice_pos_list_iter_iter.pass.cpp:16: [ 0:00] In file included from /dios/libcxx/include/list:183: [ 0:00] In file included from /dios/libcxx/include/memory:652: [ 0:00] In file included from /dios/libcxx/include/type_traits:417: [ 0:00] In file included from /dios/libcxx/include/cstddef:44: [ 0:00] In file included from /dios/include/stddef.h:10: [ 0:00] In file included from /dios/include/_PDCLIB/int.h:16: [ 0:00] /dios/include/_PDCLIB/cdefs.h:69:10: warning: Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011). [ 0:00] #warning Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011). [ 0:00] ^ [ 0:00] 1 warning generated. [ 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.1/_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: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: 80910 [ 0:12] Stack: [ 0:12] #000080910 in __dios_start (l=2, argc=1, argv=94120966894088, envp=94120966963208) at /dios/libc/sys/start.cpp:87 [ 0:12] #100028739 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:12] #200089490 in klee_boot (argc=2, argv=94120937352576) at /dios/arch/klee/boot.c:41 [ 0:12] [ 0:12] [ 0:12] 1 /* TAGS: c++ fin */ [ 0:12] 2 /* CC_OPTS: -std=c++2a */ [ 0:12] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:12] 4 //===----------------------------------------------------------------------===// [ 0:12] 5 // [ 0:12] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:12] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:12] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:12] 9 // [ 0:12] 10 //===----------------------------------------------------------------------===// [ 0:12] 11 [ 0:12] 12 // [ 0:12] 13 [ 0:12] 14 // void splice(const_iterator position, list& x, iterator first, iterator last); [ 0:12] 15 [ 0:12] 16 #include [ 0:12] 17 #include [ 0:12] 18 [ 0:12] 19 #include "test_macros.h" [ 0:12] 20 #include "min_allocator.h" [ 0:12] 21 [ 0:12] 22 int main(int, char**) [ 0:12] 23 { [ 0:12] 24 int a1[] = {1, 2, 3}; [ 0:12] 25 int a2[] = {4, 5, 6}; [ 0:12] 26 { [ 0:12] 27 std::list l1(a1, a1+3); [ 0:12] 28 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin())); [ 0:12] 29 assert(l1.size() == 3); [ 0:12] 30 assert(distance(l1.begin(), l1.end()) == 3); [ 0:12] 31 std::list::const_iterator i = l1.begin(); [ 0:12] 32 assert(*i == 1); [ 0:12] 33 ++i; [ 0:12] 34 assert(*i == 2); [ 0:12] 35 ++i; [ 0:12] 36 assert(*i == 3); [ 0:12] 37 } [ 0:12] 38 { [ 0:12] 39 std::list l1(a1, a1+3); [ 0:12] 40 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2)); [ 0:12] 41 assert(l1.size() == 3); [ 0:12] 42 assert(distance(l1.begin(), l1.end()) == 3); [ 0:12] 43 std::list::const_iterator i = l1.begin(); [ 0:12] 44 assert(*i == 2); [ 0:12] 45 ++i; [ 0:12] 46 assert(*i == 1); [ 0:12] 47 ++i; [ 0:12] 48 assert(*i == 3); [ 0:12] 49 } [ 0:12] 50 { [ 0:12] 51 std::list l1(a1, a1+3); [ 0:12] 52 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 3)); [ 0:12] 53 assert(l1.size() == 3); [ 0:12] 54 assert(distance(l1.begin(), l1.end()) == 3); [ 0:12] 55 std::list::const_iterator i = l1.begin(); [ 0:12] 56 assert(*i == 2); [ 0:12] 57 ++i; [ 0:12] 58 assert(*i == 3); [ 0:12] 59 ++i; [ 0:12] 60 assert(*i == 1); [ 0:12] 61 } [ 0:12] 62 { [ 0:12] 63 std::list l1(a1, a1+3); [ 0:12] 64 std::list l2(a2, a2+3); [ 0:12] 65 l1.splice(l1.begin(), l2, next(l2.begin()), l2.end()); [ 0:12] 66 assert(l1.size() == 5); [ 0:12] 67 assert(distance(l1.begin(), l1.end()) == 5); [ 0:12] 68 std::list::const_iterator i = l1.begin(); [ 0:12] 69 assert(*i == 5); [ 0:12] 70 ++i; [ 0:12] 71 assert(*i == 6); [ 0:12] 72 ++i; [ 0:12] 73 assert(*i == 1); [ 0:12] 74 ++i; [ 0:12] 75 assert(*i == 2); [ 0:12] 76 ++i; [ 0:12] 77 assert(*i == 3); [ 0:12] 78 assert(l2.size() == 1); [ 0:12] 79 i = l2.begin(); [ 0:12] 80 assert(*i == 4); [ 0:12] 81 } [ 0:12] 82 { [ 0:12] 83 std::list l1(a1, a1+3); [ 0:12] 84 std::list l2(a2, a2+3); [ 0:12] 85 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end()); [ 0:12] 86 assert(l1.size() == 5); [ 0:12] 87 assert(distance(l1.begin(), l1.end()) == 5); [ 0:12] 88 std::list::const_iterator i = l1.begin(); [ 0:12] 89 assert(*i == 1); [ 0:12] 90 ++i; [ 0:12] 91 assert(*i == 5); [ 0:12] 92 ++i; [ 0:12] 93 assert(*i == 6); [ 0:12] 94 ++i; [ 0:12] 95 assert(*i == 2); [ 0:12] 96 ++i; [ 0:12] 97 assert(*i == 3); [ 0:12] 98 assert(l2.size() == 1); [ 0:12] 99 i = l2.begin(); [ 0:12] 100 assert(*i == 4); [ 0:12] 101 } [ 0:12] 102 { [ 0:12] 103 std::list l1(a1, a1+3); [ 0:12] 104 std::list l2(a2, a2+3); [ 0:12] 105 l1.splice(l1.end(), l2, next(l2.begin()), l2.end()); [ 0:12] 106 assert(l1.size() == 5); [ 0:12] 107 assert(distance(l1.begin(), l1.end()) == 5); [ 0:12] 108 std::list::const_iterator i = l1.begin(); [ 0:12] 109 assert(*i == 1); [ 0:12] 110 ++i; [ 0:12] 111 assert(*i == 2); [ 0:12] 112 ++i; [ 0:12] 113 assert(*i == 3); [ 0:12] 114 ++i; [ 0:12] 115 assert(*i == 5); [ 0:12] 116 ++i; [ 0:12] 117 assert(*i == 6); [ 0:12] 118 assert(l2.size() == 1); [ 0:12] 119 i = l2.begin(); [ 0:12] 120 assert(*i == 4); [ 0:12] 121 } [ 0:12] 122 #if TEST_STD_VER >= 11 [ 0:12] 123 { [ 0:12] 124 std::list> l1(a1, a1+3); [ 0:12] 125 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin())); [ 0:12] 126 assert(l1.size() == 3); [ 0:12] 127 assert(distance(l1.begin(), l1.end()) == 3); [ 0:12] 128 std::list>::const_iterator i = l1.begin(); [ 0:12] 129 assert(*i == 1); [ 0:12] 130 ++i; [ 0:12] 131 assert(*i == 2); [ 0:12] 132 ++i; [ 0:12] 133 assert(*i == 3); [ 0:12] 134 } [ 0:12] 135 { [ 0:12] 136 std::list> l1(a1, a1+3); [ 0:12] 137 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2)); [ 0:12] 138 assert(l1.size() == 3); [ 0:12] 139 assert(distance(l1.begin(), l1.end()) == 3); [ 0:12] 140 std::list>::const_iterator i = l1.begin(); [ 0:12] 141 assert(*i == 2); [ 0:12] 142 ++i; [ 0:12] 143 assert(*i == 1); [ 0:12] 144 ++i; [ 0:12] 145 assert(*i == 3); [ 0:12] 146 } [ 0:12] 147 { [ 0:12] 148 std::list> l1(a1, a1+3); [ 0:12] 149 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 3)); [ 0:12] 150 assert(l1.size() == 3); [ 0:12] 151 assert(distance(l1.begin(), l1.end()) == 3); [ 0:12] 152 std::list>::const_iterator i = l1.begin(); [ 0:12] 153 assert(*i == 2); [ 0:12] 154 ++i; [ 0:12] 155 assert(*i == 3); [ 0:12] 156 ++i; [ 0:12] 157 assert(*i == 1); [ 0:12] 158 } [ 0:12] 159 { [ 0:12] 160 std::list> l1(a1, a1+3); [ 0:12] 161 std::list> l2(a2, a2+3); [ 0:12] 162 l1.splice(l1.begin(), l2, next(l2.begin()), l2.end()); [ 0:12] 163 assert(l1.size() == 5); [ 0:12] 164 assert(distance(l1.begin(), l1.end()) == 5); [ 0:12] 165 std::list>::const_iterator i = l1.begin(); [ 0:12] 166 assert(*i == 5); [ 0:12] 167 ++i; [ 0:12] 168 assert(*i == 6); [ 0:12] 169 ++i; [ 0:12] 170 assert(*i == 1); [ 0:12] 171 ++i; [ 0:12] 172 assert(*i == 2); [ 0:12] 173 ++i; [ 0:12] 174 assert(*i == 3); [ 0:12] 175 assert(l2.size() == 1); [ 0:12] 176 i = l2.begin(); [ 0:12] 177 assert(*i == 4); [ 0:12] 178 } [ 0:12] 179 { [ 0:12] 180 std::list> l1(a1, a1+3); [ 0:12] 181 std::list> l2(a2, a2+3); [ 0:12] 182 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end()); [ 0:12] 183 assert(l1.size() == 5); [ 0:12] 184 assert(distance(l1.begin(), l1.end()) == 5); [ 0:12] 185 std::list>::const_iterator i = l1.begin(); [ 0:12] 186 assert(*i == 1); [ 0:12] 187 ++i; [ 0:12] 188 assert(*i == 5); [ 0:12] 189 ++i; [ 0:12] 190 assert(*i == 6); [ 0:12] 191 ++i; [ 0:12] 192 assert(*i == 2); [ 0:12] 193 ++i; [ 0:12] 194 assert(*i == 3); [ 0:12] 195 assert(l2.size() == 1); [ 0:12] 196 i = l2.begin(); [ 0:12] 197 assert(*i == 4); [ 0:12] 198 } [ 0:12] 199 { [ 0:12] 200 std::list> l1(a1, a1+3); [ 0:12] 201 std::list> l2(a2, a2+3); [ 0:12] 202 l1.splice(l1.end(), l2, next(l2.begin()), l2.end()); [ 0:12] 203 assert(l1.size() == 5); [ 0:12] 204 assert(distance(l1.begin(), l1.end()) == 5); [ 0:12] 205 std::list>::const_iterator i = l1.begin(); [ 0:12] 206 assert(*i == 1); [ 0:12] 207 ++i; [ 0:12] 208 assert(*i == 2); [ 0:12] 209 ++i; [ 0:12] 210 assert(*i == 3); [ 0:12] 211 ++i; [ 0:12] 212 assert(*i == 5); [ 0:12] 213 ++i; [ 0:12] 214 assert(*i == 6); [ 0:12] 215 assert(l2.size() == 1); [ 0:12] 216 i = l2.begin(); [ 0:12] 217 assert(*i == 4); [ 0:12] 218 } [ 0:12] 219 #endif [ 0:12] 220 [ 0:12] 221 return 0; [ 0:12] 222 } [ 0:12] # no errors were expected but one was found anyway