[ 0:00] compiling /home/xrockai/src/divine/nightly/test/svcomp/array/data_structures_set_multi_proc_trivial_true.c
[ 0:00] compiling /dios/lib/config/seqklee.bc
[ 0:00] setting up pass: functionmeta, options = 
[ 0:01] setting up pass: fuse-ctors, options = 
[ 0:01] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.12/_klee_out"
[ 0:04] KLEE: Using Z3 solver backend
[ 0:04] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:04] 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:04] 
[ 0:04] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:06] KLEE: WARNING: undefined reference to function: klee_free
[ 0:06] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:06] i:1
[ 0:06] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 0:06] about to __boot:0
[ 0:06] about to run the scheduler:0
[ 0:06] KLEE: WARNING ONCE: calling external: __dios_tainted_init() at /dios/libc/sys/start.cpp:49 5
[ 0:06] KLEE: ERROR: /dios/libc/sys/start.cpp:87: failed external call: __dios_tainted_init
[ 0:06] KLEE: NOTE: now ignoring this error at this location
[ 0:06] KLEE: ERROR: EXITING ON ERROR:
[ 0:07] Error: failed external call: __dios_tainted_init
[ 0:07] File: /dios/libc/sys/start.cpp
[ 0:07] Line: 87
[ 0:07] assembly.ll line: 34293
[ 0:07] Stack: 
[ 0:07] 	#000034293 in __dios_start (l=0, argc=1, argv=93930537800200, envp=93930537861128) at /dios/libc/sys/start.cpp:87
[ 0:07] 	#100010312 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:07] 	#200042558 in klee_boot (argc=2, argv=93930512759552) at /dios/arch/klee/boot.c:41
[ 0:07] 
[ 0:07] 
[ 0:07]      1	/* TAGS: c ext */
[ 0:07]      2	/* VERIFY_OPTS: --sequential -o nofail:malloc */
[ 0:07]      3	extern void __VERIFIER_error() __attribute__ ((__noreturn__));
[ 0:07]      4	void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: __VERIFIER_error(); } }
[ 0:07]      5	
[ 0:07]      6	#define SIZE 100000
[ 0:07]      7	
[ 0:07]      8	// implements a set and checks that the insert and remove function maintain the structure
[ 0:07]      9	
[ 0:07]     10	
[ 0:07]     11	int insert( int set [] , int size , int value ) {
[ 0:07]     12	  set[ size ] = value;
[ 0:07]     13	  return size + 1;
[ 0:07]     14	}
[ 0:07]     15	
[ 0:07]     16	int elem_exists( int set [ ] , int size , int value ) {
[ 0:07]     17	  int i;
[ 0:07]     18	  for ( i = 0 ; i < size ; i++ ) {
[ 0:07]     19	    if ( set[ i ] == value ) return 1;
[ 0:07]     20	  }
[ 0:07]     21	  return 0;
[ 0:07]     22	}
[ 0:07]     23	
[ 0:07]     24	int main( ) {
[ 0:07]     25	  int n = 0;
[ 0:07]     26	  int set[ SIZE ];
[ 0:07]     27	
[ 0:07]     28	  // this is trivial
[ 0:07]     29	  int x;
[ 0:07]     30	  int y;
[ 0:07]     31	  for ( x = 0 ; x < n ; x++ ) {
[ 0:07]     32	    for ( y = x + 1 ; y < n ; y++ ) {
[ 0:07]     33	      __VERIFIER_assert(  set[ x ] != set[ y ]  );
[ 0:07]     34	    }
[ 0:07]     35	  }
[ 0:07]     36	
[ 0:07]     37	  // we have an array of values to insert
[ 0:07]     38	  int values[ SIZE ];
[ 0:07]     39	
[ 0:07]     40	  // insert them in the array -- note that nothing ensures that values is not containing duplicates!
[ 0:07]     41	  int v;
[ 0:07]     42	  for ( v = 0 ; v < SIZE ; v++ ) {
[ 0:07]     43	    // check if the element exists, if not insert it.
[ 0:07]     44	    if ( elem_exists( set , n , values[ v ] ) ) {
[ 0:07]     45	      // parametes are passed by reference
[ 0:07]     46	      n = insert( set , n , values[ v ] );
[ 0:07]     47	    }
[ 0:07]     48	    for ( x = 0 ; x < n ; x++ ) {
[ 0:07]     49	      for ( y = x + 1 ; y < n ; y++ ) {
[ 0:07]     50	        __VERIFIER_assert(  set[ x ] != set[ y ]  );
[ 0:07]     51	      }
[ 0:07]     52	    }
[ 0:07]     53	  }
[ 0:07]     54	
[ 0:07]     55	  // this is not trivial!
[ 0:07]     56	  for ( x = 0 ; x < n ; x++ ) {
[ 0:07]     57	    for ( y = x + 1 ; y < n ; y++ ) {
[ 0:07]     58	      __VERIFIER_assert(  set[ x ] != set[ y ]  );
[ 0:07]     59	    }
[ 0:07]     60	  }
[ 0:07]     61	  return 0;
[ 0:07]     62	}
[ 0:07]     63	
[ 0:07] # no errors were expected but one was found anyway