/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be disproven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 177 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 398 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms]
(6) LLVM Symbolic Execution Lasso
(7) Lasso2IRS [EQUIVALENT, 79 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [COMPLETE, 998 ms]
(12) NO


----------------------------------------

(0)
Obligation:
c file /export/starexec/sandbox2/benchmark/theBenchmark.c
----------------------------------------

(1) CToLLVMProof (EQUIVALENT)
Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM.
----------------------------------------

(2)
Obligation:
LLVM Problem

Aliases:

Data layout:

"e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"

Machine:

"x86_64-pc-linux-gnu"

Type definitions:

Global variables:

Function declarations and definitions:

*BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%x = alloca i32, align 4
		store 0, %1
		%2 = call i32 (...)* @__VERIFIER_nondet_int()
		store %2, %x
		br %3
	3:
		%4 = load %x
		%5 = icmp sge %4 0
		br %5, %6, %10
	6:
		%7 = call i32 (...)* @__VERIFIER_nondet_int()
		%8 = load %x
		%9 = add %8 %7
		store %9, %x
		br %3
	10:
		ret 0


Analyze Termination of all function calls matching the pattern:
main()
----------------------------------------

(3) LLVMToTerminationGraphProof (EQUIVALENT)
Constructed symbolic execution graph for LLVM program and proved memory safety.
----------------------------------------

(4)
Obligation:
SE Graph
----------------------------------------

(5) SymbolicExecutionGraphToLassoProof (EQUIVALENT)
Converted SEGraph to 1 independent lasso.
----------------------------------------

(6)
Obligation:
Lasso
----------------------------------------

(7) Lasso2IRS (EQUIVALENT)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 26 rulesP rules:
f_80(v13, v14, v15, v19, 1, v18, v16, v20, v21, 0, 3, 4) -> f_81(v13, v14, v15, v19, 1, v18, v16, v20, v21, 0, 3, 4) :|: 0 <= v19
f_81(v13, v14, v15, v19, 1, v18, v16, v20, v21, 0, 3, 4) -> f_83(v13, v14, v15, v19, 1, v18, v16, v20, v21, 0, 3, 4) :|: 0 = 0
f_83(v13, v14, v15, v19, 1, v18, v16, v20, v21, 0, 3, 4) -> f_85(v13, v14, v15, v19, 1, v18, v16, v20, v21, 0, 3, 4) :|: TRUE
f_85(v13, v14, v15, v19, 1, v18, v16, v20, v21, 0, 3, 4) -> f_87(v13, v14, v15, v19, 1, v23, v16, v20, v21, 0, 3, 4) :|: TRUE
f_87(v13, v14, v15, v19, 1, v23, v16, v20, v21, 0, 3, 4) -> f_88(v13, v14, v15, v19, 1, v23, v20, v21, 0, 3, 4) :|: 0 = 0
f_88(v13, v14, v15, v19, 1, v23, v20, v21, 0, 3, 4) -> f_89(v13, v14, v15, v19, 1, v23, v24, v20, v21, 0, 3, 4) :|: v24 = v19 + v23
f_89(v13, v14, v15, v19, 1, v23, v24, v20, v21, 0, 3, 4) -> f_90(v13, v14, v15, v19, 1, v23, v24, v20, v21, 0, 3, 4) :|: TRUE
f_90(v13, v14, v15, v19, 1, v23, v24, v20, v21, 0, 3, 4) -> f_91(v13, v14, v15, v19, 1, v23, v24, v20, v21, 0, 3, 4) :|: TRUE
f_91(v13, v14, v15, v19, 1, v23, v24, v20, v21, 0, 3, 4) -> f_79(v13, v14, v15, v19, 1, v23, v24, v20, v21, 0, 3, 4) :|: TRUE
f_79(v13, v14, v15, v16, 1, v18, v19, v20, v21, 0, 3, 4) -> f_80(v13, v14, v15, v19, 1, v18, v16, v20, v21, 0, 3, 4) :|: 0 = 0
f_48 -> f_49(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2
f_49(v1, v2, 3, 1, 4) -> f_50(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4
f_50(v1, v3, v2, v4, 3, 1, 4) -> f_51(v1, v3, v2, v4, 0, 3, 1, 4) :|: TRUE
f_51(v1, v3, v2, v4, 0, 3, 1, 4) -> f_52(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: TRUE
f_52(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_53(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: TRUE
f_53(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_54(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: TRUE
f_54(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_55(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: 0 = 0
f_55(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_56(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: 0 <= v5
f_56(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_58(v1, v3, v5, 1, v2, v4, 0, 3, 4) :|: 0 = 0
f_58(v1, v3, v5, 1, v2, v4, 0, 3, 4) -> f_60(v1, v3, v5, 1, v2, v4, 0, 3, 4) :|: TRUE
f_60(v1, v3, v5, 1, v2, v4, 0, 3, 4) -> f_62(v1, v3, v5, 1, v7, v2, v4, 0, 3, 4) :|: TRUE
f_62(v1, v3, v5, 1, v7, v2, v4, 0, 3, 4) -> f_63(v1, v3, v5, 1, v7, v2, v4, 0, 3, 4) :|: 0 = 0
f_63(v1, v3, v5, 1, v7, v2, v4, 0, 3, 4) -> f_64(v1, v3, v5, 1, v7, v8, v2, v4, 0, 3, 4) :|: v8 = v5 + v7
f_64(v1, v3, v5, 1, v7, v8, v2, v4, 0, 3, 4) -> f_65(v1, v3, v5, 1, v7, v8, v2, v4, 0, 3, 4) :|: TRUE
f_65(v1, v3, v5, 1, v7, v8, v2, v4, 0, 3, 4) -> f_66(v1, v3, v5, 1, v7, v8, v2, v4, 0, 3, 4) :|: TRUE
f_66(v1, v3, v5, 1, v7, v8, v2, v4, 0, 3, 4) -> f_79(v1, v3, v5, v5, 1, v7, v8, v2, v4, 0, 3, 4) :|: TRUE
Combined rules. Obtained 2 rulesP rules:
f_80(v13:0, v14:0, v15:0, v19:0, 1, v18:0, v16:0, v20:0, v21:0, 0, 3, 4) -> f_80(v13:0, v14:0, v15:0, v19:0 + v23:0, 1, v23:0, v19:0, v20:0, v21:0, 0, 3, 4) :|: v19:0 > -1
f_48 -> f_80(v1:0, v3:0, v5:0, v5:0 + v7:0, 1, v7:0, v5:0, 3 + v1:0, 3 + v3:0, 0, 3, 4) :|: v3:0 > 0 && v1:0 > 0 && v5:0 > -1
Filtered unneeded arguments:
   f_80(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12) -> f_80(x4)
Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules:
f_80(v19:0) -> f_80(v19:0 + v23:0) :|: v19:0 > -1
f_48 -> f_80(v5:0 + v7:0) :|: v5:0 > -1

----------------------------------------

(8)
Obligation:
Rules:
f_80(v19:0) -> f_80(v19:0 + v23:0) :|: v19:0 > -1
f_48 -> f_80(v5:0 + v7:0) :|: v5:0 > -1
Start term: f_48

----------------------------------------

(9) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f_80_1,1)
   (f_48_1,2)

----------------------------------------

(10)
Obligation:
START: 2;

FROM: 1;
oldX0 := x0;
oldX1 := nondet();
assume(oldX0 > -1);
x0 := oldX0 + oldX1;
TO: 1;

FROM: 2;
oldX0 := x0;
oldX1 := nondet();
oldX2 := nondet();
assume(oldX1 > -1);
x0 := oldX1 + oldX2;
TO: 1;


----------------------------------------

(11) T2 (COMPLETE)
Found this recurrent set for cutpoint 5: oldX1 == 0 and oldX2 == 0 and x0 == 0

----------------------------------------

(12)
NO