[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/deque/move.pass.cpp
[ 0:01] compiling /dios/lib/config/seqklee.bc
[ 0:02] setting up pass: functionmeta, options = 
[ 0:04] setting up pass: fuse-ctors, options = 
[ 0:04] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.4/_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:08] 
[ 0:08] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:13] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:13] KLEE: WARNING: undefined reference to function: klee_free
[ 0:13] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:13] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:13] i:1
[ 0:13] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:13] about to __boot:0
[ 0:13] about to run the scheduler:0
[ 0:13] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:13] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:13] KLEE: NOTE: now ignoring this error at this location
[ 0:13] KLEE: ERROR: EXITING ON ERROR:
[ 0:13] Error: failed external call: __dios_tainted_init
[ 0:13] File: /dios/libc/sys/start.cpp
[ 0:13] Line: 87
[ 0:13] assembly.ll line: 89835
[ 0:13] Stack: 
[ 0:13] 	#000089835 in __dios_start (l=0, argc=1, argv=94245181016072, envp=94245181109768) at /dios/libc/sys/start.cpp:87
[ 0:13] 	#100037837 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:13] 	#200098415 in klee_boot (argc=2, argv=94245148740992) at /dios/arch/klee/boot.c:41
[ 0:13] 
[ 0:13] 
[ 0:13]      1	/* TAGS: c++ */
[ 0:13]      2	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:13]      3	//===----------------------------------------------------------------------===//
[ 0:13]      4	//
[ 0:13]      5	//                     The LLVM Compiler Infrastructure
[ 0:13]      6	//
[ 0:13]      7	// This file is dual licensed under the MIT and the University of Illinois Open
[ 0:13]      8	// Source Licenses. See LICENSE.TXT for details.
[ 0:13]      9	//
[ 0:13]     10	//===----------------------------------------------------------------------===//
[ 0:13]     11	
[ 0:13]     12	// <deque>
[ 0:13]     13	
[ 0:13]     14	// deque(deque&&);
[ 0:13]     15	
[ 0:13]     16	#include <deque>
[ 0:13]     17	#include <cassert>
[ 0:13]     18	
[ 0:13]     19	#include "MoveOnly.h"
[ 0:13]     20	#include "test_allocator.h"
[ 0:13]     21	#include "min_allocator.h"
[ 0:13]     22	
[ 0:13]     23	int main()
[ 0:13]     24	{
[ 0:13]     25	#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
[ 0:13]     26	    {
[ 0:13]     27	        int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
[ 0:13]     28	        int* an = ab + sizeof(ab)/sizeof(ab[0]);
[ 0:13]     29	        typedef test_allocator<MoveOnly> A;
[ 0:13]     30	        std::deque<MoveOnly, A> c1(A(1));
[ 0:13]     31	        for (int* p = ab; p < an; ++p)
[ 0:13]     32	            c1.push_back(MoveOnly(*p));
[ 0:13]     33	        std::deque<MoveOnly, A> c2(A(2));
[ 0:13]     34	        for (int* p = ab; p < an; ++p)
[ 0:13]     35	            c2.push_back(MoveOnly(*p));
[ 0:13]     36	        std::deque<MoveOnly, A> c3 = std::move(c1);
[ 0:13]     37	        assert(c2 == c3);
[ 0:13]     38	        assert(c1.size() == 0);
[ 0:13]     39	        assert(c3.get_allocator() == c1.get_allocator());
[ 0:13]     40	    }
[ 0:13]     41	    {
[ 0:13]     42	        int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
[ 0:13]     43	        int* an = ab + sizeof(ab)/sizeof(ab[0]);
[ 0:13]     44	        typedef other_allocator<MoveOnly> A;
[ 0:13]     45	        std::deque<MoveOnly, A> c1(A(1));
[ 0:13]     46	        for (int* p = ab; p < an; ++p)
[ 0:13]     47	            c1.push_back(MoveOnly(*p));
[ 0:13]     48	        std::deque<MoveOnly, A> c2(A(2));
[ 0:13]     49	        for (int* p = ab; p < an; ++p)
[ 0:13]     50	            c2.push_back(MoveOnly(*p));
[ 0:13]     51	        std::deque<MoveOnly, A> c3 = std::move(c1);
[ 0:13]     52	        assert(c2 == c3);
[ 0:13]     53	        assert(c1.size() == 0);
[ 0:13]     54	        assert(c3.get_allocator() == c1.get_allocator());
[ 0:13]     55	    }
[ 0:13]     56	#if __cplusplus >= 201103L
[ 0:13]     57	    {
[ 0:13]     58	        int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
[ 0:13]     59	        int* an = ab + sizeof(ab)/sizeof(ab[0]);
[ 0:13]     60	        typedef min_allocator<MoveOnly> A;
[ 0:13]     61	        std::deque<MoveOnly, A> c1(A{});
[ 0:13]     62	        for (int* p = ab; p < an; ++p)
[ 0:13]     63	            c1.push_back(MoveOnly(*p));
[ 0:13]     64	        std::deque<MoveOnly, A> c2(A{});
[ 0:13]     65	        for (int* p = ab; p < an; ++p)
[ 0:13]     66	            c2.push_back(MoveOnly(*p));
[ 0:13]     67	        std::deque<MoveOnly, A> c3 = std::move(c1);
[ 0:13]     68	        assert(c2 == c3);
[ 0:13]     69	        assert(c1.size() == 0);
[ 0:13]     70	        assert(c3.get_allocator() == c1.get_allocator());
[ 0:13]     71	    }
[ 0:13]     72	#endif
[ 0:13]     73	#endif  // _LIBCPP_HAS_NO_RVALUE_REFERENCES
[ 0:13]     74	}
[ 0:13] # no errors were expected but one was found anyway