[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/binary_search_comp.pass.cpp
[ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/binary_search_comp.pass.cpp:18:
[ 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.6/_klee_out"
[ 0:06] KLEE: Using Z3 solver backend
[ 0:06] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:06] 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:06] 
[ 0:06] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:11] 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] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:12] i:1
[ 0:12] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:12] about to __boot:0
[ 0:12] about to run the scheduler:0
[ 0:12] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:12] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:12] KLEE: NOTE: now ignoring this error at this location
[ 0:12] 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: 72483
[ 0:12] Stack: 
[ 0:12] 	#000072483 in __dios_start (l=2, argc=1, argv=94582149894664, envp=94582149963784) at /dios/libc/sys/start.cpp:87
[ 0:12] 	#100020312 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:12] 	#200081063 in klee_boot (argc=2, argv=94582122007936) 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	// <algorithm>
[ 0:12]     13	
[ 0:12]     14	// template<ForwardIterator Iter, class T, CopyConstructible Compare>
[ 0:12]     15	//   constexpr bool      // constexpr after C++17
[ 0:12]     16	//   binary_search(Iter first, Iter last, const T& value, Compare comp);
[ 0:12]     17	
[ 0:12]     18	#include <algorithm>
[ 0:12]     19	#include <vector>
[ 0:12]     20	#include <functional>
[ 0:12]     21	#include <cassert>
[ 0:12]     22	#include <cstddef>
[ 0:12]     23	
[ 0:12]     24	#include "test_macros.h"
[ 0:12]     25	#include "test_iterators.h"
[ 0:12]     26	
[ 0:12]     27	#if TEST_STD_VER > 17
[ 0:12]     28	TEST_CONSTEXPR bool lt(int a, int b) { return a < b; }
[ 0:12]     29	
[ 0:12]     30	TEST_CONSTEXPR bool test_constexpr() {
[ 0:12]     31	    int ia[] = {1, 3, 3, 6, 7};
[ 0:12]     32	
[ 0:12]     33	    return  std::binary_search(std::begin(ia), std::end(ia), 1, lt)
[ 0:12]     34	        &&  std::binary_search(std::begin(ia), std::end(ia), 3, lt)
[ 0:12]     35	        && !std::binary_search(std::begin(ia), std::end(ia), 9, lt)
[ 0:12]     36	        ;
[ 0:12]     37	    }
[ 0:12]     38	#endif
[ 0:12]     39	
[ 0:12]     40	template <class Iter, class T>
[ 0:12]     41	void
[ 0:12]     42	test(Iter first, Iter last, const T& value, bool x)
[ 0:12]     43	{
[ 0:12]     44	    assert(std::binary_search(first, last, value, std::greater<int>()) == x);
[ 0:12]     45	}
[ 0:12]     46	
[ 0:12]     47	template <class Iter>
[ 0:12]     48	void
[ 0:12]     49	test()
[ 0:12]     50	{
[ 0:12]     51	    const unsigned N = 1000;
[ 0:12]     52	    const int M = 10;
[ 0:12]     53	    std::vector<int> v(N);
[ 0:12]     54	    int x = 0;
[ 0:12]     55	    for (std::size_t i = 0; i < v.size(); ++i)
[ 0:12]     56	    {
[ 0:12]     57	        v[i] = x;
[ 0:12]     58	        if (++x == M)
[ 0:12]     59	            x = 0;
[ 0:12]     60	    }
[ 0:12]     61	    std::sort(v.begin(), v.end(), std::greater<int>());
[ 0:12]     62	    for (x = 0; x < M; ++x)
[ 0:12]     63	        test(Iter(v.data()), Iter(v.data()+v.size()), x, true);
[ 0:12]     64	    test(Iter(v.data()), Iter(v.data()+v.size()), -1, false);
[ 0:12]     65	    test(Iter(v.data()), Iter(v.data()+v.size()), M, false);
[ 0:12]     66	}
[ 0:12]     67	
[ 0:12]     68	int main(int, char**)
[ 0:12]     69	{
[ 0:12]     70	    int d[] = {6, 4, 2, 0};
[ 0:12]     71	    for (int* e = d; e <= d+4; ++e)
[ 0:12]     72	        for (int x = -1; x <= 7; ++x)
[ 0:12]     73	            test(d, e, x, (x % 2 == 0) && e != d && (-2*(e-d) + 8 <= x));
[ 0:12]     74	
[ 0:12]     75	    test<forward_iterator<const int*> >();
[ 0:12]     76	    test<bidirectional_iterator<const int*> >();
[ 0:12]     77	    test<random_access_iterator<const int*> >();
[ 0:12]     78	    test<const int*>();
[ 0:12]     79	
[ 0:12]     80	#if TEST_STD_VER > 17
[ 0:12]     81	    static_assert(test_constexpr());
[ 0:12]     82	#endif
[ 0:12]     83	
[ 0:12]     84	  return 0;
[ 0:12]     85	}
[ 0:12] # no errors were expected but one was found anyway