[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/sort.pass.cpp
[ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/sort.pass.cpp:16:
[ 0:01] In file included from /dios/libcxx/include/list:183:
[ 0:01] In file included from /dios/libcxx/include/memory:652:
[ 0:01] In file included from /dios/libcxx/include/type_traits:417:
[ 0:01] In file included from /dios/libcxx/include/cstddef:44:
[ 0:01] In file included from /dios/include/stddef.h:10:
[ 0:01] In file included from /dios/include/_PDCLIB/int.h:16:
[ 0:01] /dios/include/_PDCLIB/cdefs.h:69:10: warning: Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011).
[ 0:01]         #warning Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011).
[ 0:01]          ^
[ 0:01] 1 warning generated.
[ 0:03] compiling /dios/lib/config/seqklee.bc
[ 0:03] 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.21/_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: 79892
[ 0:12] Stack: 
[ 0:12] 	#000079892 in __dios_start (l=2, argc=1, argv=93860754007048, envp=93860754076168) at /dios/libc/sys/start.cpp:87
[ 0:12] 	#100027720 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:12] 	#200088472 in klee_boot (argc=2, argv=93860724444544) at /dios/arch/klee/boot.c:41
[ 0:12] 
[ 0:12] 
[ 0:12]      1	/* TAGS: c++ fin */
[ 0:12]      2	/* CC_OPTS: -std=c++2a */
[ 0:12]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:12]      4	//===----------------------------------------------------------------------===//
[ 0:12]      5	//
[ 0:12]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:12]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:12]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:12]      9	//
[ 0:12]     10	//===----------------------------------------------------------------------===//
[ 0:12]     11	
[ 0:12]     12	// <list>
[ 0:12]     13	
[ 0:12]     14	// void sort();
[ 0:12]     15	
[ 0:12]     16	#include <list>
[ 0:12]     17	#include <random>
[ 0:12]     18	#include <vector>
[ 0:12]     19	#include <cassert>
[ 0:12]     20	
[ 0:12]     21	#include "test_macros.h"
[ 0:12]     22	#include "min_allocator.h"
[ 0:12]     23	
[ 0:12]     24	std::mt19937 randomness;
[ 0:12]     25	
[ 0:12]     26	struct Payload
[ 0:12]     27	{
[ 0:12]     28	    int val;
[ 0:12]     29	    int side;
[ 0:12]     30	    Payload(int v) : val(v), side(0) {}
[ 0:12]     31	    Payload(int v, int s) : val(v), side(s) {}
[ 0:12]     32	    bool operator< (const Payload &rhs) const { return val <  rhs.val;}
[ 0:12]     33	//     bool operator==(const Payload &rhs) const { return val == rhs.val;}
[ 0:12]     34	};
[ 0:12]     35	
[ 0:12]     36	void test_stable(int N)
[ 0:12]     37	{
[ 0:12]     38	    typedef Payload T;
[ 0:12]     39	    typedef std::list<T> C;
[ 0:12]     40	    typedef std::vector<T> V;
[ 0:12]     41	    V v;
[ 0:12]     42	    for (int i = 0; i < N; ++i)
[ 0:12]     43	        v.push_back(Payload(i/2));
[ 0:12]     44	    std::shuffle(v.begin(), v.end(), randomness);
[ 0:12]     45	    for (int i = 0; i < N; ++i)
[ 0:12]     46	        v[i].side = i;
[ 0:12]     47	
[ 0:12]     48	    C c(v.begin(), v.end());
[ 0:12]     49	    c.sort();
[ 0:12]     50	    assert(distance(c.begin(), c.end()) == N);
[ 0:12]     51	
[ 0:12]     52	//  Are we sorted?
[ 0:12]     53	    typename C::const_iterator j = c.begin();
[ 0:12]     54	    for (int i = 0; i < N; ++i, ++j)
[ 0:12]     55	        assert(j->val == i/2);
[ 0:12]     56	
[ 0:12]     57	//  Are we stable?
[ 0:12]     58	    for (C::const_iterator it = c.begin(); it != c.end(); ++it)
[ 0:12]     59	    {
[ 0:12]     60	        C::const_iterator next = std::next(it);
[ 0:12]     61	        if (next != c.end() && it->val == next->val)
[ 0:12]     62	            assert(it->side < next->side);
[ 0:12]     63	    }
[ 0:12]     64	}
[ 0:12]     65	
[ 0:12]     66	
[ 0:12]     67	int main(int, char**)
[ 0:12]     68	{
[ 0:12]     69	    {
[ 0:12]     70	    int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9};
[ 0:12]     71	    int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};
[ 0:12]     72	    std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
[ 0:12]     73	    c1.sort();
[ 0:12]     74	    assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
[ 0:12]     75	    }
[ 0:12]     76	#if TEST_STD_VER >= 11
[ 0:12]     77	    {
[ 0:12]     78	    int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9};
[ 0:12]     79	    int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};
[ 0:12]     80	    std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
[ 0:12]     81	    c1.sort();
[ 0:12]     82	    assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
[ 0:12]     83	    }
[ 0:12]     84	#endif
[ 0:12]     85	
[ 0:12]     86	    for (int i = 0; i < 40; ++i)
[ 0:12]     87	        test_stable(i);
[ 0:12]     88	
[ 0:12]     89	  return 0;
[ 0:12]     90	}
[ 0:12] # no errors were expected but one was found anyway