[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/is_sorted_until.pass.cpp [ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/is_sorted_until.pass.cpp:19: [ 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: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.16/_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: 42365 [ 0:08] Stack: [ 0:08] #000042365 in __dios_start (l=2, argc=1, argv=94317454045704, envp=94317454123016) at /dios/libc/sys/start.cpp:87 [ 0:08] #100018374 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:08] #200050613 in klee_boot (argc=2, argv=94317426072320) 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 // requires LessThanComparable [ 0:08] 16 // Iter [ 0:08] 17 // is_sorted_until(Iter first, Iter last); [ 0:08] 18 [ 0:08] 19 #include [ 0:08] 20 #include [ 0:08] 21 [ 0:08] 22 #include "test_macros.h" [ 0:08] 23 #include "test_iterators.h" [ 0:08] 24 [ 0:08] 25 #if TEST_STD_VER > 17 [ 0:08] 26 TEST_CONSTEXPR bool test_constexpr() { [ 0:08] 27 int ia[] = {0, 1, 0}; [ 0:08] 28 int ib[] = {0, 1, 1}; [ 0:08] 29 return (std::is_sorted_until(std::begin(ia), std::end(ia)) == ia+2) [ 0:08] 30 && (std::is_sorted_until(std::begin(ib), std::end(ib)) == ib+3); [ 0:08] 31 } [ 0:08] 32 #endif [ 0:08] 33 [ 0:08] 34 template [ 0:08] 35 void [ 0:08] 36 test() [ 0:08] 37 { [ 0:08] 38 { [ 0:08] 39 int a[] = {0}; [ 0:08] 40 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 41 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); [ 0:08] 42 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 43 } [ 0:08] 44 [ 0:08] 45 { [ 0:08] 46 int a[] = {0, 0}; [ 0:08] 47 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 48 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 49 } [ 0:08] 50 { [ 0:08] 51 int a[] = {0, 1}; [ 0:08] 52 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 53 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 54 } [ 0:08] 55 { [ 0:08] 56 int a[] = {1, 0}; [ 0:08] 57 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 58 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); [ 0:08] 59 } [ 0:08] 60 { [ 0:08] 61 int a[] = {1, 1}; [ 0:08] 62 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 63 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 64 } [ 0:08] 65 [ 0:08] 66 { [ 0:08] 67 int a[] = {0, 0, 0}; [ 0:08] 68 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 69 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 70 } [ 0:08] 71 { [ 0:08] 72 int a[] = {0, 0, 1}; [ 0:08] 73 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 74 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 75 } [ 0:08] 76 { [ 0:08] 77 int a[] = {0, 1, 0}; [ 0:08] 78 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 79 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); [ 0:08] 80 } [ 0:08] 81 { [ 0:08] 82 int a[] = {0, 1, 1}; [ 0:08] 83 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 84 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 85 } [ 0:08] 86 { [ 0:08] 87 int a[] = {1, 0, 0}; [ 0:08] 88 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 89 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); [ 0:08] 90 } [ 0:08] 91 { [ 0:08] 92 int a[] = {1, 0, 1}; [ 0:08] 93 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 94 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); [ 0:08] 95 } [ 0:08] 96 { [ 0:08] 97 int a[] = {1, 1, 0}; [ 0:08] 98 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 99 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); [ 0:08] 100 } [ 0:08] 101 { [ 0:08] 102 int a[] = {1, 1, 1}; [ 0:08] 103 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 104 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 105 } [ 0:08] 106 [ 0:08] 107 { [ 0:08] 108 int a[] = {0, 0, 0, 0}; [ 0:08] 109 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 110 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 111 } [ 0:08] 112 { [ 0:08] 113 int a[] = {0, 0, 0, 1}; [ 0:08] 114 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 115 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 116 } [ 0:08] 117 { [ 0:08] 118 int a[] = {0, 0, 1, 0}; [ 0:08] 119 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 120 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+3)); [ 0:08] 121 } [ 0:08] 122 { [ 0:08] 123 int a[] = {0, 0, 1, 1}; [ 0:08] 124 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 125 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 126 } [ 0:08] 127 { [ 0:08] 128 int a[] = {0, 1, 0, 0}; [ 0:08] 129 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 130 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); [ 0:08] 131 } [ 0:08] 132 { [ 0:08] 133 int a[] = {0, 1, 0, 1}; [ 0:08] 134 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 135 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); [ 0:08] 136 } [ 0:08] 137 { [ 0:08] 138 int a[] = {0, 1, 1, 0}; [ 0:08] 139 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 140 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+3)); [ 0:08] 141 } [ 0:08] 142 { [ 0:08] 143 int a[] = {0, 1, 1, 1}; [ 0:08] 144 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 145 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 146 } [ 0:08] 147 { [ 0:08] 148 int a[] = {1, 0, 0, 0}; [ 0:08] 149 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 150 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); [ 0:08] 151 } [ 0:08] 152 { [ 0:08] 153 int a[] = {1, 0, 0, 1}; [ 0:08] 154 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 155 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); [ 0:08] 156 } [ 0:08] 157 { [ 0:08] 158 int a[] = {1, 0, 1, 0}; [ 0:08] 159 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 160 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); [ 0:08] 161 } [ 0:08] 162 { [ 0:08] 163 int a[] = {1, 0, 1, 1}; [ 0:08] 164 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 165 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); [ 0:08] 166 } [ 0:08] 167 { [ 0:08] 168 int a[] = {1, 1, 0, 0}; [ 0:08] 169 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 170 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); [ 0:08] 171 } [ 0:08] 172 { [ 0:08] 173 int a[] = {1, 1, 0, 1}; [ 0:08] 174 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 175 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); [ 0:08] 176 } [ 0:08] 177 { [ 0:08] 178 int a[] = {1, 1, 1, 0}; [ 0:08] 179 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 180 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+3)); [ 0:08] 181 } [ 0:08] 182 { [ 0:08] 183 int a[] = {1, 1, 1, 1}; [ 0:08] 184 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:08] 185 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); [ 0:08] 186 } [ 0:08] 187 } [ 0:08] 188 [ 0:08] 189 int main(int, char**) [ 0:08] 190 { [ 0:08] 191 test >(); [ 0:08] 192 test >(); [ 0:08] 193 test >(); [ 0:08] 194 test(); [ 0:08] 195 [ 0:08] 196 #if TEST_STD_VER > 17 [ 0:08] 197 static_assert(test_constexpr()); [ 0:08] 198 #endif [ 0:08] 199 [ 0:08] 200 return 0; [ 0:08] 201 } [ 0:08] # no errors were expected but one was found anyway