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


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


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


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 174 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 2932 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 114 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(12) IntTRS
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IntTRS
(15) RankingReductionPairProof [EQUIVALENT, 0 ms]
(16) YES


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

(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: false visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "mult" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (n i32, m i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		%3 = alloca i32, align 4
		store %n, %2
		store %m, %3
		%4 = load %3
		%5 = icmp slt %4 0
		br %5, %6, %12
	6:
		%7 = load %2
		%8 = load %3
		%9 = sub 0 %8
		%10 = call i32 @mult(i32 %7, i32 %9)
		%11 = mul -1 %10
		store %11, %1
		br %23
	12:
		%13 = load %3
		%14 = icmp eq %13 0
		br %14, %15, %16
	15:
		store 0, %1
		br %23
	16:
		%17 = load %2
		%18 = load %2
		%19 = load %3
		%20 = sub %19 1
		%21 = call i32 @mult(i32 %18, i32 %20)
		%22 = add %17 %21
		store %22, %1
		br %23
	23:
		%24 = load %1
		ret %24

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%m = alloca i32, align 4
		%n = alloca i32, align 4
		%res = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %m
		%3 = call i32 @__VERIFIER_nondet_int()
		store %3, %n
		%4 = load %m
		%5 = load %n
		%6 = call i32 @mult(i32 %4, i32 %5)
		store %6, %res
		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) SymbolicExecutionGraphToSCCProof (SOUND)
Splitted symbolic execution graph to 1 SCC.
----------------------------------------

(6)
Obligation:
SCC
----------------------------------------

(7) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 29 rulesP rules:
f_179(v22, v23, v34, v24, v25, v26, v27, v28, v29, v30, v31, v35, 0, v33, 3, 1, 4) -> f_180(v22, v23, v34, v36, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, 0, v33, 3, 1, 4) :|: 1 <= v36 && v37 = 3 + v36 && 4 <= v37
f_180(v22, v23, v34, v36, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, 0, v33, 3, 1, 4) -> f_181(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) :|: 1 <= v38 && v39 = 3 + v38 && 4 <= v39
f_181(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) -> f_182(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) :|: TRUE
f_182(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) -> f_183(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) :|: TRUE
f_183(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) -> f_184(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) :|: 0 = 0
f_184(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) -> f_185(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) :|: v23 < 0
f_184(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) -> f_186(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) :|: 0 <= v23
f_185(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) -> f_187(v22, v23, v34, v36, v38, 1, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) :|: 0 = 0
f_187(v22, v23, v34, v36, v38, 1, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) -> f_189(v22, v23, v34, v36, v38, 1, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) :|: TRUE
f_189(v22, v23, v34, v36, v38, 1, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) -> f_191(v22, v23, v34, v36, v38, 1, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) :|: 0 = 0
f_191(v22, v23, v34, v36, v38, 1, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) -> f_193(v22, v23, v34, v36, v38, 1, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) :|: 0 = 0
f_193(v22, v23, v34, v36, v38, 1, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) -> f_196(v22, v23, v34, v36, v38, 1, v42, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) :|: v42 + v23 = 0 && 1 <= v42
f_196(v22, v23, v34, v36, v38, 1, v42, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 4) -> f_199(v22, v42, v24, v25, v26, v27, v28, v29, v30, v31, v34, v35, v36, v37, v38, v39, 0, v33, v23, 1, 3, 4) :|: 0 = 0
f_199(v22, v42, v24, v25, v26, v27, v28, v29, v30, v31, v34, v35, v36, v37, v38, v39, 0, v33, v23, 1, 3, 4) -> f_202(v22, v42, v24, v25, v26, v27, v28, v29, v30, v31, v34, v35, v36, v37, v38, v39, 0, v33, v23, 3, 1, 4) :|: TRUE
f_202(v22, v42, v24, v25, v26, v27, v28, v29, v30, v31, v34, v35, v36, v37, v38, v39, 0, v33, v23, 3, 1, 4) -> f_176(v22, v42, v24, v25, v26, v27, v28, v29, v30, v31, 0, v33, 3, 1, 4) :|: TRUE
f_176(v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, 0, v33, 3, 1, 4) -> f_179(v22, v23, v34, v24, v25, v26, v27, v28, v29, v30, v31, v35, 0, v33, 3, 1, 4) :|: 1 <= v34 && v35 = 3 + v34 && 4 <= v35
f_186(v22, v23, v34, v36, v38, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, 0, v33, 3, 1, 4) -> f_188(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: 0 = 0
f_188(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_190(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: TRUE
f_190(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_192(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: 0 = 0
f_192(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_195(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: v23 != 0
f_195(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_198(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: 0 = 0
f_198(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_201(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: TRUE
f_201(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_204(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: 0 = 0
f_204(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_206(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: 0 = 0
f_206(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_208(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: 0 = 0
f_208(v22, v23, v34, v36, v38, 0, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_211(v22, v23, v34, v36, v38, 0, v87, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) :|: 1 + v87 = v23 && 0 <= v87
f_211(v22, v23, v34, v36, v38, 0, v87, v24, v25, v26, v27, v28, v29, v30, v31, v35, v37, v39, v33, 3, 1, 4) -> f_213(v22, v87, v24, v25, v26, v27, v28, v29, v30, v31, v34, v35, v36, v37, v38, v39, 0, v33, v23, 3, 1, 4) :|: 0 = 0
f_213(v22, v87, v24, v25, v26, v27, v28, v29, v30, v31, v34, v35, v36, v37, v38, v39, 0, v33, v23, 3, 1, 4) -> f_215(v22, v87, v24, v25, v26, v27, v28, v29, v30, v31, v34, v35, v36, v37, v38, v39, 0, v33, v23, 3, 1, 4) :|: TRUE
f_215(v22, v87, v24, v25, v26, v27, v28, v29, v30, v31, v34, v35, v36, v37, v38, v39, 0, v33, v23, 3, 1, 4) -> f_176(v22, v87, v24, v25, v26, v27, v28, v29, v30, v31, 0, v33, 3, 1, 4) :|: TRUE
Combined rules. Obtained 2 rulesP rules:
f_179(v22:0, 1 + v87:0, v34:0, v24:0, v25:0, v26:0, v27:0, v28:0, v29:0, v30:0, v31:0, v35:0, 0, v33:0, 3, 1, 4) -> f_179(v22:0, v87:0, v34:1, v24:0, v25:0, v26:0, v27:0, v28:0, v29:0, v30:0, v31:0, 3 + v34:1, 0, v33:0, 3, 1, 4) :|: v87:0 > -1 && v38:0 > 0 && v36:0 > 0 && v34:1 > 0
f_179(v22:0, v23:0, v34:0, v24:0, v25:0, v26:0, v27:0, v28:0, v29:0, v30:0, v31:0, v35:0, 0, v33:0, 3, 1, 4) -> f_179(v22:0, v42:0, v34:1, v24:0, v25:0, v26:0, v27:0, v28:0, v29:0, v30:0, v31:0, 3 + v34:1, 0, v33:0, 3, 1, 4) :|: v38:0 > 0 && v36:0 > 0 && v23:0 < 0 && v42:0 > 0 && v42:0 + v23:0 = 0 && v34:1 > 0
Filtered unneeded arguments:
   f_179(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_179(x2)
Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules:
f_179(sum~cons_1~v87:0) -> f_179(v87:0) :|: v87:0 > -1 && sum~cons_1~v87:0 = 1 + v87:0
f_179(v23:0) -> f_179(v42:0) :|: v42:0 > 0 && v42:0 + v23:0 = 0 && v23:0 < 0

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

(8)
Obligation:
Rules:
f_179(sum~cons_1~v87:0) -> f_179(v87:0) :|: v87:0 > -1 && sum~cons_1~v87:0 = 1 + v87:0
f_179(v23:0) -> f_179(v42:0) :|: v42:0 > 0 && v42:0 + v23:0 = 0 && v23:0 < 0

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

(9) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(10)
Obligation:
Rules:
f_179(v23:0:0) -> f_179(v42:0:0) :|: v42:0:0 > 0 && v42:0:0 + v23:0:0 = 0 && v23:0:0 < 0
f_179(sum~cons_1~v87:0:0) -> f_179(v87:0:0) :|: v87:0:0 > -1 && sum~cons_1~v87:0:0 = 1 + v87:0:0

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

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_179(x)] = -x + x^2

The following rules are decreasing:
f_179(v23:0:0) -> f_179(v42:0:0) :|: v42:0:0 > 0 && v42:0:0 + v23:0:0 = 0 && v23:0:0 < 0
The following rules are bounded:
f_179(v23:0:0) -> f_179(v42:0:0) :|: v42:0:0 > 0 && v42:0:0 + v23:0:0 = 0 && v23:0:0 < 0
f_179(sum~cons_1~v87:0:0) -> f_179(v87:0:0) :|: v87:0:0 > -1 && sum~cons_1~v87:0:0 = 1 + v87:0:0

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

(12)
Obligation:
Rules:
f_179(sum~cons_1~v87:0:0) -> f_179(v87:0:0) :|: v87:0:0 > -1 && sum~cons_1~v87:0:0 = 1 + v87:0:0

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

(13) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(14)
Obligation:
Rules:
f_179(sum~cons_1~v87:0:0:0) -> f_179(v87:0:0:0) :|: v87:0:0:0 > -1 && sum~cons_1~v87:0:0:0 = 1 + v87:0:0:0

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

(15) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_179 ] = f_179_1

The following rules are decreasing:
f_179(sum~cons_1~v87:0:0:0) -> f_179(v87:0:0:0) :|: v87:0:0:0 > -1 && sum~cons_1~v87:0:0:0 = 1 + v87:0:0:0

The following rules are bounded:
f_179(sum~cons_1~v87:0:0:0) -> f_179(v87:0:0:0) :|: v87:0:0:0 > -1 && sum~cons_1~v87:0:0:0 = 1 + v87:0:0:0


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

(16)
YES