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


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


NO
proof of /export/starexec/sandbox/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, 175 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 490 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms]
(6) LLVM Symbolic Execution Lasso
(7) Lasso2IRS [EQUIVALENT, 56 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [COMPLETE, 1326 ms]
(12) NO


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

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

(1) CToLLVMProof (EQUIVALENT)
Compiled c-file /export/starexec/sandbox/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
		%old_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 sgt %4 1
		br %5, %6, %15
	6:
		%7 = load %x
		store %7, %old_x
		%8 = call i32 (...)* @__VERIFIER_nondet_int()
		store %8, %x
		%9 = load %x
		%10 = load %old_x
		%11 = mul 2 %10
		%12 = icmp slt %9 %11
		br %12, %13, %14
	13:
		br %15
	14:
		br %3
	15:
		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_118(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) -> f_119(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) :|: 0 = 0
f_119(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) -> f_120(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) :|: TRUE
f_120(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) -> f_121(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) :|: 0 = 0
f_121(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) -> f_122(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) :|: TRUE
f_122(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) -> f_123(v22, v23, v24, v25, v28, 1, v35, v26, v29, 0, v31, v32, v33, 3, 2, 4) :|: TRUE
f_123(v22, v23, v24, v25, v28, 1, v35, v26, v29, 0, v31, v32, v33, 3, 2, 4) -> f_124(v22, v23, v24, v25, v28, 1, v35, v26, v29, 0, v31, v32, v33, 3, 2, 4) :|: TRUE
f_124(v22, v23, v24, v25, v28, 1, v35, v26, v29, 0, v31, v32, v33, 3, 2, 4) -> f_125(v22, v23, v24, v25, v28, 1, v35, v26, v29, 0, v31, v32, v33, 3, 2, 4) :|: 0 = 0
f_125(v22, v23, v24, v25, v28, 1, v35, v26, v29, 0, v31, v32, v33, 3, 2, 4) -> f_126(v22, v23, v24, v25, v28, 1, v35, v29, 0, v31, v32, v33, 3, 2, 4) :|: 0 = 0
f_126(v22, v23, v24, v25, v28, 1, v35, v29, 0, v31, v32, v33, 3, 2, 4) -> f_127(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) :|: v37 = 2 * v28 && 8 <= v37
f_127(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) -> f_129(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) :|: v37 <= v35 && 8 <= v35
f_129(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) -> f_131(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) :|: 0 = 0
f_131(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) -> f_133(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) :|: TRUE
f_133(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) -> f_135(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) :|: TRUE
f_135(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4, 8) -> f_117(v22, v23, v24, v25, v28, 1, v35, v37, 0, v31, v32, v33, 3, 2, 4) :|: TRUE
f_117(v22, v23, v24, v25, v26, 1, v28, v29, 0, v31, v32, v33, 3, 2, 4) -> f_118(v22, v23, v24, v25, v28, 1, v26, v29, 0, v31, v32, v33, 3, 2, 4) :|: 0 = 0
f_69 -> f_70(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2
f_70(v1, v2, 3, 1, 4) -> f_71(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4
f_71(v1, v3, v2, v4, 3, 1, 4) -> f_72(v1, v3, v5, v2, v4, v6, 3, 1, 4) :|: 1 <= v5 && v6 = 3 + v5 && 4 <= v6
f_72(v1, v3, v5, v2, v4, v6, 3, 1, 4) -> f_73(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_73(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) -> f_74(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_74(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_75(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_75(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_76(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_76(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_77(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: 0 = 0
f_77(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_78(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4, 2) :|: 1 < v7
f_78(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4, 2) -> f_80(v1, v3, v5, v7, 1, v2, v4, v6, 0, 3, 4, 2) :|: 0 = 0
f_80(v1, v3, v5, v7, 1, v2, v4, v6, 0, 3, 4, 2) -> f_82(v1, v3, v5, v7, 1, v2, v4, v6, 0, 3, 4, 2) :|: TRUE
f_82(v1, v3, v5, v7, 1, v2, v4, v6, 0, 3, 4, 2) -> f_84(v1, v3, v5, v7, 1, v2, v4, v6, 0, 3, 4, 2) :|: 0 = 0
f_84(v1, v3, v5, v7, 1, v2, v4, v6, 0, 3, 4, 2) -> f_85(v1, v3, v5, v7, 1, v2, v4, v6, 0, 3, 4, 2) :|: TRUE
f_85(v1, v3, v5, v7, 1, v2, v4, v6, 0, 3, 4, 2) -> f_86(v1, v3, v5, v7, 1, v10, v2, v4, v6, 0, 3, 4, 2) :|: TRUE
f_86(v1, v3, v5, v7, 1, v10, v2, v4, v6, 0, 3, 4, 2) -> f_87(v1, v3, v5, v7, 1, v10, v2, v4, v6, 0, 3, 4, 2) :|: TRUE
f_87(v1, v3, v5, v7, 1, v10, v2, v4, v6, 0, 3, 4, 2) -> f_88(v1, v3, v5, v7, 1, v10, v2, v4, v6, 0, 3, 4, 2) :|: 0 = 0
f_88(v1, v3, v5, v7, 1, v10, v2, v4, v6, 0, 3, 4, 2) -> f_89(v1, v3, v5, v7, 1, v10, v2, v4, v6, 0, 3, 4, 2) :|: 0 = 0
f_89(v1, v3, v5, v7, 1, v10, v2, v4, v6, 0, 3, 4, 2) -> f_90(v1, v3, v5, v7, 1, v10, v12, v2, v4, v6, 0, 3, 2, 4) :|: v12 = 2 * v7 && 4 <= v12
f_90(v1, v3, v5, v7, 1, v10, v12, v2, v4, v6, 0, 3, 2, 4) -> f_92(v1, v3, v5, v7, 1, v10, v12, v2, v4, v6, 0, 3, 2, 4) :|: v12 <= v10 && 4 <= v10
f_92(v1, v3, v5, v7, 1, v10, v12, v2, v4, v6, 0, 3, 2, 4) -> f_94(v1, v3, v5, v7, 1, v10, v12, 0, v2, v4, v6, 3, 2, 4) :|: 0 = 0
f_94(v1, v3, v5, v7, 1, v10, v12, 0, v2, v4, v6, 3, 2, 4) -> f_96(v1, v3, v5, v7, 1, v10, v12, 0, v2, v4, v6, 3, 2, 4) :|: TRUE
f_96(v1, v3, v5, v7, 1, v10, v12, 0, v2, v4, v6, 3, 2, 4) -> f_98(v1, v3, v5, v7, 1, v10, v12, 0, v2, v4, v6, 3, 2, 4) :|: TRUE
f_98(v1, v3, v5, v7, 1, v10, v12, 0, v2, v4, v6, 3, 2, 4) -> f_117(v1, v3, v5, v7, v7, 1, v10, v12, 0, v2, v4, v6, 3, 2, 4) :|: TRUE
Combined rules. Obtained 2 rulesP rules:
f_69 -> f_118(v1:0, v3:0, v5:0, v7:0, v10:0, 1, v7:0, 2 * v7:0, 0, 3 + v1:0, 3 + v3:0, 3 + v5:0, 3, 2, 4) :|: v3:0 > 0 && v1:0 > 0 && v5:0 > 0 && v7:0 > 1 && 3 < 2 * v7:0 && v10:0 >= 2 * v7:0 && v10:0 > 3
f_118(v22:0, v23:0, v24:0, v25:0, v28:0, 1, v26:0, v29:0, 0, v31:0, v32:0, v33:0, 3, 2, 4) -> f_118(v22:0, v23:0, v24:0, v25:0, v35:0, 1, v28:0, 2 * v28:0, 0, v31:0, v32:0, v33:0, 3, 2, 4) :|: 7 < 2 * v28:0 && v35:0 >= 2 * v28:0 && v35:0 > 7
Filtered unneeded arguments:
   f_118(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15) -> f_118(x4, x5, x7, x8)
Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules:
f_69 -> f_118(v7:0, v10:0, v7:0, 2 * v7:0) :|: 3 < 2 * v7:0 && v7:0 > 1 && v10:0 > 3 && v10:0 >= 2 * v7:0
f_118(v25:0, v28:0, v26:0, v29:0) -> f_118(v25:0, v35:0, v28:0, 2 * v28:0) :|: v35:0 >= 2 * v28:0 && v35:0 > 7 && 7 < 2 * v28:0

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

(8)
Obligation:
Rules:
f_69 -> f_118(v7:0, v10:0, v7:0, 2 * v7:0) :|: 3 < 2 * v7:0 && v7:0 > 1 && v10:0 > 3 && v10:0 >= 2 * v7:0
f_118(v25:0, v28:0, v26:0, v29:0) -> f_118(v25:0, v35:0, v28:0, 2 * v28:0) :|: v35:0 >= 2 * v28:0 && v35:0 > 7 && 7 < 2 * v28:0
Start term: f_69

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

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

   (f_69_4,1)
   (f_118_4,2)

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

(10)
Obligation:
START: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := nondet();
oldX5 := nondet();
assume(3 < 2 * oldX4 && oldX4 > 1 && oldX5 > 3 && oldX5 >= 2 * oldX4);
x0 := oldX4;
x1 := oldX5;
x2 := oldX4;
x3 := 2 * oldX4;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := nondet();
assume(oldX4 >= 2 * oldX1 && oldX4 > 7 && 7 < 2 * oldX1);
x0 := oldX0;
x1 := oldX4;
x2 := oldX1;
x3 := 2 * oldX1;
TO: 2;


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

(11) T2 (COMPLETE)
Found this recurrent set for cutpoint 5: 2 <= oldX4 and 4 <= oldX5 and 4 <= x1 and 6 <= oldX4+oldX5 and oldX4-x1 <= 0 and 6 <= oldX4+x1 and oldX5-x1 <= 0 and 8 <= oldX5+x1 and -x1+4 <= 0

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

(12)
NO