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


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


YES
proof of /export/starexec/sandbox2/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, 178 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 1796 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 33 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(12) YES


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

(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_error" returnParam: BasicVoidType parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "id" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		store %x, %2
		%3 = load %2
		%4 = icmp eq %3 0
		br %4, %5, %6
	5:
		store 0, %1
		br %11
	6:
		%7 = load %2
		%8 = sub %7 1
		%9 = call i32 @id(i32 %8)
		%10 = add %9 1
		store %10, %1
		br %11
	11:
		%12 = load %1
		ret %12

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


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 12 rulesP rules:
f_153(v56, v65, v57, v58, v59, v60, v61, v62, v66, 0, 10, 3, 1, 4) -> f_154(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) :|: 1 <= v67 && v68 = 3 + v67 && 4 <= v68
f_154(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) -> f_155(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) :|: TRUE
f_155(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) -> f_156(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) :|: 0 = 0
f_156(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) -> f_158(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) :|: v56 != 0
f_158(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) -> f_160(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) :|: 0 = 0
f_160(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) -> f_162(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) :|: TRUE
f_162(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) -> f_164(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) :|: 0 = 0
f_164(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) -> f_166(v56, v65, v67, 0, v70, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4, 9) :|: 1 + v70 = v56 && 0 <= v70 && v70 <= 9
f_166(v56, v65, v67, 0, v70, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4, 9) -> f_168(v70, v57, v58, v59, v60, v61, v62, v65, v66, v67, v68, 0, 10, v56, 3, 1, 4, 9) :|: 0 = 0
f_168(v70, v57, v58, v59, v60, v61, v62, v65, v66, v67, v68, 0, 10, v56, 3, 1, 4, 9) -> f_170(v70, v57, v58, v59, v60, v61, v62, v65, v66, v67, v68, 0, 10, v56, 3, 1, 4, 9) :|: TRUE
f_170(v70, v57, v58, v59, v60, v61, v62, v65, v66, v67, v68, 0, 10, v56, 3, 1, 4, 9) -> f_152(v70, v57, v58, v59, v60, v61, v62, 0, 10, 3, 1, 4) :|: TRUE
f_152(v56, v57, v58, v59, v60, v61, v62, 0, 10, 3, 1, 4) -> f_153(v56, v65, v57, v58, v59, v60, v61, v62, v66, 0, 10, 3, 1, 4) :|: 1 <= v65 && v66 = 3 + v65 && 4 <= v66
Combined rules. Obtained 1 rulesP rules:
f_153(1 + v70:0, v65:0, v57:0, v58:0, v59:0, v60:0, v61:0, v62:0, v66:0, 0, 10, 3, 1, 4) -> f_153(v70:0, v65:1, v57:0, v58:0, v59:0, v60:0, v61:0, v62:0, 3 + v65:1, 0, 10, 3, 1, 4) :|: v67:0 > 0 && v70:0 > -1 && v70:0 < 10 && v65:1 > 0
Filtered unneeded arguments:
   f_153(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_153(x1)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_153(sum~cons_1~v70:0) -> f_153(v70:0) :|: v70:0 > -1 && v70:0 < 10 && sum~cons_1~v70:0 = 1 + v70:0

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

(8)
Obligation:
Rules:
f_153(sum~cons_1~v70:0) -> f_153(v70:0) :|: v70:0 > -1 && v70:0 < 10 && sum~cons_1~v70:0 = 1 + v70:0

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

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

(10)
Obligation:
Rules:
f_153(sum~cons_1~v70:0:0) -> f_153(v70:0:0) :|: v70:0:0 > -1 && v70:0:0 < 10 && sum~cons_1~v70:0:0 = 1 + v70:0:0

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

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_153(x)] = x

The following rules are decreasing:
f_153(sum~cons_1~v70:0:0) -> f_153(v70:0:0) :|: v70:0:0 > -1 && v70:0:0 < 10 && sum~cons_1~v70:0:0 = 1 + v70:0:0
The following rules are bounded:
f_153(sum~cons_1~v70:0:0) -> f_153(v70:0:0) :|: v70:0:0 > -1 && v70:0:0 < 10 && sum~cons_1~v70:0:0 = 1 + v70:0:0

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

(12)
YES