[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/deque/erase_iter.pass.cpp
[ 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.0/_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: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: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: 96636
[ 0:13] Stack: 
[ 0:13] 	#000096636 in __dios_start (l=0, argc=1, argv=94485727756296, envp=94485727774728) at /dios/libc/sys/start.cpp:87
[ 0:13] 	#100044465 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:13] 	#200105216 in klee_boot (argc=2, argv=94485693828480) 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	// iterator erase(const_iterator p)
[ 0:13]     15	
[ 0:13]     16	#include <deque>
[ 0:13]     17	#include <cassert>
[ 0:13]     18	
[ 0:13]     19	#include "min_allocator.h"
[ 0:13]     20	
[ 0:13]     21	template <class C>
[ 0:13]     22	C
[ 0:13]     23	make(int size, int start = 0 )
[ 0:13]     24	{
[ 0:13]     25	    const int b = 4096 / sizeof(int);
[ 0:13]     26	    int init = 0;
[ 0:13]     27	    if (start > 0)
[ 0:13]     28	    {
[ 0:13]     29	        init = (start+1) / b + ((start+1) % b != 0);
[ 0:13]     30	        init *= b;
[ 0:13]     31	        --init;
[ 0:13]     32	    }
[ 0:13]     33	    C c(init, 0);
[ 0:13]     34	    for (int i = 0; i < init-start; ++i)
[ 0:13]     35	        c.pop_back();
[ 0:13]     36	    for (int i = 0; i < size; ++i)
[ 0:13]     37	        c.push_back(i);
[ 0:13]     38	    for (int i = 0; i < start; ++i)
[ 0:13]     39	        c.pop_front();
[ 0:13]     40	    return c;
[ 0:13]     41	}
[ 0:13]     42	
[ 0:13]     43	template <class C>
[ 0:13]     44	void
[ 0:13]     45	test(int P, C& c1)
[ 0:13]     46	{
[ 0:13]     47	    typedef typename C::iterator I;
[ 0:13]     48	    assert(P < c1.size());
[ 0:13]     49	    std::size_t c1_osize = c1.size();
[ 0:13]     50	    I i = c1.erase(c1.cbegin() + P);
[ 0:13]     51	    assert(i == c1.begin() + P);
[ 0:13]     52	    assert(c1.size() == c1_osize - 1);
[ 0:13]     53	    assert(distance(c1.begin(), c1.end()) == c1.size());
[ 0:13]     54	    i = c1.begin();
[ 0:13]     55	    int j = 0;
[ 0:13]     56	    for (; j < P; ++j, ++i)
[ 0:13]     57	        assert(*i == j);
[ 0:13]     58	    for (++j; j < c1_osize; ++j, ++i)
[ 0:13]     59	        assert(*i == j);
[ 0:13]     60	}
[ 0:13]     61	
[ 0:13]     62	template <class C>
[ 0:13]     63	void
[ 0:13]     64	testN(int start, int N)
[ 0:13]     65	{
[ 0:13]     66	    int pstep = std::max(N / std::max(std::min(N, 10), 1), 1);
[ 0:13]     67	    for (int p = 0; p < N; p += pstep)
[ 0:13]     68	    {
[ 0:13]     69	        C c1 = make<C>(N, start);
[ 0:13]     70	        test(p, c1);
[ 0:13]     71	    }
[ 0:13]     72	}
[ 0:13]     73	
[ 0:13]     74	int main()
[ 0:13]     75	{
[ 0:13]     76	    {
[ 0:13]     77	    int rng[] = {0, 1, 2, 3};
[ 0:13]     78	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:13]     79	    for (int i = 0; i < N; ++i)
[ 0:13]     80	        for (int j = 0; j < N; ++j)
[ 0:13]     81	            testN<std::deque<int> >(rng[i], rng[j]);
[ 0:13]     82	    }
[ 0:13]     83	#if __cplusplus >= 201103L
[ 0:13]     84	    {
[ 0:13]     85	    int rng[] = {0, 1, 2, 3};
[ 0:13]     86	    const int N = sizeof(rng)/sizeof(rng[0]);
[ 0:13]     87	    for (int i = 0; i < N; ++i)
[ 0:13]     88	        for (int j = 0; j < N; ++j)
[ 0:13]     89	            testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
[ 0:13]     90	    }
[ 0:13]     91	#endif
[ 0:13]     92	}
[ 0:13] # no errors were expected but one was found anyway