/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be disproven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 134 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 850 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms]
(6) LLVM Symbolic Execution Lasso
(7) Lasso2IRS [EQUIVALENT, 21 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 Underapproximation [COMPLETE, 1813 ms]
(12) T2IntSys
(13) T2 [COMPLETE, 1343 ms]
(14) 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
		%y = alloca i32, align 4
		store 0, %1
		%2 = call i32 (...)* @__VERIFIER_nondet_int()
		store %2, %x
		%3 = call i32 (...)* @__VERIFIER_nondet_int()
		store %3, %y
		br %4
	4:
		%5 = load %x
		%6 = icmp slt %5 0
		br %6, %7, %13
	7:
		%8 = load %x
		%9 = load %y
		%10 = add %8 %9
		store %10, %x
		%11 = load %y
		%12 = add %11 -1
		store %12, %y
		br %4
	13:
		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 36 rulesP rules:
f_123(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) -> f_124(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) :|: v45 < 0
f_124(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) -> f_126(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_126(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) -> f_128(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) :|: TRUE
f_128(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) -> f_130(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_130(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 4) -> f_131(v37, v38, v39, v40, v41, v45, 1, v46, v44, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_131(v37, v38, v39, v40, v41, v45, 1, v46, v44, v47, v48, v49, 0, 3, 4) -> f_132(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 4) :|: v51 = v45 + v46
f_132(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 4) -> f_133(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 4) :|: TRUE
f_133(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 4) -> f_134(v37, v38, v39, v40, v41, v45, 1, v46, v51, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_134(v37, v38, v39, v40, v41, v45, 1, v46, v51, v47, v48, v49, 0, 3, 4) -> f_135(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) :|: 1 + v53 = v46
f_135(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) -> f_136(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) :|: TRUE
f_136(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) -> f_137(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) :|: TRUE
f_137(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) -> f_122(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) :|: TRUE
f_122(v37, v38, v39, v40, v41, v42, 1, v44, v45, v46, v47, v48, v49, 0, 3, 4) -> f_123(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_66 -> f_67(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2
f_67(v1, v2, 3, 1, 4) -> f_68(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4
f_68(v1, v3, v2, v4, 3, 1, 4) -> f_69(v1, v3, v5, v2, v4, v6, 3, 1, 4) :|: 1 <= v5 && v6 = 3 + v5 && 4 <= v6
f_69(v1, v3, v5, v2, v4, v6, 3, 1, 4) -> f_70(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_70(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) -> f_71(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_71(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_72(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_72(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_73(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_73(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_74(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_74(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_75(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_75(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_76(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: 0 = 0
f_76(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_77(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: v7 < 0
f_77(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_79(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0
f_79(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_81(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: TRUE
f_81(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_83(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0
f_83(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_84(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0
f_84(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_85(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: v11 = v7 + v9
f_85(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_86(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: TRUE
f_86(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_87(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: 0 = 0
f_87(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_88(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4) :|: 1 + v13 = v9
f_88(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4) -> f_89(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4) :|: TRUE
f_89(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4) -> f_90(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4) :|: TRUE
f_90(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4) -> f_106(v1, v3, v5, v7, v9, v7, 1, v9, v11, v13, v2, v4, v6, 0, 3, 4) :|: TRUE
f_106(v19, v20, v21, v22, v23, v24, 1, v26, v27, v28, v29, v30, v31, 0, 3, 4) -> f_122(v19, v20, v21, v22, v23, v24, 1, v26, v27, v28, v29, v30, v31, 0, 3, 4) :|: TRUE
Combined rules. Obtained 2 rulesP rules:
f_123(v37:0, v38:0, v39:0, v40:0, v41:0, v45:0, 1, v42:0, v44:0, 1 + v53:0, v47:0, v48:0, v49:0, 0, 3, 4) -> f_123(v37:0, v38:0, v39:0, v40:0, v41:0, v45:0 + (1 + v53:0), 1, v45:0, 1 + v53:0, v53:0, v47:0, v48:0, v49:0, 0, 3, 4) :|: v45:0 < 0
f_66 -> f_123(v1:0, v3:0, v5:0, v7:0, 1 + v13:0, v7:0 + (1 + v13:0), 1, v7:0, 1 + v13:0, v13:0, 3 + v1:0, 3 + v3:0, 3 + v5:0, 0, 3, 4) :|: v3:0 > 0 && v1:0 > 0 && v5:0 > 0 && v7:0 < 0
Filtered unneeded arguments:
   f_123(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_123(x6, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules:
f_123(v45:0, sum~cons_1~v53:0) -> f_123(v45:0 + (1 + v53:0), v53:0) :|: v45:0 < 0 && sum~cons_1~v53:0 = 1 + v53:0
f_66 -> f_123(v7:0 + (1 + v13:0), v13:0) :|: v7:0 < 0

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

(8)
Obligation:
Rules:
f_123(v45:0, sum~cons_1~v53:0) -> f_123(v45:0 + (1 + v53:0), v53:0) :|: v45:0 < 0 && sum~cons_1~v53:0 = 1 + v53:0
f_66 -> f_123(v7:0 + (1 + v13:0), v13:0) :|: v7:0 < 0
Start term: f_66

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

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

   (f_123_2,1)
   (f_66_2,2)

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

(10)
Obligation:
START: 2;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := oldX1 - 1;
assume(oldX0 < 0 && oldX1 = 1 + oldX2);
x0 := oldX0 + (1 + oldX2);
x1 := oldX1 - 1;
TO: 1;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := nondet();
oldX3 := nondet();
assume(oldX2 < 0);
x0 := oldX2 + (1 + oldX3);
x1 := oldX3;
TO: 1;


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

(11) T2 Underapproximation (COMPLETE)
Added the following guard statements:



Transition 1:
assume(x1 <= 0);



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

(12)
Obligation:
START: 2;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x1 - 1;
assume(x0 < 0 && x1 = 1 + (x1 - 1));
x0 := x0 + (x1 - 0);
assume(x1 <= 0);
x1 := x1 - 1;
TO: 1;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := nondet();
oldX3 := nondet();
assume(oldX2 < 0);
x0 := oldX2 + (oldX3 + 1);
x1 := oldX3;
TO: 1;


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

(13) T2 (COMPLETE)
Found this recurrent set for cutpoint 5: oldX2 <= -1 and x0-oldX3 <= 0 and x1-oldX3 <= 0 and x0-x1 <= 0 and x0+1 <= 0 and x1 <= 0

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

(14)
NO