[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/erase_iter_iter.pass.cpp [ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/erase_iter_iter.pass.cpp:18: [ 0:00] In file included from /dios/libcxx/include/set:427: [ 0:00] In file included from /dios/libcxx/include/__tree:14: [ 0:00] In file included from /dios/libcxx/include/iterator:420: [ 0:00] In file included from /dios/libcxx/include/iosfwd:95: [ 0:00] In file included from /dios/libcxx/include/wchar.h:118: [ 0:00] In file included from /dios/include/wchar.h:9: [ 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.8/_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:13] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:13] KLEE: WARNING: undefined reference to function: klee_free [ 0:13] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:13] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter [ 0:13] i:1 [ 0:13] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:13] about to __boot:0 [ 0:13] about to run the scheduler:0 [ 0:13] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:13] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:13] KLEE: NOTE: now ignoring this error at this location [ 0:13] KLEE: ERROR: EXITING ON ERROR: [ 0:13] Error: failed external call: __dios_tainted_init [ 0:13] File: /dios/libc/sys/start.cpp [ 0:13] Line: 87 [ 0:13] assembly.ll line: 116111 [ 0:13] Stack: [ 0:13] #000116111 in __dios_start (l=2, argc=1, argv=94642666050056, envp=94642666119176) at /dios/libc/sys/start.cpp:87 [ 0:13] #100063940 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:13] #200124691 in klee_boot (argc=2, argv=94642629933440) at /dios/arch/klee/boot.c:41 [ 0:13] [ 0:13] [ 0:13] 1 /* TAGS: c++ fin */ [ 0:13] 2 /* CC_OPTS: -std=c++2a */ [ 0:13] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:13] 4 //===----------------------------------------------------------------------===// [ 0:13] 5 // [ 0:13] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:13] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:13] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:13] 9 // [ 0:13] 10 //===----------------------------------------------------------------------===// [ 0:13] 11 [ 0:13] 12 // [ 0:13] 13 [ 0:13] 14 // class set [ 0:13] 15 [ 0:13] 16 // iterator erase(const_iterator first, const_iterator last); [ 0:13] 17 [ 0:13] 18 #include [ 0:13] 19 #include [ 0:13] 20 [ 0:13] 21 #include "test_macros.h" [ 0:13] 22 #include "min_allocator.h" [ 0:13] 23 [ 0:13] 24 int main(int, char**) [ 0:13] 25 { [ 0:13] 26 { [ 0:13] 27 typedef std::set M; [ 0:13] 28 typedef int V; [ 0:13] 29 typedef M::iterator I; [ 0:13] 30 V ar[] = [ 0:13] 31 { [ 0:13] 32 1, [ 0:13] 33 2, [ 0:13] 34 3, [ 0:13] 35 4, [ 0:13] 36 5, [ 0:13] 37 6, [ 0:13] 38 7, [ 0:13] 39 8 [ 0:13] 40 }; [ 0:13] 41 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); [ 0:13] 42 assert(m.size() == 8); [ 0:13] 43 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); [ 0:13] 44 assert(m.size() == 8); [ 0:13] 45 assert(i == next(m.begin(), 5)); [ 0:13] 46 assert(*next(m.begin(), 0) == 1); [ 0:13] 47 assert(*next(m.begin(), 1) == 2); [ 0:13] 48 assert(*next(m.begin(), 2) == 3); [ 0:13] 49 assert(*next(m.begin(), 3) == 4); [ 0:13] 50 assert(*next(m.begin(), 4) == 5); [ 0:13] 51 assert(*next(m.begin(), 5) == 6); [ 0:13] 52 assert(*next(m.begin(), 6) == 7); [ 0:13] 53 assert(*next(m.begin(), 7) == 8); [ 0:13] 54 [ 0:13] 55 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); [ 0:13] 56 assert(m.size() == 7); [ 0:13] 57 assert(i == next(m.begin(), 3)); [ 0:13] 58 assert(*next(m.begin(), 0) == 1); [ 0:13] 59 assert(*next(m.begin(), 1) == 2); [ 0:13] 60 assert(*next(m.begin(), 2) == 3); [ 0:13] 61 assert(*next(m.begin(), 3) == 5); [ 0:13] 62 assert(*next(m.begin(), 4) == 6); [ 0:13] 63 assert(*next(m.begin(), 5) == 7); [ 0:13] 64 assert(*next(m.begin(), 6) == 8); [ 0:13] 65 [ 0:13] 66 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); [ 0:13] 67 assert(m.size() == 4); [ 0:13] 68 assert(i == next(m.begin(), 2)); [ 0:13] 69 assert(*next(m.begin(), 0) == 1); [ 0:13] 70 assert(*next(m.begin(), 1) == 2); [ 0:13] 71 assert(*next(m.begin(), 2) == 7); [ 0:13] 72 assert(*next(m.begin(), 3) == 8); [ 0:13] 73 [ 0:13] 74 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); [ 0:13] 75 assert(m.size() == 2); [ 0:13] 76 assert(i == next(m.begin(), 0)); [ 0:13] 77 assert(*next(m.begin(), 0) == 7); [ 0:13] 78 assert(*next(m.begin(), 1) == 8); [ 0:13] 79 [ 0:13] 80 i = m.erase(m.cbegin(), m.cend()); [ 0:13] 81 assert(m.size() == 0); [ 0:13] 82 assert(i == m.end()); [ 0:13] 83 } [ 0:13] 84 #if TEST_STD_VER >= 11 [ 0:13] 85 { [ 0:13] 86 typedef std::set, min_allocator> M; [ 0:13] 87 typedef int V; [ 0:13] 88 typedef M::iterator I; [ 0:13] 89 V ar[] = [ 0:13] 90 { [ 0:13] 91 1, [ 0:13] 92 2, [ 0:13] 93 3, [ 0:13] 94 4, [ 0:13] 95 5, [ 0:13] 96 6, [ 0:13] 97 7, [ 0:13] 98 8 [ 0:13] 99 }; [ 0:13] 100 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); [ 0:13] 101 assert(m.size() == 8); [ 0:13] 102 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); [ 0:13] 103 assert(m.size() == 8); [ 0:13] 104 assert(i == next(m.begin(), 5)); [ 0:13] 105 assert(*next(m.begin(), 0) == 1); [ 0:13] 106 assert(*next(m.begin(), 1) == 2); [ 0:13] 107 assert(*next(m.begin(), 2) == 3); [ 0:13] 108 assert(*next(m.begin(), 3) == 4); [ 0:13] 109 assert(*next(m.begin(), 4) == 5); [ 0:13] 110 assert(*next(m.begin(), 5) == 6); [ 0:13] 111 assert(*next(m.begin(), 6) == 7); [ 0:13] 112 assert(*next(m.begin(), 7) == 8); [ 0:13] 113 [ 0:13] 114 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); [ 0:13] 115 assert(m.size() == 7); [ 0:13] 116 assert(i == next(m.begin(), 3)); [ 0:13] 117 assert(*next(m.begin(), 0) == 1); [ 0:13] 118 assert(*next(m.begin(), 1) == 2); [ 0:13] 119 assert(*next(m.begin(), 2) == 3); [ 0:13] 120 assert(*next(m.begin(), 3) == 5); [ 0:13] 121 assert(*next(m.begin(), 4) == 6); [ 0:13] 122 assert(*next(m.begin(), 5) == 7); [ 0:13] 123 assert(*next(m.begin(), 6) == 8); [ 0:13] 124 [ 0:13] 125 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); [ 0:13] 126 assert(m.size() == 4); [ 0:13] 127 assert(i == next(m.begin(), 2)); [ 0:13] 128 assert(*next(m.begin(), 0) == 1); [ 0:13] 129 assert(*next(m.begin(), 1) == 2); [ 0:13] 130 assert(*next(m.begin(), 2) == 7); [ 0:13] 131 assert(*next(m.begin(), 3) == 8); [ 0:13] 132 [ 0:13] 133 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); [ 0:13] 134 assert(m.size() == 2); [ 0:13] 135 assert(i == next(m.begin(), 0)); [ 0:13] 136 assert(*next(m.begin(), 0) == 7); [ 0:13] 137 assert(*next(m.begin(), 1) == 8); [ 0:13] 138 [ 0:13] 139 i = m.erase(m.cbegin(), m.cend()); [ 0:13] 140 assert(m.size() == 0); [ 0:13] 141 assert(i == m.end()); [ 0:13] 142 } [ 0:13] 143 #endif [ 0:13] 144 [ 0:13] 145 return 0; [ 0:13] 146 } [ 0:13] # no errors were expected but one was found anyway