/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, 176 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 2660 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 56 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 4 ms]
(12) 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_error" returnParam: BasicVoidType parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "sum" 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 %2
		%5 = icmp sle %4 0
		br %5, %6, %10
	6:
		%7 = load %3
		%8 = load %2
		%9 = add %7 %8
		store %9, %1
		br %16
	10:
		%11 = load %2
		%12 = sub %11 1
		%13 = load %3
		%14 = add %13 1
		%15 = call i32 @sum(i32 %12, i32 %14)
		store %15, %1
		br %16
	16:
		%17 = load %1
		ret %17

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%a = alloca i32, align 4
		%b = alloca i32, align 4
		%result = alloca i32, align 4
		store 0, %1
		store 2, %a
		store 3, %b
		%2 = load %a
		%3 = load %b
		%4 = call i32 @sum(i32 %2, i32 %3)
		store %4, %result
		%5 = load %result
		%6 = load %a
		%7 = load %b
		%8 = add %6 %7
		%9 = icmp eq %5 %8
		br %9, %10, %12
	10:
		br %11
	11:
		Unnamed Call-Instruction = call BasicVoidType (...)* @__VERIFIER_error()
		br %12
	12:
		%13 = load %1
		ret %13


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 16 rulesP rules:
f_204(v77, v78, v90, v79, v80, v81, v82, v83, v84, v85, v86, v91, 0, 2, 3, 1, 4) -> f_205(v77, v78, v90, v92, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, 0, 2, 3, 1, 4) :|: 1 <= v92 && v93 = 3 + v92 && 4 <= v93
f_205(v77, v78, v90, v92, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, 0, 2, 3, 1, 4) -> f_206(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) :|: 1 <= v94 && v95 = 3 + v94 && 4 <= v95
f_206(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) -> f_207(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) :|: TRUE
f_207(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) -> f_208(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) :|: TRUE
f_208(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) -> f_209(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) :|: 0 = 0
f_209(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) -> f_211(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) :|: 0 < v77
f_211(v77, v78, v90, v92, v94, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 0, 2, 3, 1, 4) -> f_213(v77, v78, v90, v92, v94, 0, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) :|: 0 = 0
f_213(v77, v78, v90, v92, v94, 0, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) -> f_215(v77, v78, v90, v92, v94, 0, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) :|: TRUE
f_215(v77, v78, v90, v92, v94, 0, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) -> f_217(v77, v78, v90, v92, v94, 0, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) :|: 0 = 0
f_217(v77, v78, v90, v92, v94, 0, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) -> f_219(v77, v78, v90, v92, v94, 0, v98, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) :|: 1 + v98 = v77 && 0 <= v98 && v98 <= 1
f_219(v77, v78, v90, v92, v94, 0, v98, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) -> f_221(v77, v78, v90, v92, v94, 0, v98, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) :|: 0 = 0
f_221(v77, v78, v90, v92, v94, 0, v98, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) -> f_223(v77, v78, v90, v92, v94, 0, v98, v100, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) :|: v100 = 1 + v78 && 4 <= v100
f_223(v77, v78, v90, v92, v94, 0, v98, v100, v79, v80, v81, v82, v83, v84, v85, v86, v91, v93, v95, 2, 3, 1, 4) -> f_225(v98, v100, v79, v80, v81, v82, v83, v84, v85, v86, v90, v91, v92, v93, v94, v95, 0, 2, 3, v77, v78, 1, 4) :|: 0 = 0
f_225(v98, v100, v79, v80, v81, v82, v83, v84, v85, v86, v90, v91, v92, v93, v94, v95, 0, 2, 3, v77, v78, 1, 4) -> f_227(v98, v100, v79, v80, v81, v82, v83, v84, v85, v86, v90, v91, v92, v93, v94, v95, 0, 2, 3, v77, v78, 1, 4) :|: TRUE
f_227(v98, v100, v79, v80, v81, v82, v83, v84, v85, v86, v90, v91, v92, v93, v94, v95, 0, 2, 3, v77, v78, 1, 4) -> f_203(v98, v100, v79, v80, v81, v82, v83, v84, v85, v86, 0, 2, 3, 1, 4) :|: TRUE
f_203(v77, v78, v79, v80, v81, v82, v83, v84, v85, v86, 0, 2, 3, 1, 4) -> f_204(v77, v78, v90, v79, v80, v81, v82, v83, v84, v85, v86, v91, 0, 2, 3, 1, 4) :|: 1 <= v90 && v91 = 3 + v90 && 4 <= v91
Combined rules. Obtained 1 rulesP rules:
f_204(1 + v98:0, v78:0, v90:0, v79:0, v80:0, v81:0, v82:0, v83:0, v84:0, v85:0, v86:0, v91:0, 0, 2, 3, 1, 4) -> f_204(v98:0, 1 + v78:0, v90:1, v79:0, v80:0, v81:0, v82:0, v83:0, v84:0, v85:0, v86:0, 3 + v90:1, 0, 2, 3, 1, 4) :|: v94:0 > 0 && v92:0 > 0 && v98:0 > -1 && v98:0 < 2 && v78:0 > 2 && v90:1 > 0
Filtered unneeded arguments:
   f_204(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_204(x1, x2)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_204(sum~cons_1~v98:0, v78:0) -> f_204(v98:0, 1 + v78:0) :|: v98:0 < 2 && v78:0 > 2 && v98:0 > -1 && sum~cons_1~v98:0 = 1 + v98:0

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

(8)
Obligation:
Rules:
f_204(sum~cons_1~v98:0, v78:0) -> f_204(v98:0, 1 + v78:0) :|: v98:0 < 2 && v78:0 > 2 && v98:0 > -1 && sum~cons_1~v98:0 = 1 + v98:0

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

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

(10)
Obligation:
Rules:
f_204(sum~cons_1~v98:0:0, v78:0:0) -> f_204(v98:0:0, 1 + v78:0:0) :|: v98:0:0 < 2 && v78:0:0 > 2 && v98:0:0 > -1 && sum~cons_1~v98:0:0 = 1 + v98:0:0

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_204 ] = f_204_1

The following rules are decreasing:
f_204(sum~cons_1~v98:0:0, v78:0:0) -> f_204(v98:0:0, 1 + v78:0:0) :|: v98:0:0 < 2 && v78:0:0 > 2 && v98:0:0 > -1 && sum~cons_1~v98:0:0 = 1 + v98:0:0

The following rules are bounded:
f_204(sum~cons_1~v98:0:0, v78:0:0) -> f_204(v98:0:0, 1 + v78:0:0) :|: v98:0:0 < 2 && v78:0:0 > 2 && v98:0:0 > -1 && sum~cons_1~v98:0:0 = 1 + v98:0:0


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

(12)
YES