[ 0:01] compiling /home/xrockai/src/divine/nightly/test/libcxx/algorithms/sort_heap_comp.pass.cpp
[ 0:01] In file included from /home/xrockai/src/divine/nightly/test/libcxx/algorithms/sort_heap_comp.pass.cpp:19:
[ 0:01] In file included from /dios/libcxx/include/algorithm:639:
[ 0:01] In file included from /dios/libcxx/include/initializer_list:46:
[ 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:02] 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.13/_klee_out"
[ 0:09] KLEE: Using Z3 solver backend
[ 0:09] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:09] 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:09] 
[ 0:09] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:15] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:15] KLEE: WARNING: undefined reference to function: klee_free
[ 0:15] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:15] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:15] i:1
[ 0:15] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:15] about to __boot:0
[ 0:15] about to run the scheduler:0
[ 0:15] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:15] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:15] KLEE: NOTE: now ignoring this error at this location
[ 0:15] KLEE: ERROR: EXITING ON ERROR:
[ 0:16] Error: failed external call: __dios_tainted_init
[ 0:16] File: /dios/libc/sys/start.cpp
[ 0:16] Line: 87
[ 0:16] assembly.ll line: 67437
[ 0:16] Stack: 
[ 0:16] 	#000067437 in __dios_start (l=2, argc=1, argv=94113132491272, envp=94113132560392) at /dios/libc/sys/start.cpp:87
[ 0:16] 	#100015438 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:16] 	#200076017 in klee_boot (argc=2, argv=94113105997184) at /dios/arch/klee/boot.c:41
[ 0:16] 
[ 0:16] 
[ 0:16]      1	/* TAGS: c++ fin */
[ 0:16]      2	/* CC_OPTS: -std=c++2a */
[ 0:16]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:16]      4	//===----------------------------------------------------------------------===//
[ 0:16]      5	//
[ 0:16]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:16]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:16]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:16]      9	//
[ 0:16]     10	//===----------------------------------------------------------------------===//
[ 0:16]     11	
[ 0:16]     12	// <algorithm>
[ 0:16]     13	
[ 0:16]     14	// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
[ 0:16]     15	//   requires ShuffleIterator<Iter> && CopyConstructible<Compare>
[ 0:16]     16	//   void
[ 0:16]     17	//   sort_heap(Iter first, Iter last, Compare comp);
[ 0:16]     18	
[ 0:16]     19	#include <algorithm>
[ 0:16]     20	#include <functional>
[ 0:16]     21	#include <random>
[ 0:16]     22	#include <cassert>
[ 0:16]     23	#include <memory>
[ 0:16]     24	
[ 0:16]     25	#include "test_macros.h"
[ 0:16]     26	
[ 0:16]     27	struct indirect_less
[ 0:16]     28	{
[ 0:16]     29	    template <class P>
[ 0:16]     30	    bool operator()(const P& x, const P& y)
[ 0:16]     31	        {return *x < *y;}
[ 0:16]     32	};
[ 0:16]     33	
[ 0:16]     34	std::mt19937 randomness;
[ 0:16]     35	
[ 0:16]     36	void test(int N)
[ 0:16]     37	{
[ 0:16]     38	    int* ia = new int [N];
[ 0:16]     39	    for (int i = 0; i < N; ++i)
[ 0:16]     40	        ia[i] = i;
[ 0:16]     41	    std::shuffle(ia, ia+N, randomness);
[ 0:16]     42	    std::make_heap(ia, ia+N, std::greater<int>());
[ 0:16]     43	    std::sort_heap(ia, ia+N, std::greater<int>());
[ 0:16]     44	    assert(std::is_sorted(ia, ia+N, std::greater<int>()));
[ 0:16]     45	    delete [] ia;
[ 0:16]     46	}
[ 0:16]     47	
[ 0:16]     48	int main(int, char**)
[ 0:16]     49	{
[ 0:16]     50	    test(0);
[ 0:16]     51	    test(1);
[ 0:16]     52	    test(2);
[ 0:16]     53	    test(3);
[ 0:16]     54	    test(10);
[ 0:16]     55	    test(1000);
[ 0:16]     56	
[ 0:16]     57	#if TEST_STD_VER >= 11
[ 0:16]     58	    {
[ 0:16]     59	    const int N = 1000;
[ 0:16]     60	    std::unique_ptr<int>* ia = new std::unique_ptr<int> [N];
[ 0:16]     61	    for (int i = 0; i < N; ++i)
[ 0:16]     62	        ia[i].reset(new int(i));
[ 0:16]     63	    std::shuffle(ia, ia+N, randomness);
[ 0:16]     64	    std::make_heap(ia, ia+N, indirect_less());
[ 0:16]     65	    std::sort_heap(ia, ia+N, indirect_less());
[ 0:16]     66	    assert(std::is_sorted(ia, ia+N, indirect_less()));
[ 0:16]     67	    delete [] ia;
[ 0:16]     68	    }
[ 0:16]     69	#endif
[ 0:16]     70	
[ 0:16]     71	  return 0;
[ 0:16]     72	}
[ 0:16] # no errors were expected but one was found anyway