[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/find.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/find.pass.cpp:19: [ 0:01] In file included from /dios/libcxx/include/set:427: [ 0:01] In file included from /dios/libcxx/include/__tree:14: [ 0:01] In file included from /dios/libcxx/include/iterator:420: [ 0:01] In file included from /dios/libcxx/include/iosfwd:95: [ 0:01] In file included from /dios/libcxx/include/wchar.h:118: [ 0:01] In file included from /dios/include/wchar.h:9: [ 0:01] In file included from /dios/include/_PDCLIB/int.h:16: [ 0:01] /dios/include/_PDCLIB/cdefs.h:69:10: warning: Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011). [ 0:01] #warning Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011). [ 0:01] ^ [ 0:01] 1 warning generated. [ 0:03] compiling /dios/lib/config/seqklee.bc [ 0:03] setting up pass: functionmeta, options = [ 0:07] setting up pass: fuse-ctors, options = [ 0:07] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.22/_klee_out" [ 0:17] KLEE: Using Z3 solver backend [ 0:17] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:17] 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:17] [ 0:17] KLEE: WARNING: undefined reference to function: _Z10klee_abortv [ 0:33] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:33] KLEE: WARNING: undefined reference to function: klee_free [ 0:33] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:33] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:34] i:1 [ 0:34] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:34] about to __boot:0 [ 0:34] about to run the scheduler:0 [ 0:34] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:34] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:34] KLEE: NOTE: now ignoring this error at this location [ 0:34] KLEE: ERROR: EXITING ON ERROR: [ 0:36] Error: failed external call: __dios_tainted_init [ 0:36] File: /dios/libc/sys/start.cpp [ 0:36] Line: 87 [ 0:36] assembly.ll line: 118691 [ 0:36] Stack: [ 0:36] #000118691 in __dios_start (l=2, argc=1, argv=93872506078216, envp=93872506147336) at /dios/libc/sys/start.cpp:87 [ 0:36] #100066520 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:36] #200127271 in klee_boot (argc=2, argv=93872316972544) at /dios/arch/klee/boot.c:41 [ 0:36] [ 0:36] [ 0:36] 1 /* TAGS: c++ fin */ [ 0:36] 2 /* CC_OPTS: -std=c++2a */ [ 0:36] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:36] 4 //===----------------------------------------------------------------------===// [ 0:36] 5 // [ 0:36] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:36] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:36] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:36] 9 // [ 0:36] 10 //===----------------------------------------------------------------------===// [ 0:36] 11 [ 0:36] 12 // [ 0:36] 13 [ 0:36] 14 // class set [ 0:36] 15 [ 0:36] 16 // iterator find(const key_type& k); [ 0:36] 17 // const_iterator find(const key_type& k) const; [ 0:36] 18 [ 0:36] 19 #include [ 0:36] 20 #include [ 0:36] 21 [ 0:36] 22 #include "test_macros.h" [ 0:36] 23 #include "min_allocator.h" [ 0:36] 24 #include "private_constructor.hpp" [ 0:36] 25 [ 0:36] 26 int main(int, char**) [ 0:36] 27 { [ 0:36] 28 { [ 0:36] 29 typedef int V; [ 0:36] 30 typedef std::set M; [ 0:36] 31 { [ 0:36] 32 typedef M::iterator R; [ 0:36] 33 V ar[] = [ 0:36] 34 { [ 0:36] 35 5, [ 0:36] 36 6, [ 0:36] 37 7, [ 0:36] 38 8, [ 0:36] 39 9, [ 0:36] 40 10, [ 0:36] 41 11, [ 0:36] 42 12 [ 0:36] 43 }; [ 0:36] 44 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); [ 0:36] 45 R r = m.find(5); [ 0:36] 46 assert(r == m.begin()); [ 0:36] 47 r = m.find(6); [ 0:36] 48 assert(r == next(m.begin())); [ 0:36] 49 r = m.find(7); [ 0:36] 50 assert(r == next(m.begin(), 2)); [ 0:36] 51 r = m.find(8); [ 0:36] 52 assert(r == next(m.begin(), 3)); [ 0:36] 53 r = m.find(9); [ 0:36] 54 assert(r == next(m.begin(), 4)); [ 0:36] 55 r = m.find(10); [ 0:36] 56 assert(r == next(m.begin(), 5)); [ 0:36] 57 r = m.find(11); [ 0:36] 58 assert(r == next(m.begin(), 6)); [ 0:36] 59 r = m.find(12); [ 0:36] 60 assert(r == next(m.begin(), 7)); [ 0:36] 61 r = m.find(4); [ 0:36] 62 assert(r == next(m.begin(), 8)); [ 0:36] 63 } [ 0:36] 64 { [ 0:36] 65 typedef M::const_iterator R; [ 0:36] 66 V ar[] = [ 0:36] 67 { [ 0:36] 68 5, [ 0:36] 69 6, [ 0:36] 70 7, [ 0:36] 71 8, [ 0:36] 72 9, [ 0:36] 73 10, [ 0:36] 74 11, [ 0:36] 75 12 [ 0:36] 76 }; [ 0:36] 77 const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); [ 0:36] 78 R r = m.find(5); [ 0:36] 79 assert(r == m.begin()); [ 0:36] 80 r = m.find(6); [ 0:36] 81 assert(r == next(m.begin())); [ 0:36] 82 r = m.find(7); [ 0:36] 83 assert(r == next(m.begin(), 2)); [ 0:36] 84 r = m.find(8); [ 0:36] 85 assert(r == next(m.begin(), 3)); [ 0:36] 86 r = m.find(9); [ 0:36] 87 assert(r == next(m.begin(), 4)); [ 0:36] 88 r = m.find(10); [ 0:36] 89 assert(r == next(m.begin(), 5)); [ 0:36] 90 r = m.find(11); [ 0:36] 91 assert(r == next(m.begin(), 6)); [ 0:36] 92 r = m.find(12); [ 0:36] 93 assert(r == next(m.begin(), 7)); [ 0:36] 94 r = m.find(4); [ 0:36] 95 assert(r == next(m.begin(), 8)); [ 0:36] 96 } [ 0:36] 97 } [ 0:36] 98 #if TEST_STD_VER >= 11 [ 0:36] 99 { [ 0:36] 100 typedef int V; [ 0:36] 101 typedef std::set, min_allocator> M; [ 0:36] 102 { [ 0:36] 103 typedef M::iterator R; [ 0:36] 104 V ar[] = [ 0:36] 105 { [ 0:36] 106 5, [ 0:36] 107 6, [ 0:36] 108 7, [ 0:36] 109 8, [ 0:36] 110 9, [ 0:36] 111 10, [ 0:36] 112 11, [ 0:36] 113 12 [ 0:36] 114 }; [ 0:36] 115 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); [ 0:36] 116 R r = m.find(5); [ 0:36] 117 assert(r == m.begin()); [ 0:36] 118 r = m.find(6); [ 0:36] 119 assert(r == next(m.begin())); [ 0:36] 120 r = m.find(7); [ 0:36] 121 assert(r == next(m.begin(), 2)); [ 0:36] 122 r = m.find(8); [ 0:36] 123 assert(r == next(m.begin(), 3)); [ 0:36] 124 r = m.find(9); [ 0:36] 125 assert(r == next(m.begin(), 4)); [ 0:36] 126 r = m.find(10); [ 0:36] 127 assert(r == next(m.begin(), 5)); [ 0:36] 128 r = m.find(11); [ 0:36] 129 assert(r == next(m.begin(), 6)); [ 0:36] 130 r = m.find(12); [ 0:36] 131 assert(r == next(m.begin(), 7)); [ 0:36] 132 r = m.find(4); [ 0:36] 133 assert(r == next(m.begin(), 8)); [ 0:36] 134 } [ 0:36] 135 { [ 0:36] 136 typedef M::const_iterator R; [ 0:36] 137 V ar[] = [ 0:36] 138 { [ 0:36] 139 5, [ 0:36] 140 6, [ 0:36] 141 7, [ 0:36] 142 8, [ 0:36] 143 9, [ 0:36] 144 10, [ 0:36] 145 11, [ 0:36] 146 12 [ 0:36] 147 }; [ 0:36] 148 const M m(ar, ar+sizeof(ar)/sizeof(ar[0])); [ 0:36] 149 R r = m.find(5); [ 0:36] 150 assert(r == m.begin()); [ 0:36] 151 r = m.find(6); [ 0:36] 152 assert(r == next(m.begin())); [ 0:36] 153 r = m.find(7); [ 0:36] 154 assert(r == next(m.begin(), 2)); [ 0:36] 155 r = m.find(8); [ 0:36] 156 assert(r == next(m.begin(), 3)); [ 0:36] 157 r = m.find(9); [ 0:36] 158 assert(r == next(m.begin(), 4)); [ 0:36] 159 r = m.find(10); [ 0:36] 160 assert(r == next(m.begin(), 5)); [ 0:36] 161 r = m.find(11); [ 0:36] 162 assert(r == next(m.begin(), 6)); [ 0:36] 163 r = m.find(12); [ 0:36] 164 assert(r == next(m.begin(), 7)); [ 0:36] 165 r = m.find(4); [ 0:36] 166 assert(r == next(m.begin(), 8)); [ 0:36] 167 } [ 0:36] 168 } [ 0:36] 169 #endif [ 0:36] 170 #if TEST_STD_VER > 11 [ 0:36] 171 { [ 0:36] 172 typedef int V; [ 0:36] 173 typedef std::set> M; [ 0:36] 174 typedef M::iterator R; [ 0:36] 175 [ 0:36] 176 V ar[] = [ 0:36] 177 { [ 0:36] 178 5, [ 0:36] 179 6, [ 0:36] 180 7, [ 0:36] 181 8, [ 0:36] 182 9, [ 0:36] 183 10, [ 0:36] 184 11, [ 0:36] 185 12 [ 0:36] 186 }; [ 0:36] 187 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); [ 0:36] 188 R r = m.find(5); [ 0:36] 189 assert(r == m.begin()); [ 0:36] 190 r = m.find(6); [ 0:36] 191 assert(r == next(m.begin())); [ 0:36] 192 r = m.find(7); [ 0:36] 193 assert(r == next(m.begin(), 2)); [ 0:36] 194 r = m.find(8); [ 0:36] 195 assert(r == next(m.begin(), 3)); [ 0:36] 196 r = m.find(9); [ 0:36] 197 assert(r == next(m.begin(), 4)); [ 0:36] 198 r = m.find(10); [ 0:36] 199 assert(r == next(m.begin(), 5)); [ 0:36] 200 r = m.find(11); [ 0:36] 201 assert(r == next(m.begin(), 6)); [ 0:36] 202 r = m.find(12); [ 0:36] 203 assert(r == next(m.begin(), 7)); [ 0:36] 204 r = m.find(4); [ 0:36] 205 assert(r == next(m.begin(), 8)); [ 0:36] 206 } [ 0:36] 207 [ 0:36] 208 { [ 0:36] 209 typedef PrivateConstructor V; [ 0:36] 210 typedef std::set> M; [ 0:36] 211 typedef M::iterator R; [ 0:36] 212 [ 0:36] 213 M m; [ 0:36] 214 m.insert ( V::make ( 5 )); [ 0:36] 215 m.insert ( V::make ( 6 )); [ 0:36] 216 m.insert ( V::make ( 7 )); [ 0:36] 217 m.insert ( V::make ( 8 )); [ 0:36] 218 m.insert ( V::make ( 9 )); [ 0:36] 219 m.insert ( V::make ( 10 )); [ 0:36] 220 m.insert ( V::make ( 11 )); [ 0:36] 221 m.insert ( V::make ( 12 )); [ 0:36] 222 [ 0:36] 223 R r = m.find(5); [ 0:36] 224 assert(r == m.begin()); [ 0:36] 225 r = m.find(6); [ 0:36] 226 assert(r == next(m.begin())); [ 0:36] 227 r = m.find(7); [ 0:36] 228 assert(r == next(m.begin(), 2)); [ 0:36] 229 r = m.find(8); [ 0:36] 230 assert(r == next(m.begin(), 3)); [ 0:36] 231 r = m.find(9); [ 0:36] 232 assert(r == next(m.begin(), 4)); [ 0:36] 233 r = m.find(10); [ 0:36] 234 assert(r == next(m.begin(), 5)); [ 0:36] 235 r = m.find(11); [ 0:36] 236 assert(r == next(m.begin(), 6)); [ 0:36] 237 r = m.find(12); [ 0:36] 238 assert(r == next(m.begin(), 7)); [ 0:36] 239 r = m.find(4); [ 0:36] 240 assert(r == next(m.begin(), 8)); [ 0:36] 241 } [ 0:36] 242 #endif [ 0:36] 243 [ 0:36] 244 return 0; [ 0:36] 245 } [ 0:36] # no errors were expected but one was found anyway