[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/unique_copy.pass.cpp
[ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/unique_copy.pass.cpp:22:
[ 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.4/_klee_out"
[ 0:06] KLEE: Using Z3 solver backend
[ 0:06] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:06] 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:06] 
[ 0:06] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:10] KLEE: WARNING: undefined reference to function: klee_free
[ 0:10] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:10] i:1
[ 0:10] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:10] about to __boot:0
[ 0:10] about to run the scheduler:0
[ 0:10] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:10] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:10] KLEE: NOTE: now ignoring this error at this location
[ 0:10] KLEE: ERROR: EXITING ON ERROR:
[ 0:11] Error: failed external call: __dios_tainted_init
[ 0:11] File: /dios/libc/sys/start.cpp
[ 0:11] Line: 87
[ 0:11] assembly.ll line: 68514
[ 0:11] Stack: 
[ 0:11] 	#000068514 in __dios_start (l=2, argc=1, argv=93918516015624, envp=93918516084744) at /dios/libc/sys/start.cpp:87
[ 0:11] 	#100044523 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:11] 	#200076762 in klee_boot (argc=2, argv=93918476785664) at /dios/arch/klee/boot.c:41
[ 0:11] 
[ 0:11] 
[ 0:11]      1	/* TAGS: c++ fin */
[ 0:11]      2	/* CC_OPTS: -std=c++2a */
[ 0:11]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:11]      4	//===----------------------------------------------------------------------===//
[ 0:11]      5	//
[ 0:11]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:11]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:11]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:11]      9	//
[ 0:11]     10	//===----------------------------------------------------------------------===//
[ 0:11]     11	
[ 0:11]     12	// <algorithm>
[ 0:11]     13	
[ 0:11]     14	// template<InputIterator InIter, class OutIter>
[ 0:11]     15	//   requires OutputIterator<OutIter, RvalueOf<InIter::value_type>::type>
[ 0:11]     16	//         && EqualityComparable<InIter::value_type>
[ 0:11]     17	//         && HasAssign<InIter::value_type, InIter::reference>
[ 0:11]     18	//         && Constructible<InIter::value_type, InIter::reference>
[ 0:11]     19	//   constexpr OutIter        // constexpr after C++17
[ 0:11]     20	//   unique_copy(InIter first, InIter last, OutIter result);
[ 0:11]     21	
[ 0:11]     22	#include <algorithm>
[ 0:11]     23	#include <cassert>
[ 0:11]     24	
[ 0:11]     25	#include "test_macros.h"
[ 0:11]     26	#include "test_iterators.h"
[ 0:11]     27	
[ 0:11]     28	#if TEST_STD_VER > 17
[ 0:11]     29	TEST_CONSTEXPR bool test_constexpr() {
[ 0:11]     30	          int ia[]       = {0, 1, 2, 2, 4};
[ 0:11]     31	          int ib[]       = {0, 0, 0, 0, 0};
[ 0:11]     32	    const int expected[] = {0, 1, 2, 4};
[ 0:11]     33	
[ 0:11]     34	    auto it = std::unique_copy(std::begin(ia), std::end(ia), std::begin(ib));
[ 0:11]     35	    return it == (std::begin(ib) + std::size(expected))
[ 0:11]     36	        && *it == 0 // don't overwrite final value in output
[ 0:11]     37	        && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))
[ 0:11]     38	        ;
[ 0:11]     39	    }
[ 0:11]     40	#endif
[ 0:11]     41	
[ 0:11]     42	template <class InIter, class OutIter>
[ 0:11]     43	void
[ 0:11]     44	test()
[ 0:11]     45	{
[ 0:11]     46	    const int ia[] = {0};
[ 0:11]     47	    const unsigned sa = sizeof(ia)/sizeof(ia[0]);
[ 0:11]     48	    int ja[sa] = {-1};
[ 0:11]     49	    OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
[ 0:11]     50	    assert(base(r) == ja + sa);
[ 0:11]     51	    assert(ja[0] == 0);
[ 0:11]     52	
[ 0:11]     53	    const int ib[] = {0, 1};
[ 0:11]     54	    const unsigned sb = sizeof(ib)/sizeof(ib[0]);
[ 0:11]     55	    int jb[sb] = {-1};
[ 0:11]     56	    r = std::unique_copy(InIter(ib), InIter(ib+sb), OutIter(jb));
[ 0:11]     57	    assert(base(r) == jb + sb);
[ 0:11]     58	    assert(jb[0] == 0);
[ 0:11]     59	    assert(jb[1] == 1);
[ 0:11]     60	
[ 0:11]     61	    const int ic[] = {0, 0};
[ 0:11]     62	    const unsigned sc = sizeof(ic)/sizeof(ic[0]);
[ 0:11]     63	    int jc[sc] = {-1};
[ 0:11]     64	    r = std::unique_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
[ 0:11]     65	    assert(base(r) == jc + 1);
[ 0:11]     66	    assert(jc[0] == 0);
[ 0:11]     67	
[ 0:11]     68	    const int id[] = {0, 0, 1};
[ 0:11]     69	    const unsigned sd = sizeof(id)/sizeof(id[0]);
[ 0:11]     70	    int jd[sd] = {-1};
[ 0:11]     71	    r = std::unique_copy(InIter(id), InIter(id+sd), OutIter(jd));
[ 0:11]     72	    assert(base(r) == jd + 2);
[ 0:11]     73	    assert(jd[0] == 0);
[ 0:11]     74	    assert(jd[1] == 1);
[ 0:11]     75	
[ 0:11]     76	    const int ie[] = {0, 0, 1, 0};
[ 0:11]     77	    const unsigned se = sizeof(ie)/sizeof(ie[0]);
[ 0:11]     78	    int je[se] = {-1};
[ 0:11]     79	    r = std::unique_copy(InIter(ie), InIter(ie+se), OutIter(je));
[ 0:11]     80	    assert(base(r) == je + 3);
[ 0:11]     81	    assert(je[0] == 0);
[ 0:11]     82	    assert(je[1] == 1);
[ 0:11]     83	    assert(je[2] == 0);
[ 0:11]     84	
[ 0:11]     85	    const int ig[] = {0, 0, 1, 1};
[ 0:11]     86	    const unsigned sg = sizeof(ig)/sizeof(ig[0]);
[ 0:11]     87	    int jg[sg] = {-1};
[ 0:11]     88	    r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg));
[ 0:11]     89	    assert(base(r) == jg + 2);
[ 0:11]     90	    assert(jg[0] == 0);
[ 0:11]     91	    assert(jg[1] == 1);
[ 0:11]     92	
[ 0:11]     93	    const int ih[] = {0, 1, 1};
[ 0:11]     94	    const unsigned sh = sizeof(ih)/sizeof(ih[0]);
[ 0:11]     95	    int jh[sh] = {-1};
[ 0:11]     96	    r = std::unique_copy(InIter(ih), InIter(ih+sh), OutIter(jh));
[ 0:11]     97	    assert(base(r) == jh + 2);
[ 0:11]     98	    assert(jh[0] == 0);
[ 0:11]     99	    assert(jh[1] == 1);
[ 0:11]    100	
[ 0:11]    101	    const int ii[] = {0, 1, 1, 1, 2, 2, 2};
[ 0:11]    102	    const unsigned si = sizeof(ii)/sizeof(ii[0]);
[ 0:11]    103	    int ji[si] = {-1};
[ 0:11]    104	    r = std::unique_copy(InIter(ii), InIter(ii+si), OutIter(ji));
[ 0:11]    105	    assert(base(r) == ji + 3);
[ 0:11]    106	    assert(ji[0] == 0);
[ 0:11]    107	    assert(ji[1] == 1);
[ 0:11]    108	    assert(ji[2] == 2);
[ 0:11]    109	}
[ 0:11]    110	
[ 0:11]    111	int main(int, char**)
[ 0:11]    112	{
[ 0:11]    113	    test<input_iterator<const int*>, output_iterator<int*> >();
[ 0:11]    114	    test<input_iterator<const int*>, forward_iterator<int*> >();
[ 0:11]    115	    test<input_iterator<const int*>, bidirectional_iterator<int*> >();
[ 0:11]    116	    test<input_iterator<const int*>, random_access_iterator<int*> >();
[ 0:11]    117	    test<input_iterator<const int*>, int*>();
[ 0:11]    118	
[ 0:11]    119	    test<forward_iterator<const int*>, output_iterator<int*> >();
[ 0:11]    120	    test<forward_iterator<const int*>, forward_iterator<int*> >();
[ 0:11]    121	    test<forward_iterator<const int*>, bidirectional_iterator<int*> >();
[ 0:11]    122	    test<forward_iterator<const int*>, random_access_iterator<int*> >();
[ 0:11]    123	    test<forward_iterator<const int*>, int*>();
[ 0:11]    124	
[ 0:11]    125	    test<bidirectional_iterator<const int*>, output_iterator<int*> >();
[ 0:11]    126	    test<bidirectional_iterator<const int*>, forward_iterator<int*> >();
[ 0:11]    127	    test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >();
[ 0:11]    128	    test<bidirectional_iterator<const int*>, random_access_iterator<int*> >();
[ 0:11]    129	    test<bidirectional_iterator<const int*>, int*>();
[ 0:11]    130	
[ 0:11]    131	    test<random_access_iterator<const int*>, output_iterator<int*> >();
[ 0:11]    132	    test<random_access_iterator<const int*>, forward_iterator<int*> >();
[ 0:11]    133	    test<random_access_iterator<const int*>, bidirectional_iterator<int*> >();
[ 0:11]    134	    test<random_access_iterator<const int*>, random_access_iterator<int*> >();
[ 0:11]    135	    test<random_access_iterator<const int*>, int*>();
[ 0:11]    136	
[ 0:11]    137	    test<const int*, output_iterator<int*> >();
[ 0:11]    138	    test<const int*, forward_iterator<int*> >();
[ 0:11]    139	    test<const int*, bidirectional_iterator<int*> >();
[ 0:11]    140	    test<const int*, random_access_iterator<int*> >();
[ 0:11]    141	    test<const int*, int*>();
[ 0:11]    142	
[ 0:11]    143	#if TEST_STD_VER > 17
[ 0:11]    144	    static_assert(test_constexpr());
[ 0:11]    145	#endif
[ 0:11]    146	
[ 0:11]    147	  return 0;
[ 0:11]    148	}
[ 0:11] # no errors were expected but one was found anyway