/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 173 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 4683 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 77 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 11 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_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "iterate" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (bound i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%i = alloca i32, align 4
		%sum = alloca i32, align 4
		store %bound, %1
		store 0, %sum
		store 0, %i
		br %2
	2:
		%3 = load %i
		%4 = load %1
		%5 = icmp slt %3 %4
		br %5, %6, %13
	6:
		%7 = load %i
		%8 = load %sum
		%9 = add %8 %7
		store %9, %sum
		br %10
	10:
		%11 = load %i
		%12 = add %11 1
		store %12, %i
		br %2
	13:
		%14 = load %sum
		ret %14

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		%3 = call i32 @iterate(i32 %2)
		ret %3


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 15 rulesP rules:
f_216(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 4) -> f_217(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 4) :|: 0 = 0
f_217(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 4) -> f_218(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: v93 < v85 && 2 <= v85
f_218(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_220(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: 0 = 0
f_220(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_222(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: TRUE
f_222(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_224(v85, v86, v87, v88, v93, 1, v91, v92, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: 0 = 0
f_224(v85, v86, v87, v88, v93, 1, v91, v92, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_226(v85, v86, v87, v88, v93, 1, v92, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: 0 = 0
f_226(v85, v86, v87, v88, v93, 1, v92, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_228(v85, v86, v87, v88, v93, 1, v92, v100, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: v100 = v92 + v93 && 1 <= v100
f_228(v85, v86, v87, v88, v93, 1, v92, v100, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_229(v85, v86, v87, v88, v93, 1, v92, v100, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: TRUE
f_229(v85, v86, v87, v88, v93, 1, v92, v100, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_230(v85, v86, v87, v88, v93, 1, v92, v100, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: TRUE
f_230(v85, v86, v87, v88, v93, 1, v92, v100, v89, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_231(v85, v86, v87, v88, v93, 1, v92, v100, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: 0 = 0
f_231(v85, v86, v87, v88, v93, 1, v92, v100, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_232(v85, v86, v87, v88, v93, 1, v92, v100, v102, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: v102 = 1 + v93 && 2 <= v102
f_232(v85, v86, v87, v88, v93, 1, v92, v100, v102, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_233(v85, v86, v87, v88, v93, 1, v92, v100, v102, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: TRUE
f_233(v85, v86, v87, v88, v93, 1, v92, v100, v102, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_234(v85, v86, v87, v88, v93, 1, v92, v100, v102, v94, v95, v96, v97, v98, 0, 3, 2, 4) :|: TRUE
f_234(v85, v86, v87, v88, v93, 1, v92, v100, v102, v94, v95, v96, v97, v98, 0, 3, 2, 4) -> f_215(v85, v86, v87, v88, v93, 1, v92, v100, v102, v94, v95, v96, v97, v98, 0, 3, 4) :|: TRUE
f_215(v85, v86, v87, v88, v89, 1, v91, v92, v93, v94, v95, v96, v97, v98, 0, 3, 4) -> f_216(v85, v86, v87, v88, v93, 1, v89, v91, v92, v94, v95, v96, v97, v98, 0, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_216(v85:0, v86:0, v87:0, v88:0, v93:0, 1, v89:0, v91:0, v92:0, v94:0, v95:0, v96:0, v97:0, v98:0, 0, 3, 4) -> f_216(v85:0, v86:0, v87:0, v88:0, 1 + v93:0, 1, v93:0, v92:0, v92:0 + v93:0, v94:0, v95:0, v96:0, v97:0, v98:0, 0, 3, 4) :|: v85:0 > 1 && v93:0 < v85:0 && v93:0 > 0 && v92:0 + v93:0 > 0
Filtered unneeded arguments:
   f_216(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_216(x1, x5, x9)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_216(v85:0, v93:0, v92:0) -> f_216(v85:0, 1 + v93:0, v92:0 + v93:0) :|: v93:0 < v85:0 && v85:0 > 1 && v92:0 + v93:0 > 0 && v93:0 > 0

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

(8)
Obligation:
Rules:
f_216(v85:0, v93:0, v92:0) -> f_216(v85:0, 1 + v93:0, v92:0 + v93:0) :|: v93:0 < v85:0 && v85:0 > 1 && v92:0 + v93:0 > 0 && v93:0 > 0

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

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

(10)
Obligation:
Rules:
f_216(v85:0:0, v93:0:0, v92:0:0) -> f_216(v85:0:0, 1 + v93:0:0, v92:0:0 + v93:0:0) :|: v92:0:0 + v93:0:0 > 0 && v93:0:0 > 0 && v85:0:0 > 1 && v93:0:0 < v85:0:0

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

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_216(x, x1, x2)] = x - x1

The following rules are decreasing:
f_216(v85:0:0, v93:0:0, v92:0:0) -> f_216(v85:0:0, 1 + v93:0:0, v92:0:0 + v93:0:0) :|: v92:0:0 + v93:0:0 > 0 && v93:0:0 > 0 && v85:0:0 > 1 && v93:0:0 < v85:0:0
The following rules are bounded:
f_216(v85:0:0, v93:0:0, v92:0:0) -> f_216(v85:0:0, 1 + v93:0:0, v92:0:0 + v93:0:0) :|: v92:0:0 + v93:0:0 > 0 && v93:0:0 > 0 && v85:0:0 > 1 && v93:0:0 < v85:0:0

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

(12)
YES