[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/forwardlist/splice_after_flist.pass.cpp
[ 0:00] 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.2/_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:06] 
[ 0:06] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:10] 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] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 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:10] Error: failed external call: __dios_tainted_init
[ 0:10] File: /dios/libc/sys/start.cpp
[ 0:10] Line: 87
[ 0:10] assembly.ll line: 70387
[ 0:10] Stack: 
[ 0:10] 	#000070387 in __dios_start (l=0, argc=1, argv=94609772098056, envp=94609772175368) at /dios/libc/sys/start.cpp:87
[ 0:10] 	#100018216 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:10] 	#200078967 in klee_boot (argc=2, argv=94609744792960) at /dios/arch/klee/boot.c:41
[ 0:10] 
[ 0:10] 
[ 0:10]      1	/* TAGS: c++ */
[ 0:10]      2	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:10]      3	//===----------------------------------------------------------------------===//
[ 0:10]      4	//
[ 0:10]      5	//                     The LLVM Compiler Infrastructure
[ 0:10]      6	//
[ 0:10]      7	// This file is dual licensed under the MIT and the University of Illinois Open
[ 0:10]      8	// Source Licenses. See LICENSE.TXT for details.
[ 0:10]      9	//
[ 0:10]     10	//===----------------------------------------------------------------------===//
[ 0:10]     11	
[ 0:10]     12	// <forward_list>
[ 0:10]     13	
[ 0:10]     14	// void splice_after(const_iterator p, forward_list&& x);
[ 0:10]     15	
[ 0:10]     16	#include <forward_list>
[ 0:10]     17	#include <cassert>
[ 0:10]     18	#include <iterator>
[ 0:10]     19	
[ 0:10]     20	#include "min_allocator.h"
[ 0:10]     21	
[ 0:10]     22	typedef int T;
[ 0:10]     23	const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7};
[ 0:10]     24	const T t2[] = {10, 11, 12, 13, 14, 15};
[ 0:10]     25	const int size_t1 = std::end(t1) - std::begin(t1);
[ 0:10]     26	const int size_t2 = std::end(t2) - std::begin(t2);
[ 0:10]     27	
[ 0:10]     28	template <class C>
[ 0:10]     29	void
[ 0:10]     30	testd(const C& c, int p, int l)
[ 0:10]     31	{
[ 0:10]     32	    typename C::const_iterator i = c.begin();
[ 0:10]     33	    int n1 = 0;
[ 0:10]     34	    for (; n1 < p; ++n1, ++i)
[ 0:10]     35	        assert(*i == t1[n1]);
[ 0:10]     36	    for (int n2 = 0; n2 < l; ++n2, ++i)
[ 0:10]     37	        assert(*i == t2[n2]);
[ 0:10]     38	    for (; n1 < size_t1; ++n1, ++i)
[ 0:10]     39	        assert(*i == t1[n1]);
[ 0:10]     40	    assert(distance(c.begin(), c.end()) == size_t1 + l);
[ 0:10]     41	}
[ 0:10]     42	
[ 0:10]     43	int main()
[ 0:10]     44	{
[ 0:10]     45	    {
[ 0:10]     46	    // splicing different containers
[ 0:10]     47	    typedef std::forward_list<T> C;
[ 0:10]     48	    for (int l = 0; l <= size_t2; ++l)
[ 0:10]     49	    {
[ 0:10]     50	        for (int p = 0; p <= size_t1; ++p)
[ 0:10]     51	        {
[ 0:10]     52	            C c1(std::begin(t1), std::end(t1));
[ 0:10]     53	            C c2(t2, t2+l);
[ 0:10]     54	
[ 0:10]     55	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
[ 0:10]     56	            testd(c1, p, l);
[ 0:10]     57	        }
[ 0:10]     58	    }
[ 0:10]     59	    }
[ 0:10]     60	#if __cplusplus >= 201103L
[ 0:10]     61	    {
[ 0:10]     62	    // splicing different containers
[ 0:10]     63	    typedef std::forward_list<T, min_allocator<T>> C;
[ 0:10]     64	    for (int l = 0; l <= size_t2; ++l)
[ 0:10]     65	    {
[ 0:10]     66	        for (int p = 0; p <= size_t1; ++p)
[ 0:10]     67	        {
[ 0:10]     68	            C c1(std::begin(t1), std::end(t1));
[ 0:10]     69	            C c2(t2, t2+l);
[ 0:10]     70	
[ 0:10]     71	            c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
[ 0:10]     72	            testd(c1, p, l);
[ 0:10]     73	        }
[ 0:10]     74	    }
[ 0:10]     75	    }
[ 0:10]     76	#endif
[ 0:10]     77	}
[ 0:10] # no errors were expected but one was found anyway