[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/lexicographical_compare.pass.cpp
[ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/lexicographical_compare.pass.cpp:20:
[ 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.21/_klee_out"
[ 0:05] KLEE: Using Z3 solver backend
[ 0:05] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:05] 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:05] 
[ 0:05] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:08] KLEE: WARNING: undefined reference to function: klee_free
[ 0:08] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:08] i:1
[ 0:08] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:08] about to __boot:0
[ 0:08] about to run the scheduler:0
[ 0:08] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:08] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:08] KLEE: NOTE: now ignoring this error at this location
[ 0:08] KLEE: ERROR: EXITING ON ERROR:
[ 0:08] Error: failed external call: __dios_tainted_init
[ 0:08] File: /dios/libc/sys/start.cpp
[ 0:08] Line: 87
[ 0:08] assembly.ll line: 53328
[ 0:08] Stack: 
[ 0:08] 	#000053328 in __dios_start (l=2, argc=1, argv=94643872543240, envp=94643872612360) at /dios/libc/sys/start.cpp:87
[ 0:08] 	#100029337 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:08] 	#200061576 in klee_boot (argc=2, argv=94643838860032) at /dios/arch/klee/boot.c:41
[ 0:08] 
[ 0:08] 
[ 0:08]      1	/* TAGS: c++ fin */
[ 0:08]      2	/* CC_OPTS: -std=c++2a */
[ 0:08]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:08]      4	//===----------------------------------------------------------------------===//
[ 0:08]      5	//
[ 0:08]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:08]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:08]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:08]      9	//
[ 0:08]     10	//===----------------------------------------------------------------------===//
[ 0:08]     11	
[ 0:08]     12	// <algorithm>
[ 0:08]     13	
[ 0:08]     14	// template<InputIterator Iter1, InputIterator Iter2>
[ 0:08]     15	//   requires HasLess<Iter1::value_type, Iter2::value_type>
[ 0:08]     16	//         && HasLess<Iter2::value_type, Iter1::value_type>
[ 0:08]     17	//   constexpr bool             // constexpr after C++17
[ 0:08]     18	//   lexicographical_compare(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
[ 0:08]     19	
[ 0:08]     20	#include <algorithm>
[ 0:08]     21	#include <cassert>
[ 0:08]     22	
[ 0:08]     23	#include "test_macros.h"
[ 0:08]     24	#include "test_iterators.h"
[ 0:08]     25	
[ 0:08]     26	#if TEST_STD_VER > 17
[ 0:08]     27	TEST_CONSTEXPR bool test_constexpr() {
[ 0:08]     28	    int ia[] = {1, 2, 3};
[ 0:08]     29	    int ib[] = {1, 3, 5, 2, 4, 6};
[ 0:08]     30	
[ 0:08]     31	    return  std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib))
[ 0:08]     32	        && !std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia))
[ 0:08]     33	           ;
[ 0:08]     34	    }
[ 0:08]     35	#endif
[ 0:08]     36	
[ 0:08]     37	template <class Iter1, class Iter2>
[ 0:08]     38	void
[ 0:08]     39	test()
[ 0:08]     40	{
[ 0:08]     41	    int ia[] = {1, 2, 3, 4};
[ 0:08]     42	    const unsigned sa = sizeof(ia)/sizeof(ia[0]);
[ 0:08]     43	    int ib[] = {1, 2, 3};
[ 0:08]     44	    assert(!std::lexicographical_compare(Iter1(ia),   Iter1(ia+sa), Iter2(ib),   Iter2(ib+2)));
[ 0:08]     45	    assert( std::lexicographical_compare(Iter1(ib),   Iter1(ib+2),  Iter2(ia),   Iter2(ia+sa)));
[ 0:08]     46	    assert(!std::lexicographical_compare(Iter1(ia),   Iter1(ia+sa), Iter2(ib),   Iter2(ib+3)));
[ 0:08]     47	    assert( std::lexicographical_compare(Iter1(ib),   Iter1(ib+3),  Iter2(ia),   Iter2(ia+sa)));
[ 0:08]     48	    assert( std::lexicographical_compare(Iter1(ia),   Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3)));
[ 0:08]     49	    assert(!std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3),  Iter2(ia),   Iter2(ia+sa)));
[ 0:08]     50	}
[ 0:08]     51	
[ 0:08]     52	int main(int, char**)
[ 0:08]     53	{
[ 0:08]     54	    test<input_iterator<const int*>, input_iterator<const int*> >();
[ 0:08]     55	    test<input_iterator<const int*>, forward_iterator<const int*> >();
[ 0:08]     56	    test<input_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:08]     57	    test<input_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:08]     58	    test<input_iterator<const int*>, const int*>();
[ 0:08]     59	
[ 0:08]     60	    test<forward_iterator<const int*>, input_iterator<const int*> >();
[ 0:08]     61	    test<forward_iterator<const int*>, forward_iterator<const int*> >();
[ 0:08]     62	    test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:08]     63	    test<forward_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:08]     64	    test<forward_iterator<const int*>, const int*>();
[ 0:08]     65	
[ 0:08]     66	    test<bidirectional_iterator<const int*>, input_iterator<const int*> >();
[ 0:08]     67	    test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
[ 0:08]     68	    test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:08]     69	    test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:08]     70	    test<bidirectional_iterator<const int*>, const int*>();
[ 0:08]     71	
[ 0:08]     72	    test<random_access_iterator<const int*>, input_iterator<const int*> >();
[ 0:08]     73	    test<random_access_iterator<const int*>, forward_iterator<const int*> >();
[ 0:08]     74	    test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:08]     75	    test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:08]     76	    test<random_access_iterator<const int*>, const int*>();
[ 0:08]     77	
[ 0:08]     78	    test<const int*, input_iterator<const int*> >();
[ 0:08]     79	    test<const int*, forward_iterator<const int*> >();
[ 0:08]     80	    test<const int*, bidirectional_iterator<const int*> >();
[ 0:08]     81	    test<const int*, random_access_iterator<const int*> >();
[ 0:08]     82	    test<const int*, const int*>();
[ 0:08]     83	
[ 0:08]     84	#if TEST_STD_VER > 17
[ 0:08]     85	    static_assert(test_constexpr());
[ 0:08]     86	#endif
[ 0:08]     87	
[ 0:08]     88	  return 0;
[ 0:08]     89	}
[ 0:08] # no errors were expected but one was found anyway