[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/splice_after_one.pass.cpp
[ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/splice_after_one.pass.cpp:16:
[ 0:01] In file included from /dios/libcxx/include/forward_list:181:
[ 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:03] setting up pass: fuse-ctors, options = 
[ 0:03] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.22/_klee_out"
[ 0:07] KLEE: Using Z3 solver backend
[ 0:07] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:07] 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:07] 
[ 0:07] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:11] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:11] KLEE: WARNING: undefined reference to function: klee_free
[ 0:11] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:11] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:11] i:1
[ 0:11] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:11] about to __boot:0
[ 0:11] about to run the scheduler:0
[ 0:11] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:11] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:11] KLEE: NOTE: now ignoring this error at this location
[ 0:11] KLEE: ERROR: EXITING ON ERROR:
[ 0:12] Error: failed external call: __dios_tainted_init
[ 0:12] File: /dios/libc/sys/start.cpp
[ 0:12] Line: 87
[ 0:12] assembly.ll line: 73711
[ 0:12] Stack: 
[ 0:12] 	#000073711 in __dios_start (l=2, argc=1, argv=94370343277064, envp=94370343346184) at /dios/libc/sys/start.cpp:87
[ 0:12] 	#100021540 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:12] 	#200082291 in klee_boot (argc=2, argv=94370310212992) at /dios/arch/klee/boot.c:41
[ 0:12] 
[ 0:12] 
[ 0:12]      1	/* TAGS: c++ fin */
[ 0:12]      2	/* CC_OPTS: -std=c++2a */
[ 0:12]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:12]      4	//===----------------------------------------------------------------------===//
[ 0:12]      5	//
[ 0:12]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:12]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:12]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:12]      9	//
[ 0:12]     10	//===----------------------------------------------------------------------===//
[ 0:12]     11	
[ 0:12]     12	// <forward_list>
[ 0:12]     13	
[ 0:12]     14	// void splice_after(const_iterator p, forward_list&& x, const_iterator i);
[ 0:12]     15	
[ 0:12]     16	#include <forward_list>
[ 0:12]     17	#include <cassert>
[ 0:12]     18	#include <iterator>
[ 0:12]     19	#include <cstddef>
[ 0:12]     20	
[ 0:12]     21	#include "test_macros.h"
[ 0:12]     22	#include "min_allocator.h"
[ 0:12]     23	
[ 0:12]     24	typedef int T;
[ 0:12]     25	const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7};
[ 0:12]     26	const T t2[] = {10, 11, 12};
[ 0:12]     27	const std::ptrdiff_t size_t1 = std::end(t1) - std::begin(t1);
[ 0:12]     28	const std::ptrdiff_t size_t2 = std::end(t2) - std::begin(t2);
[ 0:12]     29	
[ 0:12]     30	template <class C>
[ 0:12]     31	void
[ 0:12]     32	testd(const C& c, int p, int f)
[ 0:12]     33	{
[ 0:12]     34	    typename C::const_iterator i = c.begin();
[ 0:12]     35	    int n1 = 0;
[ 0:12]     36	    for (; n1 < p; ++n1, ++i)
[ 0:12]     37	        assert(*i == t1[n1]);
[ 0:12]     38	    for (int n2 = f; n2 < f+1; ++n2, ++i)
[ 0:12]     39	        assert(*i == t2[n2]);
[ 0:12]     40	    for (; n1 < size_t1; ++n1, ++i)
[ 0:12]     41	        assert(*i == t1[n1]);
[ 0:12]     42	    assert(distance(c.begin(), c.end()) == size_t1 + 1);
[ 0:12]     43	}
[ 0:12]     44	
[ 0:12]     45	template <class C>
[ 0:12]     46	void
[ 0:12]     47	tests(const C& c, int p, int f)
[ 0:12]     48	{
[ 0:12]     49	    typename C::const_iterator i = c.begin();
[ 0:12]     50	    int n = 0;
[ 0:12]     51	    if (p == f || p == f+1)
[ 0:12]     52	    {
[ 0:12]     53	        for (n = 0; n < size_t1; ++n, ++i)
[ 0:12]     54	            assert(*i == t1[n]);
[ 0:12]     55	    }
[ 0:12]     56	    else if (p < f)
[ 0:12]     57	    {
[ 0:12]     58	        for (n = 0; n < p; ++n, ++i)
[ 0:12]     59	            assert(*i == t1[n]);
[ 0:12]     60	        for (n = f; n < f+1; ++n, ++i)
[ 0:12]     61	            assert(*i == t1[n]);
[ 0:12]     62	        for (n = p; n < f; ++n, ++i)
[ 0:12]     63	            assert(*i == t1[n]);
[ 0:12]     64	        for (n = f+1; n < size_t1; ++n, ++i)
[ 0:12]     65	            assert(*i == t1[n]);
[ 0:12]     66	    }
[ 0:12]     67	    else // p > f+1
[ 0:12]     68	    {
[ 0:12]     69	        for (n = 0; n < f; ++n, ++i)
[ 0:12]     70	            assert(*i == t1[n]);
[ 0:12]     71	        for (n = f+1; n < p; ++n, ++i)
[ 0:12]     72	            assert(*i == t1[n]);
[ 0:12]     73	        for (n = f; n < f+1; ++n, ++i)
[ 0:12]     74	            assert(*i == t1[n]);
[ 0:12]     75	        for (n = p; n < size_t1; ++n, ++i)
[ 0:12]     76	            assert(*i == t1[n]);
[ 0:12]     77	    }
[ 0:12]     78	    assert(distance(c.begin(), c.end()) == size_t1);
[ 0:12]     79	}
[ 0:12]     80	
[ 0:12]     81	int main(int, char**)
[ 0:12]     82	{
[ 0:12]     83	    {
[ 0:12]     84	    // splicing different containers
[ 0:12]     85	    typedef std::forward_list<T> C;
[ 0:12]     86	    for (int f = 0; f <= size_t2-1; ++f)
[ 0:12]     87	    {
[ 0:12]     88	        for (int p = 0; p <= size_t1; ++p)
[ 0:12]     89	        {
[ 0:12]     90	            C c1(std::begin(t1), std::end(t1));
[ 0:12]     91	            C c2(std::begin(t2), std::end(t2));
[ 0:12]     92	
[ 0:12]     93	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
[ 0:12]     94	                  next(c2.cbefore_begin(), f));
[ 0:12]     95	            testd(c1, p, f);
[ 0:12]     96	        }
[ 0:12]     97	    }
[ 0:12]     98	
[ 0:12]     99	    // splicing within same container
[ 0:12]    100	    for (int f = 0; f <= size_t1-1; ++f)
[ 0:12]    101	    {
[ 0:12]    102	        for (int p = 0; p <= size_t1; ++p)
[ 0:12]    103	        {
[ 0:12]    104	            C c1(std::begin(t1), std::end(t1));
[ 0:12]    105	
[ 0:12]    106	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
[ 0:12]    107	                  next(c1.cbefore_begin(), f));
[ 0:12]    108	            tests(c1, p, f);
[ 0:12]    109	        }
[ 0:12]    110	    }
[ 0:12]    111	    }
[ 0:12]    112	#if TEST_STD_VER >= 11
[ 0:12]    113	    {
[ 0:12]    114	    // splicing different containers
[ 0:12]    115	    typedef std::forward_list<T, min_allocator<T>> C;
[ 0:12]    116	    for (int f = 0; f <= size_t2-1; ++f)
[ 0:12]    117	    {
[ 0:12]    118	        for (int p = 0; p <= size_t1; ++p)
[ 0:12]    119	        {
[ 0:12]    120	            C c1(std::begin(t1), std::end(t1));
[ 0:12]    121	            C c2(std::begin(t2), std::end(t2));
[ 0:12]    122	
[ 0:12]    123	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
[ 0:12]    124	                  next(c2.cbefore_begin(), f));
[ 0:12]    125	            testd(c1, p, f);
[ 0:12]    126	        }
[ 0:12]    127	    }
[ 0:12]    128	
[ 0:12]    129	    // splicing within same container
[ 0:12]    130	    for (int f = 0; f <= size_t1-1; ++f)
[ 0:12]    131	    {
[ 0:12]    132	        for (int p = 0; p <= size_t1; ++p)
[ 0:12]    133	        {
[ 0:12]    134	            C c1(std::begin(t1), std::end(t1));
[ 0:12]    135	
[ 0:12]    136	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
[ 0:12]    137	                  next(c1.cbefore_begin(), f));
[ 0:12]    138	            tests(c1, p, f);
[ 0:12]    139	        }
[ 0:12]    140	    }
[ 0:12]    141	    }
[ 0:12]    142	#endif
[ 0:12]    143	
[ 0:12]    144	  return 0;
[ 0:12]    145	}
[ 0:12] # no errors were expected but one was found anyway