/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, 176 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 1288 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 24 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 12 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: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32, y i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		%c = alloca i32, align 4
		store %x, %1
		store %y, %2
		store 0, %c
		br %3
	3:
		%4 = load %1
		%5 = load %2
		%6 = icmp eq %4 %5
		br %6, %7, %10
	7:
		%8 = load %1
		%9 = icmp sgt %8 0
		br %10
	10:
		%11 = phi [0, %3], [%9, %7]
		br %11, %12, %24
	12:
		br %13
	13:
		%14 = load %2
		%15 = icmp sgt %14 0
		br %15, %16, %23
	16:
		%17 = load %1
		%18 = sub %17 1
		store %18, %1
		%19 = load %2
		%20 = sub %19 1
		store %20, %2
		%21 = load %c
		%22 = add %21 1
		store %22, %c
		br %13
	23:
		br %3
	24:
		%25 = load %c
		ret %25

*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 @__VERIFIER_nondet_int()
		%4 = call i32 @test_fun(i32 %2, i32 %3)
		ret %4


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_305(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 4) -> f_306(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: 0 < v134 && 2 <= v133 && 2 <= v128
f_306(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_308(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: 0 = 0
f_308(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_310(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: TRUE
f_310(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_312(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: 0 = 0
f_312(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_314(v128, v129, v130, v131, 1, v134, v143, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: 1 + v143 = v134 && 0 <= v143
f_314(v128, v129, v130, v131, 1, v134, v143, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_316(v128, v129, v130, v131, 1, v134, v143, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: TRUE
f_316(v128, v129, v130, v131, 1, v134, v143, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_318(v128, v129, v130, v131, 1, v134, v143, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: 0 = 0
f_318(v128, v129, v130, v131, 1, v134, v143, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_320(v128, v129, v130, v131, 1, v134, v143, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: 1 + v143 = v134
f_320(v128, v129, v130, v131, 1, v134, v143, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_322(v128, v129, v130, v131, 1, v134, v143, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: TRUE
f_322(v128, v129, v130, v131, 1, v134, v143, v135, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_324(v128, v129, v130, v131, 1, v134, v143, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: 0 = 0
f_324(v128, v129, v130, v131, 1, v134, v143, v136, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_326(v128, v129, v130, v131, 1, v134, v143, v136, v146, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: v146 = 1 + v136 && 2 <= v146
f_326(v128, v129, v130, v131, 1, v134, v143, v136, v146, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_328(v128, v129, v130, v131, 1, v134, v143, v136, v146, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: TRUE
f_328(v128, v129, v130, v131, 1, v134, v143, v136, v146, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_330(v128, v129, v130, v131, 1, v134, v143, v136, v146, v137, v138, v139, v140, v141, 0, 3, 2, 4) :|: TRUE
f_330(v128, v129, v130, v131, 1, v134, v143, v136, v146, v137, v138, v139, v140, v141, 0, 3, 2, 4) -> f_304(v128, v129, v130, v131, 1, v134, v143, v136, v146, v137, v138, v139, v140, v141, 0, 3, 4) :|: TRUE
f_304(v128, v129, v130, v131, 1, v133, v134, v135, v136, v137, v138, v139, v140, v141, 0, 3, 4) -> f_305(v128, v129, v130, v131, 1, v134, v133, v135, v136, v137, v138, v139, v140, v141, 0, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_305(v128:0, v129:0, v130:0, v131:0, 1, 1 + v143:0, v133:0, v135:0, v136:0, v137:0, v138:0, v139:0, v140:0, v141:0, 0, 3, 4) -> f_305(v128:0, v129:0, v130:0, v131:0, 1, v143:0, 1 + v143:0, v136:0, 1 + v136:0, v137:0, v138:0, v139:0, v140:0, v141:0, 0, 3, 4) :|: v133:0 > 1 && v143:0 > -1 && v128:0 > 1 && v136:0 > 0
Filtered unneeded arguments:
   f_305(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_305(x1, x6, x7, x9)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_305(v128:0, sum~cons_1~v143:0, v133:0, v136:0) -> f_305(v128:0, v143:0, 1 + v143:0, 1 + v136:0) :|: v143:0 > -1 && v133:0 > 1 && v136:0 > 0 && v128:0 > 1 && sum~cons_1~v143:0 = 1 + v143:0

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

(8)
Obligation:
Rules:
f_305(v128:0, sum~cons_1~v143:0, v133:0, v136:0) -> f_305(v128:0, v143:0, 1 + v143:0, 1 + v136:0) :|: v143:0 > -1 && v133:0 > 1 && v136:0 > 0 && v128:0 > 1 && sum~cons_1~v143:0 = 1 + v143:0

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

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

(10)
Obligation:
Rules:
f_305(v128:0:0, sum~cons_1~v143:0:0, v133:0:0, v136:0:0) -> f_305(v128:0:0, v143:0:0, 1 + v143:0:0, 1 + v136:0:0) :|: v136:0:0 > 0 && v128:0:0 > 1 && v133:0:0 > 1 && v143:0:0 > -1 && sum~cons_1~v143:0:0 = 1 + v143:0:0

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

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

The following rules are decreasing:
f_305(v128:0:0, sum~cons_1~v143:0:0, v133:0:0, v136:0:0) -> f_305(v128:0:0, v143:0:0, 1 + v143:0:0, 1 + v136:0:0) :|: v136:0:0 > 0 && v128:0:0 > 1 && v133:0:0 > 1 && v143:0:0 > -1 && sum~cons_1~v143:0:0 = 1 + v143:0:0
The following rules are bounded:
f_305(v128:0:0, sum~cons_1~v143:0:0, v133:0:0, v136:0:0) -> f_305(v128:0:0, v143:0:0, 1 + v143:0:0, 1 + v136:0:0) :|: v136:0:0 > 0 && v128:0:0 > 1 && v133:0:0 > 1 && v143:0:0 > -1 && sum~cons_1~v143:0:0 = 1 + v143:0:0

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

(12)
YES