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