[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/find_end_pred.pass.cpp
[ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/find_end_pred.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:01] compiling /dios/lib/config/seqklee.bc
[ 0:01] setting up pass: functionmeta, options = 
[ 0:02] setting up pass: fuse-ctors, options = 
[ 0:02] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.11/_klee_out"
[ 0:04] KLEE: Using Z3 solver backend
[ 0:04] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:04] 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:04] 
[ 0:04] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:07] KLEE: WARNING: undefined reference to function: klee_free
[ 0:07] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:07] i:1
[ 0:07] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:07] about to __boot:0
[ 0:07] about to run the scheduler:0
[ 0:07] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:07] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:07] KLEE: NOTE: now ignoring this error at this location
[ 0:07] KLEE: ERROR: EXITING ON ERROR:
[ 0:07] Error: failed external call: __dios_tainted_init
[ 0:07] File: /dios/libc/sys/start.cpp
[ 0:07] Line: 87
[ 0:07] assembly.ll line: 43699
[ 0:07] Stack: 
[ 0:07] 	#000043699 in __dios_start (l=2, argc=1, argv=94016559182344, envp=94016559259656) at /dios/libc/sys/start.cpp:87
[ 0:07] 	#100019708 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:07] 	#200051947 in klee_boot (argc=2, argv=94016529676288) at /dios/arch/klee/boot.c:41
[ 0:07] 
[ 0:07] 
[ 0:07]      1	/* TAGS: c++ fin */
[ 0:07]      2	/* CC_OPTS: -std=c++2a */
[ 0:07]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:07]      4	//===----------------------------------------------------------------------===//
[ 0:07]      5	//
[ 0:07]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:07]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:07]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:07]      9	//
[ 0:07]     10	//===----------------------------------------------------------------------===//
[ 0:07]     11	
[ 0:07]     12	// <algorithm>
[ 0:07]     13	
[ 0:07]     14	// template<ForwardIterator Iter1, ForwardIterator Iter2,
[ 0:07]     15	//          Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
[ 0:07]     16	//   requires CopyConstructible<Pred>
[ 0:07]     17	//   constexpr Iter1  // constexpr after C++17
[ 0:07]     18	//   find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
[ 0:07]     19	
[ 0:07]     20	#include <algorithm>
[ 0:07]     21	#include <functional>
[ 0:07]     22	#include <cassert>
[ 0:07]     23	
[ 0:07]     24	#include "test_macros.h"
[ 0:07]     25	#include "test_iterators.h"
[ 0:07]     26	
[ 0:07]     27	struct count_equal
[ 0:07]     28	{
[ 0:07]     29	    static unsigned count;
[ 0:07]     30	    template <class T>
[ 0:07]     31	    TEST_CONSTEXPR_CXX14 bool operator()(const T& x, const T& y)
[ 0:07]     32	        {++count; return x == y;}
[ 0:07]     33	};
[ 0:07]     34	
[ 0:07]     35	#if TEST_STD_VER > 17
[ 0:07]     36	constexpr bool test_constexpr() {
[ 0:07]     37	    int ia[] = {0, 1, 2};
[ 0:07]     38	    int ib[] = {4, 5, 6};
[ 0:07]     39	    int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0};
[ 0:07]     40	    typedef forward_iterator<int*>       FI;
[ 0:07]     41	    typedef bidirectional_iterator<int*> BI;
[ 0:07]     42	    typedef random_access_iterator<int*> RI;
[ 0:07]     43	    std::equal_to<int> eq{};
[ 0:07]     44	    return    (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)), eq) == FI(ic+15))
[ 0:07]     45	           && (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) == FI(std::end(ic)))
[ 0:07]     46	           && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) == BI(ic+15))
[ 0:07]     47	           && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) == BI(std::end(ic)))
[ 0:07]     48	           && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) == RI(ic+15))
[ 0:07]     49	           && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) == RI(std::end(ic)))
[ 0:07]     50	           ;
[ 0:07]     51	    }
[ 0:07]     52	#endif
[ 0:07]     53	
[ 0:07]     54	unsigned count_equal::count = 0;
[ 0:07]     55	
[ 0:07]     56	template <class Iter1, class Iter2>
[ 0:07]     57	void
[ 0:07]     58	test()
[ 0:07]     59	{
[ 0:07]     60	    int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0};
[ 0:07]     61	    const unsigned sa = sizeof(ia)/sizeof(ia[0]);
[ 0:07]     62	    int b[] = {0};
[ 0:07]     63	    count_equal::count = 0;
[ 0:07]     64	    assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1));
[ 0:07]     65	    assert(count_equal::count <= 1*(sa-1+1));
[ 0:07]     66	    int c[] = {0, 1};
[ 0:07]     67	    count_equal::count = 0;
[ 0:07]     68	    assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18));
[ 0:07]     69	    assert(count_equal::count <= 2*(sa-2+1));
[ 0:07]     70	    int d[] = {0, 1, 2};
[ 0:07]     71	    count_equal::count = 0;
[ 0:07]     72	    assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15));
[ 0:07]     73	    assert(count_equal::count <= 3*(sa-3+1));
[ 0:07]     74	    int e[] = {0, 1, 2, 3};
[ 0:07]     75	    count_equal::count = 0;
[ 0:07]     76	    assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11));
[ 0:07]     77	    assert(count_equal::count <= 4*(sa-4+1));
[ 0:07]     78	    int f[] = {0, 1, 2, 3, 4};
[ 0:07]     79	    count_equal::count = 0;
[ 0:07]     80	    assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6));
[ 0:07]     81	    assert(count_equal::count <= 5*(sa-5+1));
[ 0:07]     82	    int g[] = {0, 1, 2, 3, 4, 5};
[ 0:07]     83	    count_equal::count = 0;
[ 0:07]     84	    assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia));
[ 0:07]     85	    assert(count_equal::count <= 6*(sa-6+1));
[ 0:07]     86	    int h[] = {0, 1, 2, 3, 4, 5, 6};
[ 0:07]     87	    count_equal::count = 0;
[ 0:07]     88	    assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa));
[ 0:07]     89	    assert(count_equal::count <= 7*(sa-7+1));
[ 0:07]     90	    count_equal::count = 0;
[ 0:07]     91	    assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa));
[ 0:07]     92	    assert(count_equal::count <= 0);
[ 0:07]     93	    count_equal::count = 0;
[ 0:07]     94	    assert(std::find_end(Iter1(ia), Iter1(ia), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia));
[ 0:07]     95	    assert(count_equal::count <= 0);
[ 0:07]     96	}
[ 0:07]     97	
[ 0:07]     98	int main(int, char**)
[ 0:07]     99	{
[ 0:07]    100	    test<forward_iterator<const int*>, forward_iterator<const int*> >();
[ 0:07]    101	    test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:07]    102	    test<forward_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:07]    103	    test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
[ 0:07]    104	    test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:07]    105	    test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:07]    106	    test<random_access_iterator<const int*>, forward_iterator<const int*> >();
[ 0:07]    107	    test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
[ 0:07]    108	    test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
[ 0:07]    109	
[ 0:07]    110	#if TEST_STD_VER > 17
[ 0:07]    111	    static_assert(test_constexpr());
[ 0:07]    112	#endif
[ 0:07]    113	
[ 0:07]    114	  return 0;
[ 0:07]    115	}
[ 0:07] # no errors were expected but one was found anyway