[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/equal_range.pass.cpp
[ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/equal_range.pass.cpp:20:
[ 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: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.14/_klee_out"
[ 0:08] KLEE: Using Z3 solver backend
[ 0:08] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:08] 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:08] 
[ 0:08] 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:14] Error: failed external call: __dios_tainted_init
[ 0:14] File: /dios/libc/sys/start.cpp
[ 0:14] Line: 87
[ 0:14] assembly.ll line: 73314
[ 0:14] Stack: 
[ 0:14] 	#000073314 in __dios_start (l=2, argc=1, argv=93972410785800, envp=93972410804232) at /dios/libc/sys/start.cpp:87
[ 0:14] 	#100021143 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:14] 	#200081894 in klee_boot (argc=2, argv=93972371664256) at /dios/arch/klee/boot.c:41
[ 0:14] 
[ 0:14] 
[ 0:14]      1	/* TAGS: c++ fin ext */
[ 0:14]      2	/* CC_OPTS: -std=c++2a */
[ 0:14]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:14]      4	//===----------------------------------------------------------------------===//
[ 0:14]      5	//
[ 0:14]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:14]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:14]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:14]      9	//
[ 0:14]     10	//===----------------------------------------------------------------------===//
[ 0:14]     11	
[ 0:14]     12	// <algorithm>
[ 0:14]     13	
[ 0:14]     14	// template<ForwardIterator Iter, class T>
[ 0:14]     15	//   requires HasLess<T, Iter::value_type>
[ 0:14]     16	//         && HasLess<Iter::value_type, T>
[ 0:14]     17	//   constexpr pair<Iter, Iter>   // constexpr after c++17
[ 0:14]     18	//   equal_range(Iter first, Iter last, const T& value);
[ 0:14]     19	
[ 0:14]     20	#include <algorithm>
[ 0:14]     21	#include <vector>
[ 0:14]     22	#include <cassert>
[ 0:14]     23	#include <cstddef>
[ 0:14]     24	
[ 0:14]     25	#include "test_macros.h"
[ 0:14]     26	#include "test_iterators.h"
[ 0:14]     27	
[ 0:14]     28	#if TEST_STD_VER > 17
[ 0:14]     29	TEST_CONSTEXPR bool lt(int a, int b) { return a < b; }
[ 0:14]     30	
[ 0:14]     31	TEST_CONSTEXPR bool test_constexpr() {
[ 0:14]     32	    int ia[] = {1, 3, 3, 6, 7};
[ 0:14]     33	
[ 0:14]     34	    return (std::equal_range(std::begin(ia), std::end(ia), 1, lt) == std::pair<int *, int *>(ia+0, ia+1))
[ 0:14]     35	        && (std::equal_range(std::begin(ia), std::end(ia), 3, lt) == std::pair<int *, int *>(ia+1, ia+3))
[ 0:14]     36	        && (std::equal_range(std::begin(ia), std::end(ia), 9, lt) == std::pair<int *, int *>(std::end(ia), std::end(ia)))
[ 0:14]     37	        ;
[ 0:14]     38	    }
[ 0:14]     39	#endif
[ 0:14]     40	
[ 0:14]     41	template <class Iter, class T>
[ 0:14]     42	void
[ 0:14]     43	test(Iter first, Iter last, const T& value)
[ 0:14]     44	{
[ 0:14]     45	    std::pair<Iter, Iter> i = std::equal_range(first, last, value);
[ 0:14]     46	    for (Iter j = first; j != i.first; ++j)
[ 0:14]     47	        assert(*j < value);
[ 0:14]     48	    for (Iter j = i.first; j != last; ++j)
[ 0:14]     49	        assert(!(*j < value));
[ 0:14]     50	    for (Iter j = first; j != i.second; ++j)
[ 0:14]     51	        assert(!(value < *j));
[ 0:14]     52	    for (Iter j = i.second; j != last; ++j)
[ 0:14]     53	        assert(value < *j);
[ 0:14]     54	}
[ 0:14]     55	
[ 0:14]     56	template <class Iter>
[ 0:14]     57	void
[ 0:14]     58	test()
[ 0:14]     59	{
[ 0:14]     60	    const unsigned N = 1000;
[ 0:14]     61	    const int M = 10;
[ 0:14]     62	    std::vector<int> v(N);
[ 0:14]     63	    int x = 0;
[ 0:14]     64	    for (std::size_t i = 0; i < v.size(); ++i)
[ 0:14]     65	    {
[ 0:14]     66	        v[i] = x;
[ 0:14]     67	        if (++x == M)
[ 0:14]     68	            x = 0;
[ 0:14]     69	    }
[ 0:14]     70	    std::sort(v.begin(), v.end());
[ 0:14]     71	    for (x = 0; x <= M; ++x)
[ 0:14]     72	        test(Iter(v.data()), Iter(v.data()+v.size()), x);
[ 0:14]     73	}
[ 0:14]     74	
[ 0:14]     75	int main(int, char**)
[ 0:14]     76	{
[ 0:14]     77	    int d[] = {0, 1, 2, 3};
[ 0:14]     78	    for (int* e = d; e <= d+4; ++e)
[ 0:14]     79	        for (int x = -1; x <= 4; ++x)
[ 0:14]     80	            test(d, e, x);
[ 0:14]     81	
[ 0:14]     82	    test<forward_iterator<const int*> >();
[ 0:14]     83	    test<bidirectional_iterator<const int*> >();
[ 0:14]     84	    test<random_access_iterator<const int*> >();
[ 0:14]     85	    test<const int*>();
[ 0:14]     86	
[ 0:14]     87	#if TEST_STD_VER > 17
[ 0:14]     88	    static_assert(test_constexpr());
[ 0:14]     89	#endif
[ 0:14]     90	
[ 0:14]     91	  return 0;
[ 0:14]     92	}
[ 0:14] # no errors were expected but one was found anyway