[ 0:00] compiling /home/xrockai/src/divine/nightly/test/svcomp/recursion/Fibonacci04_false.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.11/_klee_out"
[ 0:03] KLEE: Using Z3 solver backend
[ 0:03] WARNING: this target does not support the llvm.stacksave intrinsic.
[ 0:03] 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:03] 
[ 0:03] KLEE: WARNING: undefined reference to function: __dios_tainted_init
[ 0:05] KLEE: WARNING: undefined reference to function: klee_free
[ 0:05] KLEE: WARNING: undefined reference to function: klee_malloc
[ 0:05] about to __boot:0
[ 0:06] KLEE: WARNING ONCE: Alignment of memory from call "klee_malloc" is not modelled. Using alignment of 8.
[ 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:06] Error: failed external call: __dios_tainted_init
[ 0:06] File: /dios/libc/sys/start.cpp
[ 0:06] Line: 87
[ 0:06] assembly.ll line: 34060
[ 0:06] Stack: 
[ 0:06] 	#000034060 in __dios_start (l=0, argc=1, argv=94533576900616, envp=94533576919048) at /dios/libc/sys/start.cpp:87
[ 0:06] 	#100010079 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163
[ 0:06] 	#200042410 in klee_boot (argc=1, argv=94533564033088) at /dios/arch/klee/boot.c:41
[ 0:06] 
[ 0:06] 
[ 0:06]      1	/* VERIFY_OPTS: --symbolic --sequential */
[ 0:06]      2	/* TAGS: error sym c */
[ 0:06]      3	extern void __VERIFIER_error() __attribute__ ((__noreturn__));
[ 0:06]      4	
[ 0:06]      5	/*
[ 0:06]      6	 * Recursive computation of fibonacci numbers.
[ 0:06]      7	 * 
[ 0:06]      8	 * Author: Matthias Heizmann
[ 0:06]      9	 * Date: 2013-07-13
[ 0:06]     10	 * 
[ 0:06]     11	 */
[ 0:06]     12	
[ 0:06]     13	extern int __VERIFIER_nondet_int(void);
[ 0:06]     14	int fibonacci(int n);
[ 0:06]     15	int main();
[ 0:06]     16	
[ 0:06]     17	
[ 0:06]     18	int fibonacci(int n) {
[ 0:06]     19	    if (n < 1) {
[ 0:06]     20	        return 0;
[ 0:06]     21	    } else if (n == 1) {
[ 0:06]     22	        return 1;
[ 0:06]     23	    } else {
[ 0:06]     24	        return fibonacci(n-1) + fibonacci(n-2);
[ 0:06]     25	    }
[ 0:06]     26	}
[ 0:06]     27	
[ 0:06]     28	
[ 0:06]     29	int main() {
[ 0:06]     30	    int x = __VERIFIER_nondet_int();
[ 0:06]     31	    int result = fibonacci(x);
[ 0:06]     32	    if (x != 5 || result == 3) {
[ 0:06]     33	        return 0;
[ 0:06]     34	    } else {
[ 0:06]     35	        ERROR: __VERIFIER_error(); /* ERROR */
[ 0:06]     36	    }
[ 0:06]     37	}
[ 0:06]     38	    
[ 0:06]     39	
[ 0:06] # expected error to be found at /home/xrockai/src/divine/nightly/test/svcomp/recursion/Fibonacci04_false.c:35, but it was not