[ 0:01] compiling /home/xrockai/src/divine/nightly/test/svcomp/recursion/fibo_2calls_6_true.c [ 0:01] compiling /dios/lib/config/seqklee.bc [ 0:01] setting up pass: functionmeta, options = [ 0:02] setting up pass: fuse-ctors, options = [ 0:02] KLEE: output directory is "/var/obj/divine-nightly/semidbg/test/__test_work_dir.3/_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] 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: 34072 [ 0:06] Stack: [ 0:06] #000034072 in __dios_start (l=0, argc=1, argv=94242591973384, envp=94242591991816) at /dios/libc/sys/start.cpp:87 [ 0:06] #100010091 in _ZN6__dios10sched_nullINS_5ClockINS_10NondetKleeINS_4BaseEEEEEE13run_schedulerINS_7ContextEEEvv () at /dios/sys/sched_null.hpp:163 [ 0:06] #200042337 in klee_boot (argc=1, argv=94242579146816) at /dios/arch/klee/boot.c:41 [ 0:06] [ 0:06] [ 0:06] 1 /* TAGS: c */ [ 0:06] 2 /* VERIFY_OPTS: */ [ 0:06] 3 extern int __VERIFIER_nondet_int(); [ 0:06] 4 extern void __VERIFIER_error(void); [ 0:06] 5 [ 0:06] 6 int fibo1(int n); [ 0:06] 7 int fibo2(int n); [ 0:06] 8 [ 0:06] 9 int fibo1(int n) { [ 0:06] 10 if (n < 1) { [ 0:06] 11 return 0; [ 0:06] 12 } else if (n == 1) { [ 0:06] 13 return 1; [ 0:06] 14 } else { [ 0:06] 15 return fibo2(n-1) + fibo2(n-2); [ 0:06] 16 } [ 0:06] 17 } [ 0:06] 18 [ 0:06] 19 int fibo2(int n) { [ 0:06] 20 if (n < 1) { [ 0:06] 21 return 0; [ 0:06] 22 } else if (n == 1) { [ 0:06] 23 return 1; [ 0:06] 24 } else { [ 0:06] 25 return fibo1(n-1) + fibo1(n-2); [ 0:06] 26 } [ 0:06] 27 } [ 0:06] 28 [ 0:06] 29 // fibo 1-30 [ 0:06] 30 // 1, 1, 2, 3, 5, [ 0:06] 31 // 8, 13, 21, 34, 55, [ 0:06] 32 // 89, 144, 233, 377, 610, [ 0:06] 33 // 987, 1597, 2584, 4181, 6765, [ 0:06] 34 // 10946, 17711, 28657, 46368, 75025, [ 0:06] 35 // 121393, 196418, 317811, 514229, 832040 [ 0:06] 36 [ 0:06] 37 int main(void) { [ 0:06] 38 int x = 6; [ 0:06] 39 int result = fibo1(x); [ 0:06] 40 if (result != 8) { [ 0:06] 41 ERROR: __VERIFIER_error(); [ 0:06] 42 } [ 0:06] 43 return 0; [ 0:06] 44 } [ 0:06] # no errors were expected but one was found anyway