[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/partition_point.pass.cpp [ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/partition_point.pass.cpp:18: [ 0:00] In file included from /dios/libcxx/include/algorithm:639: [ 0:00] In file included from /dios/libcxx/include/initializer_list:46: [ 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:02] setting up pass: fuse-ctors, options = [ 0:02] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.23/_klee_out" [ 0:05] KLEE: Using Z3 solver backend [ 0:05] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:05] 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:05] [ 0:05] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:08] KLEE: WARNING: undefined reference to function: klee_free [ 0:08] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:08] i:1 [ 0:08] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:08] about to __boot:0 [ 0:08] about to run the scheduler:0 [ 0:08] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:08] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:08] KLEE: NOTE: now ignoring this error at this location [ 0:08] KLEE: ERROR: EXITING ON ERROR: [ 0:08] Error: failed external call: __dios_tainted_init [ 0:08] File: /dios/libc/sys/start.cpp [ 0:08] Line: 87 [ 0:08] assembly.ll line: 34016 [ 0:08] Stack: [ 0:08] #000034016 in __dios_start (l=2, argc=1, argv=94119969313288, envp=94119969382408) at /dios/libc/sys/start.cpp:87 [ 0:08] #100010042 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:08] #200042281 in klee_boot (argc=2, argv=94119944362752) at /dios/arch/klee/boot.c:41 [ 0:08] [ 0:08] [ 0:08] 1 /* TAGS: c++ fin */ [ 0:08] 2 /* CC_OPTS: -std=c++2a */ [ 0:08] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:08] 4 //===----------------------------------------------------------------------===// [ 0:08] 5 // [ 0:08] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:08] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:08] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:08] 9 // [ 0:08] 10 //===----------------------------------------------------------------------===// [ 0:08] 11 [ 0:08] 12 // [ 0:08] 13 [ 0:08] 14 // template [ 0:08] 15 // constpexr ForwardIterator // constexpr after C++17 [ 0:08] 16 // partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); [ 0:08] 17 [ 0:08] 18 #include [ 0:08] 19 #include [ 0:08] 20 [ 0:08] 21 #include "test_macros.h" [ 0:08] 22 #include "test_iterators.h" [ 0:08] 23 [ 0:08] 24 struct is_odd [ 0:08] 25 { [ 0:08] 26 TEST_CONSTEXPR bool operator()(const int& i) const {return i & 1;} [ 0:08] 27 }; [ 0:08] 28 [ 0:08] 29 [ 0:08] 30 #if TEST_STD_VER > 17 [ 0:08] 31 TEST_CONSTEXPR bool test_constexpr() { [ 0:08] 32 int ia[] = {1, 3, 5, 2, 4, 6}; [ 0:08] 33 int ib[] = {1, 2, 3, 4, 5, 6}; [ 0:08] 34 return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3) [ 0:08] 35 && (std::partition_point(std::begin(ib), std::end(ib), is_odd()) == ib+1) [ 0:08] 36 ; [ 0:08] 37 } [ 0:08] 38 #endif [ 0:08] 39 [ 0:08] 40 [ 0:08] 41 int main(int, char**) [ 0:08] 42 { [ 0:08] 43 { [ 0:08] 44 const int ia[] = {2, 4, 6, 8, 10}; [ 0:08] 45 assert(std::partition_point(forward_iterator(std::begin(ia)), [ 0:08] 46 forward_iterator(std::end(ia)), [ 0:08] 47 is_odd()) == forward_iterator(ia)); [ 0:08] 48 } [ 0:08] 49 { [ 0:08] 50 const int ia[] = {1, 2, 4, 6, 8}; [ 0:08] 51 assert(std::partition_point(forward_iterator(std::begin(ia)), [ 0:08] 52 forward_iterator(std::end(ia)), [ 0:08] 53 is_odd()) == forward_iterator(ia + 1)); [ 0:08] 54 } [ 0:08] 55 { [ 0:08] 56 const int ia[] = {1, 3, 2, 4, 6}; [ 0:08] 57 assert(std::partition_point(forward_iterator(std::begin(ia)), [ 0:08] 58 forward_iterator(std::end(ia)), [ 0:08] 59 is_odd()) == forward_iterator(ia + 2)); [ 0:08] 60 } [ 0:08] 61 { [ 0:08] 62 const int ia[] = {1, 3, 5, 2, 4, 6}; [ 0:08] 63 assert(std::partition_point(forward_iterator(std::begin(ia)), [ 0:08] 64 forward_iterator(std::end(ia)), [ 0:08] 65 is_odd()) == forward_iterator(ia + 3)); [ 0:08] 66 } [ 0:08] 67 { [ 0:08] 68 const int ia[] = {1, 3, 5, 7, 2, 4}; [ 0:08] 69 assert(std::partition_point(forward_iterator(std::begin(ia)), [ 0:08] 70 forward_iterator(std::end(ia)), [ 0:08] 71 is_odd()) == forward_iterator(ia + 4)); [ 0:08] 72 } [ 0:08] 73 { [ 0:08] 74 const int ia[] = {1, 3, 5, 7, 9, 2}; [ 0:08] 75 assert(std::partition_point(forward_iterator(std::begin(ia)), [ 0:08] 76 forward_iterator(std::end(ia)), [ 0:08] 77 is_odd()) == forward_iterator(ia + 5)); [ 0:08] 78 } [ 0:08] 79 { [ 0:08] 80 const int ia[] = {1, 3, 5, 7, 9, 11}; [ 0:08] 81 assert(std::partition_point(forward_iterator(std::begin(ia)), [ 0:08] 82 forward_iterator(std::end(ia)), [ 0:08] 83 is_odd()) == forward_iterator(ia + 6)); [ 0:08] 84 } [ 0:08] 85 { [ 0:08] 86 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; [ 0:08] 87 assert(std::partition_point(forward_iterator(std::begin(ia)), [ 0:08] 88 forward_iterator(std::begin(ia)), [ 0:08] 89 is_odd()) == forward_iterator(ia)); [ 0:08] 90 } [ 0:08] 91 [ 0:08] 92 #if TEST_STD_VER > 17 [ 0:08] 93 static_assert(test_constexpr()); [ 0:08] 94 #endif [ 0:08] 95 [ 0:08] 96 return 0; [ 0:08] 97 } [ 0:08] # no errors were expected but one was found anyway