[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/search_n_pred.pass.cpp
[ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/search_n_pred.pass.cpp:19:
[ 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:02] setting up pass: fuse-ctors, options = 
[ 0:02] 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:09] KLEE: WARNING: undefined reference to function: klee_free
[ 0:09] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:09] i:1
[ 0:09] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:09] about to __boot:0
[ 0:09] about to run the scheduler:0
[ 0:09] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:09] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:09] KLEE: NOTE: now ignoring this error at this location
[ 0:09] KLEE: ERROR: EXITING ON ERROR:
[ 0:09] Error: failed external call: __dios_tainted_init
[ 0:09] File: /dios/libc/sys/start.cpp
[ 0:09] Line: 87
[ 0:09] assembly.ll line: 42973
[ 0:09] Stack: 
[ 0:09] 	#000042973 in __dios_start (l=2, argc=1, argv=94527361069576, envp=94527361138696) at /dios/libc/sys/start.cpp:87
[ 0:09] 	#100018982 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:09] 	#200051221 in klee_boot (argc=2, argv=94527332030464) at /dios/arch/klee/boot.c:41
[ 0:09] 
[ 0:09] 
[ 0:09]      1	/* TAGS: c++ fin */
[ 0:09]      2	/* CC_OPTS: -std=c++2a */
[ 0:09]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:09]      4	//===----------------------------------------------------------------------===//
[ 0:09]      5	//
[ 0:09]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:09]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:09]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:09]      9	//
[ 0:09]     10	//===----------------------------------------------------------------------===//
[ 0:09]     11	
[ 0:09]     12	// <algorithm>
[ 0:09]     13	
[ 0:09]     14	// template<class ForwardIterator, class Size, class T, class BinaryPredicate>
[ 0:09]     15	//   constexpr ForwardIterator     // constexpr after C++17
[ 0:09]     16	//   search_n(ForwardIterator first, ForwardIterator last, Size count,
[ 0:09]     17	//            const T& value, BinaryPredicate pred);
[ 0:09]     18	
[ 0:09]     19	#include <algorithm>
[ 0:09]     20	#include <cassert>
[ 0:09]     21	
[ 0:09]     22	#include "test_macros.h"
[ 0:09]     23	#include "test_iterators.h"
[ 0:09]     24	#include "user_defined_integral.hpp"
[ 0:09]     25	
[ 0:09]     26	#if TEST_STD_VER > 17
[ 0:09]     27	TEST_CONSTEXPR bool eq(int a, int b) { return a == b; }
[ 0:09]     28	
[ 0:09]     29	TEST_CONSTEXPR bool test_constexpr() {
[ 0:09]     30	    int ia[] = {0, 0, 1, 1, 2, 2};
[ 0:09]     31	    return    (std::search_n(std::begin(ia), std::end(ia), 1, 0, eq) == ia)
[ 0:09]     32	           && (std::search_n(std::begin(ia), std::end(ia), 2, 1, eq) == ia+2)
[ 0:09]     33	           && (std::search_n(std::begin(ia), std::end(ia), 1, 3, eq) == std::end(ia))
[ 0:09]     34	           ;
[ 0:09]     35	    }
[ 0:09]     36	#endif
[ 0:09]     37	
[ 0:09]     38	struct count_equal
[ 0:09]     39	{
[ 0:09]     40	    static unsigned count;
[ 0:09]     41	    template <class T>
[ 0:09]     42	    bool operator()(const T& x, const T& y)
[ 0:09]     43	        {++count; return x == y;}
[ 0:09]     44	};
[ 0:09]     45	
[ 0:09]     46	unsigned count_equal::count = 0;
[ 0:09]     47	
[ 0:09]     48	
[ 0:09]     49	template <class Iter>
[ 0:09]     50	void
[ 0:09]     51	test()
[ 0:09]     52	{
[ 0:09]     53	    int ia[] = {0, 1, 2, 3, 4, 5};
[ 0:09]     54	    const unsigned sa = sizeof(ia)/sizeof(ia[0]);
[ 0:09]     55	    count_equal::count = 0;
[ 0:09]     56	    assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
[ 0:09]     57	    assert(count_equal::count <= sa);
[ 0:09]     58	    count_equal::count = 0;
[ 0:09]     59	    assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
[ 0:09]     60	    assert(count_equal::count <= sa);
[ 0:09]     61	    count_equal::count = 0;
[ 0:09]     62	    assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa));
[ 0:09]     63	    assert(count_equal::count <= sa);
[ 0:09]     64	    count_equal::count = 0;
[ 0:09]     65	    assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa));
[ 0:09]     66	    assert(count_equal::count <= sa);
[ 0:09]     67	    count_equal::count = 0;
[ 0:09]     68	    assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia));
[ 0:09]     69	    assert(count_equal::count <= sa);
[ 0:09]     70	    count_equal::count = 0;
[ 0:09]     71	    assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3));
[ 0:09]     72	    assert(count_equal::count <= sa);
[ 0:09]     73	    count_equal::count = 0;
[ 0:09]     74	    assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa));
[ 0:09]     75	    assert(count_equal::count <= sa);
[ 0:09]     76	    count_equal::count = 0;
[ 0:09]     77	    assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa));
[ 0:09]     78	    assert(count_equal::count <= sa);
[ 0:09]     79	    count_equal::count = 0;
[ 0:09]     80	    assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia));
[ 0:09]     81	    assert(count_equal::count <= sa);
[ 0:09]     82	    count_equal::count = 0;
[ 0:09]     83	    assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5, count_equal()) == Iter(ia+5));
[ 0:09]     84	    assert(count_equal::count <= sa);
[ 0:09]     85	    count_equal::count = 0;
[ 0:09]     86	    assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 5, count_equal()) == Iter(ia+sa));
[ 0:09]     87	    assert(count_equal::count <= sa);
[ 0:09]     88	    count_equal::count = 0;
[ 0:09]     89	    assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 5, count_equal()) == Iter(ia+sa));
[ 0:09]     90	    assert(count_equal::count <= sa);
[ 0:09]     91	    count_equal::count = 0;
[ 0:09]     92	
[ 0:09]     93	    int ib[] = {0, 0, 1, 1, 2, 2};
[ 0:09]     94	    const unsigned sb = sizeof(ib)/sizeof(ib[0]);
[ 0:09]     95	    assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib));
[ 0:09]     96	    assert(count_equal::count <= sb);
[ 0:09]     97	    count_equal::count = 0;
[ 0:09]     98	    assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0));
[ 0:09]     99	    assert(count_equal::count <= sb);
[ 0:09]    100	    count_equal::count = 0;
[ 0:09]    101	    assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0));
[ 0:09]    102	    assert(count_equal::count <= sb);
[ 0:09]    103	    count_equal::count = 0;
[ 0:09]    104	    assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0, count_equal()) == Iter(ib+sb));
[ 0:09]    105	    assert(count_equal::count <= sb);
[ 0:09]    106	    count_equal::count = 0;
[ 0:09]    107	    assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0, count_equal()) == Iter(ib+sb));
[ 0:09]    108	    assert(count_equal::count <= sb);
[ 0:09]    109	    count_equal::count = 0;
[ 0:09]    110	    assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1, count_equal()) == Iter(ib));
[ 0:09]    111	    assert(count_equal::count <= sb);
[ 0:09]    112	    count_equal::count = 0;
[ 0:09]    113	    assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1, count_equal()) == Iter(ib+2));
[ 0:09]    114	    assert(count_equal::count <= sb);
[ 0:09]    115	    count_equal::count = 0;
[ 0:09]    116	    assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1, count_equal()) == Iter(ib+2));
[ 0:09]    117	    assert(count_equal::count <= sb);
[ 0:09]    118	    count_equal::count = 0;
[ 0:09]    119	    assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1, count_equal()) == Iter(ib+sb));
[ 0:09]    120	    assert(count_equal::count <= sb);
[ 0:09]    121	    count_equal::count = 0;
[ 0:09]    122	    assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 1, count_equal()) == Iter(ib+sb));
[ 0:09]    123	    assert(count_equal::count <= sb);
[ 0:09]    124	    count_equal::count = 0;
[ 0:09]    125	    assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2, count_equal()) == Iter(ib));
[ 0:09]    126	    assert(count_equal::count <= sb);
[ 0:09]    127	    count_equal::count = 0;
[ 0:09]    128	    assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2, count_equal()) == Iter(ib+4));
[ 0:09]    129	    assert(count_equal::count <= sb);
[ 0:09]    130	    count_equal::count = 0;
[ 0:09]    131	    assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 2, count_equal()) == Iter(ib+4));
[ 0:09]    132	    assert(count_equal::count <= sb);
[ 0:09]    133	    count_equal::count = 0;
[ 0:09]    134	    assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 2, count_equal()) == Iter(ib+sb));
[ 0:09]    135	    assert(count_equal::count <= sb);
[ 0:09]    136	    count_equal::count = 0;
[ 0:09]    137	    assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 2, count_equal()) == Iter(ib+sb));
[ 0:09]    138	    assert(count_equal::count <= sb);
[ 0:09]    139	    count_equal::count = 0;
[ 0:09]    140	
[ 0:09]    141	    int ic[] = {0, 0, 0};
[ 0:09]    142	    const unsigned sc = sizeof(ic)/sizeof(ic[0]);
[ 0:09]    143	    assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic));
[ 0:09]    144	    assert(count_equal::count <= sc);
[ 0:09]    145	    count_equal::count = 0;
[ 0:09]    146	    assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic));
[ 0:09]    147	    assert(count_equal::count <= sc);
[ 0:09]    148	    count_equal::count = 0;
[ 0:09]    149	    assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic));
[ 0:09]    150	    assert(count_equal::count <= sc);
[ 0:09]    151	    count_equal::count = 0;
[ 0:09]    152	    assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0, count_equal()) == Iter(ic));
[ 0:09]    153	    assert(count_equal::count <= sc);
[ 0:09]    154	    count_equal::count = 0;
[ 0:09]    155	    assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0, count_equal()) == Iter(ic+sc));
[ 0:09]    156	    assert(count_equal::count <= sc);
[ 0:09]    157	    count_equal::count = 0;
[ 0:09]    158	
[ 0:09]    159	    // Check that we properly convert the size argument to an integral.
[ 0:09]    160	    TEST_IGNORE_NODISCARD std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(4), 0, count_equal());
[ 0:09]    161	    count_equal::count = 0;
[ 0:09]    162	}
[ 0:09]    163	
[ 0:09]    164	int main(int, char**)
[ 0:09]    165	{
[ 0:09]    166	    test<forward_iterator<const int*> >();
[ 0:09]    167	    test<bidirectional_iterator<const int*> >();
[ 0:09]    168	    test<random_access_iterator<const int*> >();
[ 0:09]    169	
[ 0:09]    170	#if TEST_STD_VER > 17
[ 0:09]    171	    static_assert(test_constexpr());
[ 0:09]    172	#endif
[ 0:09]    173	
[ 0:09]    174	  return 0;
[ 0:09]    175	}
[ 0:09] # no errors were expected but one was found anyway