[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/lower_bound.pass.cpp
[ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/lower_bound.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:03] setting up pass: fuse-ctors, options = 
[ 0:03] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.12/_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: _Z10klee_abortv
[ 0:13] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:13] KLEE: WARNING: undefined reference to function: klee_free
[ 0:13] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:13] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:13] i:1
[ 0:13] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:13] about to __boot:0
[ 0:13] about to run the scheduler:0
[ 0:13] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:13] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:13] KLEE: NOTE: now ignoring this error at this location
[ 0:13] KLEE: ERROR: EXITING ON ERROR:
[ 0:13] Error: failed external call: __dios_tainted_init
[ 0:13] File: /dios/libc/sys/start.cpp
[ 0:13] Line: 87
[ 0:13] assembly.ll line: 70341
[ 0:13] Stack: 
[ 0:13] 	#000070341 in __dios_start (l=2, argc=1, argv=94483987357704, envp=94483987376136) at /dios/libc/sys/start.cpp:87
[ 0:13] 	#100018170 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:13] 	#200078921 in klee_boot (argc=2, argv=94483948817792) at /dios/arch/klee/boot.c:41
[ 0:13] 
[ 0:13] 
[ 0:13]      1	/* TAGS: c++ fin */
[ 0:13]      2	/* CC_OPTS: -std=c++2a */
[ 0:13]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:13]      4	//===----------------------------------------------------------------------===//
[ 0:13]      5	//
[ 0:13]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:13]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:13]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:13]      9	//
[ 0:13]     10	//===----------------------------------------------------------------------===//
[ 0:13]     11	
[ 0:13]     12	// <algorithm>
[ 0:13]     13	
[ 0:13]     14	// template<ForwardIterator Iter, class T>
[ 0:13]     15	//   constexpr Iter    // constexpr after c++17
[ 0:13]     16	//   lower_bound(Iter first, Iter last, const T& value);
[ 0:13]     17	
[ 0:13]     18	#include <algorithm>
[ 0:13]     19	#include <vector>
[ 0:13]     20	#include <cassert>
[ 0:13]     21	#include <cstddef>
[ 0:13]     22	
[ 0:13]     23	#include "test_macros.h"
[ 0:13]     24	#include "test_iterators.h"
[ 0:13]     25	
[ 0:13]     26	#if TEST_STD_VER > 17
[ 0:13]     27	TEST_CONSTEXPR bool eq(int a, int b) { return a == b; }
[ 0:13]     28	
[ 0:13]     29	TEST_CONSTEXPR bool test_constexpr() {
[ 0:13]     30	    int ia[] = {1, 3, 6, 7};
[ 0:13]     31	
[ 0:13]     32	    return (std::lower_bound(std::begin(ia), std::end(ia), 2) == ia+1)
[ 0:13]     33	        && (std::lower_bound(std::begin(ia), std::end(ia), 3) == ia+1)
[ 0:13]     34	        && (std::lower_bound(std::begin(ia), std::end(ia), 9) == std::end(ia))
[ 0:13]     35	        ;
[ 0:13]     36	    }
[ 0:13]     37	#endif
[ 0:13]     38	
[ 0:13]     39	
[ 0:13]     40	template <class Iter, class T>
[ 0:13]     41	void
[ 0:13]     42	test(Iter first, Iter last, const T& value)
[ 0:13]     43	{
[ 0:13]     44	    Iter i = std::lower_bound(first, last, value);
[ 0:13]     45	    for (Iter j = first; j != i; ++j)
[ 0:13]     46	        assert(*j < value);
[ 0:13]     47	    for (Iter j = i; j != last; ++j)
[ 0:13]     48	        assert(!(*j < value));
[ 0:13]     49	}
[ 0:13]     50	
[ 0:13]     51	template <class Iter>
[ 0:13]     52	void
[ 0:13]     53	test()
[ 0:13]     54	{
[ 0:13]     55	    const unsigned N = 1000;
[ 0:13]     56	    const int M = 10;
[ 0:13]     57	    std::vector<int> v(N);
[ 0:13]     58	    int x = 0;
[ 0:13]     59	    for (std::size_t i = 0; i < v.size(); ++i)
[ 0:13]     60	    {
[ 0:13]     61	        v[i] = x;
[ 0:13]     62	        if (++x == M)
[ 0:13]     63	            x = 0;
[ 0:13]     64	    }
[ 0:13]     65	    std::sort(v.begin(), v.end());
[ 0:13]     66	    for (x = 0; x <= M; ++x)
[ 0:13]     67	        test(Iter(v.data()), Iter(v.data()+v.size()), x);
[ 0:13]     68	}
[ 0:13]     69	
[ 0:13]     70	int main(int, char**)
[ 0:13]     71	{
[ 0:13]     72	    int d[] = {0, 1, 2, 3};
[ 0:13]     73	    for (int* e = d; e <= d+4; ++e)
[ 0:13]     74	        for (int x = -1; x <= 4; ++x)
[ 0:13]     75	            test(d, e, x);
[ 0:13]     76	
[ 0:13]     77	    test<forward_iterator<const int*> >();
[ 0:13]     78	    test<bidirectional_iterator<const int*> >();
[ 0:13]     79	    test<random_access_iterator<const int*> >();
[ 0:13]     80	    test<const int*>();
[ 0:13]     81	
[ 0:13]     82	#if TEST_STD_VER > 17
[ 0:13]     83	    static_assert(test_constexpr());
[ 0:13]     84	#endif
[ 0:13]     85	
[ 0:13]     86	  return 0;
[ 0:13]     87	}
[ 0:13] # no errors were expected but one was found anyway