[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/splice_after_range.pass.cpp
[ 0:00] 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.1/_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: _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: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: 75533
[ 0:11] Stack: 
[ 0:11] 	#000075533 in __dios_start (l=0, argc=1, argv=94739846459912, envp=94739846520840) at /dios/libc/sys/start.cpp:87
[ 0:11] 	#100023362 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:11] 	#200084113 in klee_boot (argc=2, argv=94739811847552) at /dios/arch/klee/boot.c:41
[ 0:11] 
[ 0:11] 
[ 0:11]      1	/* TAGS: c++ */
[ 0:11]      2	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:11]      3	//===----------------------------------------------------------------------===//
[ 0:11]      4	//
[ 0:11]      5	//                     The LLVM Compiler Infrastructure
[ 0:11]      6	//
[ 0:11]      7	// This file is dual licensed under the MIT and the University of Illinois Open
[ 0:11]      8	// Source Licenses. See LICENSE.TXT for details.
[ 0:11]      9	//
[ 0:11]     10	//===----------------------------------------------------------------------===//
[ 0:11]     11	
[ 0:11]     12	// <forward_list>
[ 0:11]     13	
[ 0:11]     14	// void splice_after(const_iterator p, forward_list&& x,
[ 0:11]     15	//                   const_iterator first, const_iterator last);
[ 0:11]     16	
[ 0:11]     17	#include <forward_list>
[ 0:11]     18	#include <cassert>
[ 0:11]     19	#include <iterator>
[ 0:11]     20	
[ 0:11]     21	#include "min_allocator.h"
[ 0:11]     22	
[ 0:11]     23	typedef int T;
[ 0:11]     24	const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7};
[ 0:11]     25	const T t2[] = {10, 11, 12, 13, 14, 15};
[ 0:11]     26	const int size_t1 = std::end(t1) - std::begin(t1);
[ 0:11]     27	const int size_t2 = std::end(t2) - std::begin(t2);
[ 0:11]     28	
[ 0:11]     29	template <class C>
[ 0:11]     30	void
[ 0:11]     31	testd(const C& c, int p, int f, int l)
[ 0:11]     32	{
[ 0:11]     33	    typename C::const_iterator i = c.begin();
[ 0:11]     34	    int n1 = 0;
[ 0:11]     35	    for (; n1 < p; ++n1, ++i)
[ 0:11]     36	        assert(*i == t1[n1]);
[ 0:11]     37	    for (int n2 = f; n2 < l-1; ++n2, ++i)
[ 0:11]     38	        assert(*i == t2[n2]);
[ 0:11]     39	    for (; n1 < size_t1; ++n1, ++i)
[ 0:11]     40	        assert(*i == t1[n1]);
[ 0:11]     41	    assert(distance(c.begin(), c.end()) == size_t1 + (l > f+1 ? l-1-f : 0));
[ 0:11]     42	}
[ 0:11]     43	
[ 0:11]     44	template <class C>
[ 0:11]     45	void
[ 0:11]     46	tests(const C& c, int p, int f, int l)
[ 0:11]     47	{
[ 0:11]     48	    typename C::const_iterator i = c.begin();
[ 0:11]     49	    int n = 0;
[ 0:11]     50	    int d = l > f+1 ? l-1-f : 0;
[ 0:11]     51	    if (d == 0 || p == f)
[ 0:11]     52	    {
[ 0:11]     53	        for (n = 0; n < size_t1; ++n, ++i)
[ 0:11]     54	            assert(*i == t1[n]);
[ 0:11]     55	    }
[ 0:11]     56	    else if (p < f)
[ 0:11]     57	    {
[ 0:11]     58	        for (n = 0; n < p; ++n, ++i)
[ 0:11]     59	            assert(*i == t1[n]);
[ 0:11]     60	        for (n = f; n < l-1; ++n, ++i)
[ 0:11]     61	            assert(*i == t1[n]);
[ 0:11]     62	        for (n = p; n < f; ++n, ++i)
[ 0:11]     63	            assert(*i == t1[n]);
[ 0:11]     64	        for (n = l-1; n < size_t1; ++n, ++i)
[ 0:11]     65	            assert(*i == t1[n]);
[ 0:11]     66	    }
[ 0:11]     67	    else // p > f
[ 0:11]     68	    {
[ 0:11]     69	        for (n = 0; n < f; ++n, ++i)
[ 0:11]     70	            assert(*i == t1[n]);
[ 0:11]     71	        for (n = l-1; n < p; ++n, ++i)
[ 0:11]     72	            assert(*i == t1[n]);
[ 0:11]     73	        for (n = f; n < l-1; ++n, ++i)
[ 0:11]     74	            assert(*i == t1[n]);
[ 0:11]     75	        for (n = p; n < size_t1; ++n, ++i)
[ 0:11]     76	            assert(*i == t1[n]);
[ 0:11]     77	    }
[ 0:11]     78	    assert(distance(c.begin(), c.end()) == size_t1);
[ 0:11]     79	}
[ 0:11]     80	
[ 0:11]     81	int main()
[ 0:11]     82	{
[ 0:11]     83	    {
[ 0:11]     84	    // splicing different containers
[ 0:11]     85	    typedef std::forward_list<T> C;
[ 0:11]     86	    for (int f = 0; f <= size_t2+1; ++f)
[ 0:11]     87	    {
[ 0:11]     88	        for (int l = f; l <= size_t2+1; ++l)
[ 0:11]     89	        {
[ 0:11]     90	            for (int p = 0; p <= size_t1; ++p)
[ 0:11]     91	            {
[ 0:11]     92	                C c1(std::begin(t1), std::end(t1));
[ 0:11]     93	                C c2(std::begin(t2), std::end(t2));
[ 0:11]     94	
[ 0:11]     95	                c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
[ 0:11]     96	                      next(c2.cbefore_begin(), f), next(c2.cbefore_begin(), l));
[ 0:11]     97	                testd(c1, p, f, l);
[ 0:11]     98	            }
[ 0:11]     99	        }
[ 0:11]    100	    }
[ 0:11]    101	
[ 0:11]    102	    // splicing within same container
[ 0:11]    103	    for (int f = 0; f <= size_t1+1; ++f)
[ 0:11]    104	    {
[ 0:11]    105	        for (int l = f; l <= size_t1; ++l)
[ 0:11]    106	        {
[ 0:11]    107	            for (int p = 0; p <= f; ++p)
[ 0:11]    108	            {
[ 0:11]    109	                C c1(std::begin(t1), std::end(t1));
[ 0:11]    110	
[ 0:11]    111	                c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
[ 0:11]    112	                      next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l));
[ 0:11]    113	                tests(c1, p, f, l);
[ 0:11]    114	            }
[ 0:11]    115	            for (int p = l; p <= size_t1; ++p)
[ 0:11]    116	            {
[ 0:11]    117	                C c1(std::begin(t1), std::end(t1));
[ 0:11]    118	
[ 0:11]    119	                c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
[ 0:11]    120	                      next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l));
[ 0:11]    121	                tests(c1, p, f, l);
[ 0:11]    122	            }
[ 0:11]    123	        }
[ 0:11]    124	    }
[ 0:11]    125	    }
[ 0:11]    126	#if __cplusplus >= 201103L
[ 0:11]    127	    {
[ 0:11]    128	    // splicing different containers
[ 0:11]    129	    typedef std::forward_list<T, min_allocator<T>> C;
[ 0:11]    130	    for (int f = 0; f <= size_t2+1; ++f)
[ 0:11]    131	    {
[ 0:11]    132	        for (int l = f; l <= size_t2+1; ++l)
[ 0:11]    133	        {
[ 0:11]    134	            for (int p = 0; p <= size_t1; ++p)
[ 0:11]    135	            {
[ 0:11]    136	                C c1(std::begin(t1), std::end(t1));
[ 0:11]    137	                C c2(std::begin(t2), std::end(t2));
[ 0:11]    138	
[ 0:11]    139	                c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
[ 0:11]    140	                      next(c2.cbefore_begin(), f), next(c2.cbefore_begin(), l));
[ 0:11]    141	                testd(c1, p, f, l);
[ 0:11]    142	            }
[ 0:11]    143	        }
[ 0:11]    144	    }
[ 0:11]    145	
[ 0:11]    146	    // splicing within same container
[ 0:11]    147	    for (int f = 0; f <= size_t1+1; ++f)
[ 0:11]    148	    {
[ 0:11]    149	        for (int l = f; l <= size_t1; ++l)
[ 0:11]    150	        {
[ 0:11]    151	            for (int p = 0; p <= f; ++p)
[ 0:11]    152	            {
[ 0:11]    153	                C c1(std::begin(t1), std::end(t1));
[ 0:11]    154	
[ 0:11]    155	                c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
[ 0:11]    156	                      next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l));
[ 0:11]    157	                tests(c1, p, f, l);
[ 0:11]    158	            }
[ 0:11]    159	            for (int p = l; p <= size_t1; ++p)
[ 0:11]    160	            {
[ 0:11]    161	                C c1(std::begin(t1), std::end(t1));
[ 0:11]    162	
[ 0:11]    163	                c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
[ 0:11]    164	                      next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l));
[ 0:11]    165	                tests(c1, p, f, l);
[ 0:11]    166	            }
[ 0:11]    167	        }
[ 0:11]    168	    }
[ 0:11]    169	    }
[ 0:11]    170	#endif
[ 0:11]    171	}
[ 0:11] # no errors were expected but one was found anyway