[ 0:00] compiling /home/xrockai/src/divine/nightly/test/libcxx/containers/remove_if.pass.cpp
[ 0:00] In file included from /home/xrockai/src/divine/nightly/test/libcxx/containers/remove_if.pass.cpp:17:
[ 0:00] In file included from /dios/libcxx/include/list:183:
[ 0:00] In file included from /dios/libcxx/include/memory:652:
[ 0:00] In file included from /dios/libcxx/include/type_traits:417:
[ 0:00] In file included from /dios/libcxx/include/cstddef:44:
[ 0:00] In file included from /dios/include/stddef.h:10:
[ 0:00] In file included from /dios/include/_PDCLIB/int.h:16:
[ 0:00] /dios/include/_PDCLIB/cdefs.h:69:10: warning: Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011).
[ 0:00]         #warning Unsupported _ _cplusplus (__cplusplus) (too new) (supported: ISO/IEC 14882:1997, ISO/IEC 14882:2011).
[ 0:00]          ^
[ 0:00] 1 warning generated.
[ 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.6/_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:06] 
[ 0:06] KLEE: WARNING: undefined reference to function: _Z10klee_abortv
[ 0:11] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:11] KLEE: WARNING: undefined reference to function: klee_free
[ 0:11] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:11] KLEE: WARNING ONCE: Using zero size array fix for landingpad instruction filter
[ 0:11] i:1
[ 0:11] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:11] about to __boot:0
[ 0:11] about to run the scheduler:0
[ 0:11] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:11] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:11] KLEE: NOTE: now ignoring this error at this location
[ 0:11] KLEE: ERROR: EXITING ON ERROR:
[ 0:11] Error: failed external call: __dios_tainted_init
[ 0:11] File: /dios/libc/sys/start.cpp
[ 0:11] Line: 87
[ 0:11] assembly.ll line: 75020
[ 0:11] Stack: 
[ 0:11] 	#000075020 in __dios_start (l=2, argc=1, argv=94841210958344, envp=94841211027464) at /dios/libc/sys/start.cpp:87
[ 0:11] 	#100022849 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:11] 	#200083600 in klee_boot (argc=2, argv=94841182678400) at /dios/arch/klee/boot.c:41
[ 0:11] 
[ 0:11] 
[ 0:11]      1	/* TAGS: c++ fin */
[ 0:11]      2	/* CC_OPTS: -std=c++2a */
[ 0:11]      3	/* VERIFY_OPTS: -o nofail:malloc */
[ 0:11]      4	//===----------------------------------------------------------------------===//
[ 0:11]      5	//
[ 0:11]      6	// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
[ 0:11]      7	// See https://llvm.org/LICENSE.txt for license information.
[ 0:11]      8	// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
[ 0:11]      9	//
[ 0:11]     10	//===----------------------------------------------------------------------===//
[ 0:11]     11	
[ 0:11]     12	// <list>
[ 0:11]     13	
[ 0:11]     14	// template <class Pred> void      remove_if(Pred pred); // before C++20
[ 0:11]     15	// template <class Pred> size_type remove_if(Pred pred); // c++20 and later
[ 0:11]     16	
[ 0:11]     17	#include <list>
[ 0:11]     18	#include <cassert>
[ 0:11]     19	#include <functional>
[ 0:11]     20	
[ 0:11]     21	#include "test_macros.h"
[ 0:11]     22	#include "min_allocator.h"
[ 0:11]     23	#include "counting_predicates.hpp"
[ 0:11]     24	
[ 0:11]     25	bool even(int i)
[ 0:11]     26	{
[ 0:11]     27	    return i % 2 == 0;
[ 0:11]     28	}
[ 0:11]     29	
[ 0:11]     30	bool g(int i)
[ 0:11]     31	{
[ 0:11]     32	    return i < 3;
[ 0:11]     33	}
[ 0:11]     34	
[ 0:11]     35	struct PredLWG526 {
[ 0:11]     36	    PredLWG526 (int i) : i_(i) {};
[ 0:11]     37	    ~PredLWG526() { i_ = -32767; }
[ 0:11]     38	    bool operator() (const PredLWG526 &p) const { return p.i_ == i_; }
[ 0:11]     39	
[ 0:11]     40	    bool operator==(int i) const { return i == i_;}
[ 0:11]     41	    int i_;
[ 0:11]     42	};
[ 0:11]     43	
[ 0:11]     44	typedef unary_counting_predicate<bool(*)(int), int> Predicate;
[ 0:11]     45	
[ 0:11]     46	int main(int, char**)
[ 0:11]     47	{
[ 0:11]     48	    {
[ 0:11]     49	    int a1[] = {1, 2, 3, 4};
[ 0:11]     50	    int a2[] = {3, 4};
[ 0:11]     51	    typedef std::list<int> L;
[ 0:11]     52	    L c(a1, a1+4);
[ 0:11]     53	    Predicate cp(g);
[ 0:11]     54	#if TEST_STD_VER > 17
[ 0:11]     55		ASSERT_SAME_TYPE(L::size_type, decltype(c.remove_if(std::ref(cp))));
[ 0:11]     56	    assert(c.remove_if(std::ref(cp)) == 2);
[ 0:11]     57	#else
[ 0:11]     58		ASSERT_SAME_TYPE(void, decltype(c.remove_if(std::ref(cp))));
[ 0:11]     59	    c.remove_if(std::ref(cp));
[ 0:11]     60	#endif
[ 0:11]     61	    assert(c == std::list<int>(a2, a2+2));
[ 0:11]     62	    assert(cp.count() == 4);
[ 0:11]     63	    }
[ 0:11]     64	    {
[ 0:11]     65	    int a1[] = {1, 2, 3, 4};
[ 0:11]     66	    int a2[] = {1, 3};
[ 0:11]     67	    std::list<int> c(a1, a1+4);
[ 0:11]     68	    Predicate cp(even);
[ 0:11]     69	#if TEST_STD_VER > 17
[ 0:11]     70	    assert(c.remove_if(std::ref(cp)) == 2);
[ 0:11]     71	#else
[ 0:11]     72	    c.remove_if(std::ref(cp));
[ 0:11]     73	#endif
[ 0:11]     74	    assert(c == std::list<int>(a2, a2+2));
[ 0:11]     75	    assert(cp.count() == 4);
[ 0:11]     76	    }
[ 0:11]     77	    { // LWG issue #526
[ 0:11]     78	    int a1[] = {1, 2, 1, 3, 5, 8, 11};
[ 0:11]     79	    int a2[] = {2, 3, 5, 8, 11};
[ 0:11]     80	    std::list<PredLWG526> c(a1, a1 + 7);
[ 0:11]     81	    c.remove_if(std::ref(c.front()));
[ 0:11]     82	    assert(c.size() == 5);
[ 0:11]     83	    for (size_t i = 0; i < c.size(); ++i)
[ 0:11]     84	    {
[ 0:11]     85	        assert(c.front() == a2[i]);
[ 0:11]     86	        c.pop_front();
[ 0:11]     87	    }
[ 0:11]     88	    }
[ 0:11]     89	
[ 0:11]     90	#if TEST_STD_VER >= 11
[ 0:11]     91	    {
[ 0:11]     92	    int a1[] = {1, 2, 3, 4};
[ 0:11]     93	    int a2[] = {3, 4};
[ 0:11]     94	    std::list<int, min_allocator<int>> c(a1, a1+4);
[ 0:11]     95	    Predicate cp(g);
[ 0:11]     96	#if TEST_STD_VER > 17
[ 0:11]     97	    assert(c.remove_if(std::ref(cp)) == 2);
[ 0:11]     98	#else
[ 0:11]     99	    c.remove_if(std::ref(cp));
[ 0:11]    100	#endif
[ 0:11]    101	    assert((c == std::list<int, min_allocator<int>>(a2, a2+2)));
[ 0:11]    102	    assert(cp.count() == 4);
[ 0:11]    103	    }
[ 0:11]    104	#endif
[ 0:11]    105	
[ 0:11]    106	  return 0;
[ 0:11]    107	}
[ 0:11] # no errors were expected but one was found anyway