[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/search.pass.cpp [ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/search.pass.cpp:23: [ 0:01] In file included from /dios/libcxx/include/algorithm:639: [ 0:01] In file included from /dios/libcxx/include/initializer_list:46: [ 0:01] In file included from /dios/libcxx/include/cstddef:44: [ 0:01] In file included from /dios/include/stddef.h:10: [ 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:02] 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.4/_klee_out" [ 0:06] KLEE: Using Z3 solver backend [ 0:06] 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: __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] 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: 60055 [ 0:12] Stack: [ 0:12] #000060055 in __dios_start (l=2, argc=1, argv=94411719782920, envp=94411719860232) at /dios/libc/sys/start.cpp:87 [ 0:12] #100036064 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:12] #200068303 in klee_boot (argc=2, argv=94411673581568) 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 // template [ 0:12] 15 // requires HasEqualTo [ 0:12] 16 // constexpr Iter1 // constexpr after C++17 [ 0:12] 17 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); [ 0:12] 18 // [ 0:12] 19 // template [ 0:12] 20 // ForwardIterator search(ForwardIterator first, ForwardIterator last, [ 0:12] 21 // const Searcher& searcher); // C++17 [ 0:12] 22 [ 0:12] 23 #include [ 0:12] 24 #include [ 0:12] 25 [ 0:12] 26 #include "test_macros.h" [ 0:12] 27 #include "test_iterators.h" [ 0:12] 28 [ 0:12] 29 struct MySearcherC { [ 0:12] 30 template [ 0:12] 31 std::pair [ 0:12] 32 TEST_CONSTEXPR operator() (Iterator b, Iterator e) const [ 0:12] 33 { [ 0:12] 34 return std::make_pair(b, e); [ 0:12] 35 } [ 0:12] 36 }; [ 0:12] 37 [ 0:12] 38 #if TEST_STD_VER > 17 [ 0:12] 39 TEST_CONSTEXPR bool test_constexpr() { [ 0:12] 40 int ia[] = {0, 1, 2, 3}; [ 0:12] 41 int ib[] = {0, 1, 5, 3}; [ 0:12] 42 int ic[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; [ 0:12] 43 return (std::search(std::begin(ic), std::end(ic), std::begin(ia), std::end(ia)) == ic+3) [ 0:12] 44 && (std::search(std::begin(ic), std::end(ic), std::begin(ib), std::end(ib)) == std::end(ic)) [ 0:12] 45 && (std::search(std::begin(ic), std::end(ic), MySearcherC()) == std::begin(ic)) [ 0:12] 46 ; [ 0:12] 47 } [ 0:12] 48 #endif [ 0:12] 49 [ 0:12] 50 int searcher_called = 0; [ 0:12] 51 [ 0:12] 52 struct MySearcher { [ 0:12] 53 template [ 0:12] 54 std::pair [ 0:12] 55 operator() (Iterator b, Iterator e) const [ 0:12] 56 { [ 0:12] 57 ++searcher_called; [ 0:12] 58 return std::make_pair(b, e); [ 0:12] 59 } [ 0:12] 60 }; [ 0:12] 61 [ 0:12] 62 template [ 0:12] 63 void [ 0:12] 64 test() [ 0:12] 65 { [ 0:12] 66 int ia[] = {0, 1, 2, 3, 4, 5}; [ 0:12] 67 const unsigned sa = sizeof(ia)/sizeof(ia[0]); [ 0:12] 68 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); [ 0:12] 69 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); [ 0:12] 70 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); [ 0:12] 71 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); [ 0:12] 72 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); [ 0:12] 73 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); [ 0:12] 74 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia)); [ 0:12] 75 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); [ 0:12] 76 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3)); [ 0:12] 77 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); [ 0:12] 78 assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+sa-1)); [ 0:12] 79 assert(std::search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+1)); [ 0:12] 80 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; [ 0:12] 81 const unsigned sb = sizeof(ib)/sizeof(ib[0]); [ 0:12] 82 int ic[] = {1}; [ 0:12] 83 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); [ 0:12] 84 int id[] = {1, 2}; [ 0:12] 85 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1)); [ 0:12] 86 int ie[] = {1, 2, 3}; [ 0:12] 87 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3)) == Iter1(ib+4)); [ 0:12] 88 int ig[] = {1, 2, 3, 4}; [ 0:12] 89 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8)); [ 0:12] 90 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; [ 0:12] 91 const unsigned sh = sizeof(ih)/sizeof(ih[0]); [ 0:12] 92 int ii[] = {1, 1, 2}; [ 0:12] 93 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3)) == Iter1(ih+3)); [ 0:12] 94 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; [ 0:12] 95 const unsigned sj = sizeof(ij)/sizeof(ij[0]); [ 0:12] 96 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; [ 0:12] 97 const unsigned sk = sizeof(ik)/sizeof(ik[0]); [ 0:12] 98 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6)); [ 0:12] 99 } [ 0:12] 100 [ 0:12] 101 int main(int, char**) [ 0:12] 102 { [ 0:12] 103 test, forward_iterator >(); [ 0:12] 104 test, bidirectional_iterator >(); [ 0:12] 105 test, random_access_iterator >(); [ 0:12] 106 test, forward_iterator >(); [ 0:12] 107 test, bidirectional_iterator >(); [ 0:12] 108 test, random_access_iterator >(); [ 0:12] 109 test, forward_iterator >(); [ 0:12] 110 test, bidirectional_iterator >(); [ 0:12] 111 test, random_access_iterator >(); [ 0:12] 112 [ 0:12] 113 #if TEST_STD_VER > 14 [ 0:12] 114 { [ 0:12] 115 typedef int * RI; [ 0:12] 116 static_assert((std::is_same::value), "" ); [ 0:12] 117 [ 0:12] 118 RI it(nullptr); [ 0:12] 119 assert(it == std::search(it, it, MySearcher())); [ 0:12] 120 assert(searcher_called == 1); [ 0:12] 121 } [ 0:12] 122 #endif [ 0:12] 123 [ 0:12] 124 #if TEST_STD_VER > 17 [ 0:12] 125 static_assert(test_constexpr()); [ 0:12] 126 #endif [ 0:12] 127 [ 0:12] 128 return 0; [ 0:12] 129 } [ 0:12] # no errors were expected but one was found anyway