[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/is_sorted_comp.pass.cpp [ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/is_sorted_comp.pass.cpp:19: [ 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.20/_klee_out" [ 0:04] KLEE: Using Z3 solver backend [ 0:04] WARNING: this target does not support the llvm.stacksave intrinsic. [ 0:04] 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:04] [ 0:04] KLEE: WARNING: undefined reference to function: __dios_tainted_init [ 0:07] KLEE: WARNING: undefined reference to function: klee_free [ 0:07] KLEE: WARNING: undefined reference to function: klee_malloc [ 0:07] i:1 [ 0:07] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8. [ 0:07] about to __boot:0 [ 0:07] about to run the scheduler:0 [ 0:07] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5 [ 0:07] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init [ 0:07] KLEE: NOTE: now ignoring this error at this location [ 0:07] KLEE: ERROR: EXITING ON ERROR: [ 0:07] Error: failed external call: __dios_tainted_init [ 0:07] File: /dios/libc/sys/start.cpp [ 0:07] Line: 87 [ 0:07] assembly.ll line: 41592 [ 0:07] Stack: [ 0:07] #000041592 in __dios_start (l=2, argc=1, argv=93878453064200, envp=93878453133320) at /dios/libc/sys/start.cpp:87 [ 0:07] #100017601 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:07] #200049840 in klee_boot (argc=2, argv=93878424451840) at /dios/arch/klee/boot.c:41 [ 0:07] [ 0:07] [ 0:07] 1 /* TAGS: c++ fin */ [ 0:07] 2 /* CC_OPTS: -std=c++2a */ [ 0:07] 3 /* VERIFY_OPTS: -o nofail:malloc */ [ 0:07] 4 //===----------------------------------------------------------------------===// [ 0:07] 5 // [ 0:07] 6 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. [ 0:07] 7 // See https://llvm.org/LICENSE.txt for license information. [ 0:07] 8 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception [ 0:07] 9 // [ 0:07] 10 //===----------------------------------------------------------------------===// [ 0:07] 11 [ 0:07] 12 // [ 0:07] 13 [ 0:07] 14 // template Compare> [ 0:07] 15 // requires CopyConstructible [ 0:07] 16 // bool [ 0:07] 17 // is_sorted(Iter first, Iter last, Compare comp); [ 0:07] 18 [ 0:07] 19 #include [ 0:07] 20 #include [ 0:07] 21 #include [ 0:07] 22 [ 0:07] 23 #include "test_macros.h" [ 0:07] 24 #include "test_iterators.h" [ 0:07] 25 [ 0:07] 26 #if TEST_STD_VER > 17 [ 0:07] 27 TEST_CONSTEXPR bool test_constexpr() { [ 0:07] 28 int ia[] = {1, 1, 0, 0}; [ 0:07] 29 int ib[] = {0, 0, 1, 1}; [ 0:07] 30 return std::is_sorted(std::begin(ia), std::end(ia), std::greater()) [ 0:07] 31 && !std::is_sorted(std::begin(ib), std::end(ib), std::greater()); [ 0:07] 32 } [ 0:07] 33 #endif [ 0:07] 34 [ 0:07] 35 template [ 0:07] 36 void [ 0:07] 37 test() [ 0:07] 38 { [ 0:07] 39 { [ 0:07] 40 int a[] = {0}; [ 0:07] 41 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 42 assert(std::is_sorted(Iter(a), Iter(a))); [ 0:07] 43 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 44 } [ 0:07] 45 [ 0:07] 46 { [ 0:07] 47 int a[] = {0, 0}; [ 0:07] 48 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 49 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 50 } [ 0:07] 51 { [ 0:07] 52 int a[] = {0, 1}; [ 0:07] 53 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 54 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 55 } [ 0:07] 56 { [ 0:07] 57 int a[] = {1, 0}; [ 0:07] 58 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 59 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 60 } [ 0:07] 61 { [ 0:07] 62 int a[] = {1, 1}; [ 0:07] 63 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 64 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 65 } [ 0:07] 66 [ 0:07] 67 { [ 0:07] 68 int a[] = {0, 0, 0}; [ 0:07] 69 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 70 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 71 } [ 0:07] 72 { [ 0:07] 73 int a[] = {0, 0, 1}; [ 0:07] 74 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 75 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 76 } [ 0:07] 77 { [ 0:07] 78 int a[] = {0, 1, 0}; [ 0:07] 79 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 80 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 81 } [ 0:07] 82 { [ 0:07] 83 int a[] = {0, 1, 1}; [ 0:07] 84 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 85 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 86 } [ 0:07] 87 { [ 0:07] 88 int a[] = {1, 0, 0}; [ 0:07] 89 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 90 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 91 } [ 0:07] 92 { [ 0:07] 93 int a[] = {1, 0, 1}; [ 0:07] 94 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 95 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 96 } [ 0:07] 97 { [ 0:07] 98 int a[] = {1, 1, 0}; [ 0:07] 99 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 100 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 101 } [ 0:07] 102 { [ 0:07] 103 int a[] = {1, 1, 1}; [ 0:07] 104 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 105 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 106 } [ 0:07] 107 [ 0:07] 108 { [ 0:07] 109 int a[] = {0, 0, 0, 0}; [ 0:07] 110 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 111 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 112 } [ 0:07] 113 { [ 0:07] 114 int a[] = {0, 0, 0, 1}; [ 0:07] 115 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 116 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 117 } [ 0:07] 118 { [ 0:07] 119 int a[] = {0, 0, 1, 0}; [ 0:07] 120 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 121 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 122 } [ 0:07] 123 { [ 0:07] 124 int a[] = {0, 0, 1, 1}; [ 0:07] 125 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 126 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 127 } [ 0:07] 128 { [ 0:07] 129 int a[] = {0, 1, 0, 0}; [ 0:07] 130 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 131 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 132 } [ 0:07] 133 { [ 0:07] 134 int a[] = {0, 1, 0, 1}; [ 0:07] 135 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 136 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 137 } [ 0:07] 138 { [ 0:07] 139 int a[] = {0, 1, 1, 0}; [ 0:07] 140 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 141 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 142 } [ 0:07] 143 { [ 0:07] 144 int a[] = {0, 1, 1, 1}; [ 0:07] 145 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 146 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 147 } [ 0:07] 148 { [ 0:07] 149 int a[] = {1, 0, 0, 0}; [ 0:07] 150 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 151 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 152 } [ 0:07] 153 { [ 0:07] 154 int a[] = {1, 0, 0, 1}; [ 0:07] 155 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 156 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 157 } [ 0:07] 158 { [ 0:07] 159 int a[] = {1, 0, 1, 0}; [ 0:07] 160 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 161 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 162 } [ 0:07] 163 { [ 0:07] 164 int a[] = {1, 0, 1, 1}; [ 0:07] 165 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 166 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 167 } [ 0:07] 168 { [ 0:07] 169 int a[] = {1, 1, 0, 0}; [ 0:07] 170 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 171 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 172 } [ 0:07] 173 { [ 0:07] 174 int a[] = {1, 1, 0, 1}; [ 0:07] 175 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 176 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 177 } [ 0:07] 178 { [ 0:07] 179 int a[] = {1, 1, 1, 0}; [ 0:07] 180 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 181 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 182 } [ 0:07] 183 { [ 0:07] 184 int a[] = {1, 1, 1, 1}; [ 0:07] 185 unsigned sa = sizeof(a) / sizeof(a[0]); [ 0:07] 186 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater())); [ 0:07] 187 } [ 0:07] 188 } [ 0:07] 189 [ 0:07] 190 int main(int, char**) [ 0:07] 191 { [ 0:07] 192 test >(); [ 0:07] 193 test >(); [ 0:07] 194 test >(); [ 0:07] 195 test(); [ 0:07] 196 [ 0:07] 197 #if TEST_STD_VER > 17 [ 0:07] 198 static_assert(test_constexpr()); [ 0:07] 199 #endif [ 0:07] 200 [ 0:07] 201 return 0; [ 0:07] 202 } [ 0:07] # no errors were expected but one was found anyway