[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/deque/pop_front.pass.cpp
[ 0:01] compiling /dios/lib/config/seqklee.bc
[ 0:02] 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.10/_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:12] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:12] KLEE: WARNING: undefined reference to function: klee_free
[ 0:12] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:12] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:12] i:1
[ 0:12] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:12] about to __boot:0
[ 0:12] about to run the scheduler:0
[ 0:12] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:12] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:12] KLEE: NOTE: now ignoring this error at this location
[ 0:12] 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: 89243
[ 0:12] Stack: 
[ 0:12] 	#000089243 in __dios_start (l=0, argc=1, argv=94826896162824, envp=94826896181256) at /dios/libc/sys/start.cpp:87
[ 0:12] 	#100037072 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:12] 	#200097823 in klee_boot (argc=2, argv=94826864307584) at /dios/arch/klee/boot.c:41
[ 0:12] 
[ 0:12] 
[ 0:12]      1	/* TAGS: c++ */
[ 0:12]      2	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:12]      3	//===----------------------------------------------------------------------===//
[ 0:12]      4	//
[ 0:12]      5	//                     The LLVM Compiler Infrastructure
[ 0:12]      6	//
[ 0:12]      7	// This file is dual licensed under the MIT and the University of Illinois Open
[ 0:12]      8	// Source Licenses. See LICENSE.TXT for details.
[ 0:12]      9	//
[ 0:12]     10	//===----------------------------------------------------------------------===//
[ 0:12]     11	
[ 0:12]     12	// <deque>
[ 0:12]     13	
[ 0:12]     14	// void pop_front()
[ 0:12]     15	
[ 0:12]     16	#include <deque>
[ 0:12]     17	#include <cassert>
[ 0:12]     18	
[ 0:12]     19	#include "min_allocator.h"
[ 0:12]     20	
[ 0:12]     21	template <class C>
[ 0:12]     22	C
[ 0:12]     23	make(int size, int start = 0 )
[ 0:12]     24	{
[ 0:12]     25	    const int b = 4096 / sizeof(int);
[ 0:12]     26	    int init = 0;
[ 0:12]     27	    if (start > 0)
[ 0:12]     28	    {
[ 0:12]     29	        init = (start+1) / b + ((start+1) % b != 0);
[ 0:12]     30	        init *= b;
[ 0:12]     31	        --init;
[ 0:12]     32	    }
[ 0:12]     33	    C c(init, 0);
[ 0:12]     34	    for (int i = 0; i < init-start; ++i)
[ 0:12]     35	        c.pop_back();
[ 0:12]     36	    for (int i = 0; i < size; ++i)
[ 0:12]     37	        c.push_back(i);
[ 0:12]     38	    for (int i = 0; i < start; ++i)
[ 0:12]     39	        c.pop_front();
[ 0:12]     40	    return c;
[ 0:12]     41	}
[ 0:12]     42	
[ 0:12]     43	template <class C>
[ 0:12]     44	void
[ 0:12]     45	test(C& c1)
[ 0:12]     46	{
[ 0:12]     47	    typedef typename C::iterator I;
[ 0:12]     48	    std::size_t c1_osize = c1.size();
[ 0:12]     49	    c1.pop_front();
[ 0:12]     50	    assert(c1.size() == c1_osize - 1);
[ 0:12]     51	    assert(distance(c1.begin(), c1.end()) == c1.size());
[ 0:12]     52	    I i = c1.begin();
[ 0:12]     53	    for (int j = 1; j < c1.size(); ++j, ++i)
[ 0:12]     54	        assert(*i == j);
[ 0:12]     55	}
[ 0:12]     56	
[ 0:12]     57	template <class C>
[ 0:12]     58	void
[ 0:12]     59	testN(int start, int N)
[ 0:12]     60	{
[ 0:12]     61	    if (N != 0)
[ 0:12]     62	    {
[ 0:12]     63	        C c1 = make<C>(N, start);
[ 0:12]     64	        test(c1);
[ 0:12]     65	    }
[ 0:12]     66	}
[ 0:12]     67	
[ 0:12]     68	int main()
[ 0:12]     69	{
[ 0:12]     70	    {
[ 0:12]     71	    int rng[] = {0, 1, 2, 3};
[ 0:12]     72	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:12]     73	    for (int i = 0; i < N; ++i)
[ 0:12]     74	        for (int j = 0; j < N; ++j)
[ 0:12]     75	            testN<std::deque<int> >(rng[i], rng[j]);
[ 0:12]     76	    }
[ 0:12]     77	#if __cplusplus >= 201103L
[ 0:12]     78	    {
[ 0:12]     79	    int rng[] = {0, 1, 2, 3};
[ 0:12]     80	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:12]     81	    for (int i = 0; i < N; ++i)
[ 0:12]     82	        for (int j = 0; j < N; ++j)
[ 0:12]     83	            testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
[ 0:12]     84	    }
[ 0:12]     85	#endif
[ 0:12]     86	}
[ 0:12] # no errors were expected but one was found anyway