/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, 102 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 484 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms]
(6) LLVM Symbolic Execution Lasso
(7) Lasso2IRS [EQUIVALENT, 82 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [COMPLETE, 1292 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
		%y = alloca i32, align 4
		store 0, %1
		%2 = call i32 (...)* @__VERIFIER_nondet_int()
		store %2, %y
		br %3
	3:
		%4 = load %y
		%5 = icmp sge %4 0
		br %5, %6, %9
	6:
		%7 = load %y
		%8 = icmp sle %7 10
		br %9
	9:
		%10 = phi [0, %3], [%8, %6]
		br %10, %11, %16
	11:
		%12 = load %y
		%13 = mul 2 %12
		%14 = add %13 1
		%15 = sdiv %14 2
		store %15, %y
		br %3
	16:
		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 38 rulesP rules:
f_120(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_121(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: 0 <= v73
f_121(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_123(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: 0 = 0
f_123(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_125(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: TRUE
f_125(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_127(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: 0 = 0
f_127(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_129(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: v73 <= 10
f_129(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_131(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: 0 = 0
f_131(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_133(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: 0 = 0
f_133(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_135(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: TRUE
f_135(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_137(v66, v67, v68, v73, 1, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: 0 = 0
f_137(v66, v67, v68, v73, 1, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_138(v66, v67, v68, v73, 1, v109, v72, v74, v75, 0, 3, 2, 10, 21, 4, 20) :|: v109 = 2 * v73 && 0 <= v109 && v109 <= 20
f_138(v66, v67, v68, v73, 1, v109, v72, v74, v75, 0, 3, 2, 10, 21, 4, 20) -> f_139(v66, v67, v68, v73, 1, v109, v110, v74, v75, 0, 3, 2, 10, 4, 20, 21) :|: v110 = 1 + v109 && 1 <= v110 && v110 <= 21
f_139(v66, v67, v68, v73, 1, v109, v110, v74, v75, 0, 3, 2, 10, 4, 20, 21) -> f_140(v66, v67, v68, v73, 1, v109, v110, v111, v74, v75, 0, 3, 2, 10, 4, 20, 21) :|: v111 = v110 / 2
f_140(v66, v67, v68, v73, 1, v109, v110, v111, v74, v75, 0, 3, 2, 10, 4, 20, 21) -> f_141(v66, v67, v68, v73, 1, v109, v110, v111, v74, v75, 0, 3, 2, 10, 4, 20, 21) :|: TRUE
f_141(v66, v67, v68, v73, 1, v109, v110, v111, v74, v75, 0, 3, 2, 10, 4, 20, 21) -> f_142(v66, v67, v68, v73, 1, v109, v110, v111, v74, v75, 0, 3, 2, 10, 4, 20, 21) :|: TRUE
f_142(v66, v67, v68, v73, 1, v109, v110, v111, v74, v75, 0, 3, 2, 10, 4, 20, 21) -> f_119(v66, v67, v68, v73, 1, v109, v110, v111, v74, v75, 0, 3, 2, 10, 20, 21, 4) :|: TRUE
f_119(v66, v67, v68, v69, 1, v71, v72, v73, v74, v75, 0, 3, 2, 10, 20, 21, 4) -> f_120(v66, v67, v68, v73, 1, v69, v71, v72, v74, v75, 0, 3, 2, 10, 20, 21, 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, v2, v4, 0, 3, 1, 4) :|: TRUE
f_69(v1, v3, v2, v4, 0, 3, 1, 4) -> f_70(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: TRUE
f_70(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_71(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: TRUE
f_71(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_72(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: TRUE
f_72(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_73(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: 0 = 0
f_73(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_74(v1, v3, v5, v2, v4, 0, 3, 1, 4) :|: 0 <= v5
f_74(v1, v3, v5, v2, v4, 0, 3, 1, 4) -> f_76(v1, v3, v5, 1, v2, v4, 0, 3, 4) :|: 0 = 0
f_76(v1, v3, v5, 1, v2, v4, 0, 3, 4) -> f_78(v1, v3, v5, 1, v2, v4, 0, 3, 4) :|: TRUE
f_78(v1, v3, v5, 1, v2, v4, 0, 3, 4) -> f_80(v1, v3, v5, 1, v2, v4, 0, 3, 4) :|: 0 = 0
f_80(v1, v3, v5, 1, v2, v4, 0, 3, 4) -> f_82(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) :|: v5 <= 10
f_82(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) -> f_84(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) :|: 0 = 0
f_84(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) -> f_86(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) :|: 0 = 0
f_86(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) -> f_88(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) :|: TRUE
f_88(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) -> f_90(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) :|: 0 = 0
f_90(v1, v3, v5, 1, v2, v4, 0, 3, 4, 10) -> f_91(v1, v3, v5, 1, v9, v2, v4, 0, 3, 2, 4, 10, 20) :|: v9 = 2 * v5 && 0 <= v9 && v9 <= 20
f_91(v1, v3, v5, 1, v9, v2, v4, 0, 3, 2, 4, 10, 20) -> f_92(v1, v3, v5, 1, v9, v10, v2, v4, 0, 3, 2, 4, 10, 20, 21) :|: v10 = 1 + v9 && 1 <= v10 && v10 <= 21
f_92(v1, v3, v5, 1, v9, v10, v2, v4, 0, 3, 2, 4, 10, 20, 21) -> f_93(v1, v3, v5, 1, v9, v10, v11, v2, v4, 0, 3, 2, 4, 10, 20, 21) :|: v11 = v10 / 2
f_93(v1, v3, v5, 1, v9, v10, v11, v2, v4, 0, 3, 2, 4, 10, 20, 21) -> f_94(v1, v3, v5, 1, v9, v10, v11, v2, v4, 0, 3, 2, 4, 10, 20, 21) :|: TRUE
f_94(v1, v3, v5, 1, v9, v10, v11, v2, v4, 0, 3, 2, 4, 10, 20, 21) -> f_95(v1, v3, v5, 1, v9, v10, v11, v2, v4, 0, 3, 2, 4, 10, 20, 21) :|: TRUE
f_95(v1, v3, v5, 1, v9, v10, v11, v2, v4, 0, 3, 2, 4, 10, 20, 21) -> f_119(v1, v3, v5, v5, 1, v9, v10, v11, v2, v4, 0, 3, 2, 10, 20, 21, 4) :|: TRUE
Combined rules. Obtained 2 rulesP rules:
f_120(v66:0, v67:0, v68:0, v73:0, 1, v69:0, v71:0, v72:0, v74:0, v75:0, 0, 3, 2, 10, 20, 21, 4) -> f_120(v66:0, v67:0, v68:0, v111:0, 1, v73:0, 2 * v73:0, 1 + 2 * v73:0, v74:0, v75:0, 0, 3, 2, 10, 20, 21, 4) :|: v73:0 > -1 && v73:0 < 11 && 2 * v73:0 > -1 && 21 > 2 * v73:0 && v111:0 = (1 + 2 * v73:0) / 2
f_66 -> f_120(v1:0, v3:0, v5:0, v11:0, 1, v5:0, 2 * v5:0, 1 + 2 * v5:0, 3 + v1:0, 3 + v3:0, 0, 3, 2, 10, 20, 21, 4) :|: v3:0 > 0 && v1:0 > 0 && v5:0 > -1 && v5:0 < 11 && 2 * v5:0 > -1 && 21 > 2 * v5:0 && v11:0 = (1 + 2 * v5:0) / 2
Filtered unneeded arguments:
   f_120(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_120(x3, x4, x6, x7, x8)
Removed division, modulo operations, cleaned up constraints. Obtained 4 rules.P rules:
f_120(v68:0, v73:0, v69:0, v71:0, v72:0) -> f_120'(v68:0, v73:0, v69:0, v71:0, v72:0) :|: v73:0 < 11 && v73:0 > -1 && 21 > 2 * v73:0 && 2 * v73:0 > -1
f_120'(v68:0, v73:0, v69:0, v71:0, v72:0) -> f_120(v68:0, div, v73:0, 2 * v73:0, 1 + 2 * v73:0) :|: 2 * v73:0 > -1 && v73:0 < 11 && v73:0 > -1 && 21 > 2 * v73:0 && 2 > 1 + 2 * v73:0 - 2 * div && 1 + 2 * v73:0 - 2 * div >= 0
f_66 -> f_66' :|: TRUE
f_66' -> f_120(v5:0, div, v5:0, 2 * v5:0, 1 + 2 * v5:0) :|: 2 * v5:0 > -1 && v5:0 < 11 && v5:0 > -1 && 21 > 2 * v5:0 && 2 > 1 + 2 * v5:0 - 2 * div && 1 + 2 * v5:0 - 2 * div >= 0

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

(8)
Obligation:
Rules:
f_120(v68:0, v73:0, v69:0, v71:0, v72:0) -> f_120'(v68:0, v73:0, v69:0, v71:0, v72:0) :|: v73:0 < 11 && v73:0 > -1 && 21 > 2 * v73:0 && 2 * v73:0 > -1
f_120'(x, x1, x2, x3, x4) -> f_120(x, x5, x1, 2 * x1, 1 + 2 * x1) :|: 2 * x1 > -1 && x1 < 11 && x1 > -1 && 21 > 2 * x1 && 2 > 1 + 2 * x1 - 2 * x5 && 1 + 2 * x1 - 2 * x5 >= 0
f_66 -> f_66' :|: TRUE
f_66' -> f_120(x6, x7, x6, 2 * x6, 1 + 2 * x6) :|: 2 * x6 > -1 && x6 < 11 && x6 > -1 && 21 > 2 * x6 && 2 > 1 + 2 * x6 - 2 * x7 && 1 + 2 * x6 - 2 * x7 >= 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_120_5,1)
   (f_120'_5,2)
   (f_66_5,3)
   (f_66'_5,4)

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

(10)
Obligation:
START: 3;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := x4;
assume(oldX1 < 11 && oldX1 > -1 && 21 > 2 * oldX1 && 2 * oldX1 > -1);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
x3 := oldX3;
x4 := oldX4;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := x4;
oldX5 := nondet();
assume(2 * oldX1 > -1 && oldX1 < 11 && oldX1 > -1 && 21 > 2 * oldX1 && 2 > 1 + 2 * oldX1 - 2 * oldX5 && 1 + 2 * oldX1 - 2 * oldX5 >= 0);
x0 := oldX0;
x1 := oldX5;
x2 := oldX1;
x3 := 2 * oldX1;
x4 := 1 + 2 * oldX1;
TO: 1;

FROM: 3;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := x4;
oldX5 := nondet();
oldX6 := nondet();
oldX7 := nondet();
oldX8 := nondet();
oldX9 := nondet();
assume(0 = 0);
x0 := oldX5;
x1 := oldX6;
x2 := oldX7;
x3 := oldX8;
x4 := oldX9;
TO: 4;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := x4;
oldX5 := nondet();
oldX6 := nondet();
assume(2 * oldX5 > -1 && oldX5 < 11 && oldX5 > -1 && 21 > 2 * oldX5 && 2 > 1 + 2 * oldX5 - 2 * oldX6 && 1 + 2 * oldX5 - 2 * oldX6 >= 0);
x0 := oldX5;
x1 := oldX6;
x2 := oldX5;
x3 := 2 * oldX5;
x4 := 1 + 2 * oldX5;
TO: 1;


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

(11) T2 (COMPLETE)
Found this recurrent set for cutpoint 5: oldX5 == 0 and oldX6 == 0 and x1 == 0

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

(12)
NO