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

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


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_330(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_331(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: 0 = 0
f_331(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_332(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: v196 < v203
f_332(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_334(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: 0 = 0
f_334(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_336(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: TRUE
f_336(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_338(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: 0 = 0
f_338(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_340(v195, v196, v197, v198, v199, v200, 1, v203, v213, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: 1 + v213 = v203
f_340(v195, v196, v197, v198, v199, v200, 1, v203, v213, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_342(v195, v196, v197, v198, v199, v200, 1, v203, v213, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: TRUE
f_342(v195, v196, v197, v198, v199, v200, 1, v203, v213, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_344(v195, v196, v197, v198, v199, v200, 1, v203, v213, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: 0 = 0
f_344(v195, v196, v197, v198, v199, v200, 1, v203, v213, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_346(v195, v196, v197, v198, v199, v200, 1, v203, v213, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: 1 + v213 = v203
f_346(v195, v196, v197, v198, v199, v200, 1, v203, v213, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_348(v195, v196, v197, v198, v199, v200, 1, v203, v213, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: TRUE
f_348(v195, v196, v197, v198, v199, v200, 1, v203, v213, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_350(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: 0 = 0
f_350(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_352(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v216, v206, v207, v208, v209, v210, v211, 0, 3, 4, 2) :|: v216 = 1 + v205 && 2 <= v216
f_352(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v216, v206, v207, v208, v209, v210, v211, 0, 3, 4, 2) -> f_354(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v216, v206, v207, v208, v209, v210, v211, 0, 3, 4, 2) :|: TRUE
f_354(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v216, v206, v207, v208, v209, v210, v211, 0, 3, 4, 2) -> f_356(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v216, v206, v207, v208, v209, v210, v211, 0, 3, 4, 2) :|: TRUE
f_356(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v216, v206, v207, v208, v209, v210, v211, 0, 3, 4, 2) -> f_329(v195, v196, v197, v198, v199, v200, 1, v203, v213, v205, v216, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: TRUE
f_329(v195, v196, v197, v198, v199, v200, 1, v202, v203, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) -> f_330(v195, v196, v197, v198, v199, v200, 1, v203, v202, v204, v205, v206, v207, v208, v209, v210, v211, 0, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_330(v195:0, v196:0, v197:0, v198:0, v199:0, v200:0, 1, 1 + v213:0, v202:0, v204:0, v205:0, v206:0, v207:0, v208:0, v209:0, v210:0, v211:0, 0, 3, 4) -> f_330(v195:0, v196:0, v197:0, v198:0, v199:0, v200:0, 1, v213:0, 1 + v213:0, v205:0, 1 + v205:0, v206:0, v207:0, v208:0, v209:0, v210:0, v211:0, 0, 3, 4) :|: v205:0 > 0 && v196:0 < 1 + v213:0
Filtered unneeded arguments:
   f_330(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20) -> f_330(x2, x8, x11)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_330(v196:0, sum~cons_1~v213:0, v205:0) -> f_330(v196:0, v213:0, 1 + v205:0) :|: v205:0 > 0 && v196:0 < 1 + v213:0 && sum~cons_1~v213:0 = 1 + v213:0

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

(8)
Obligation:
Rules:
f_330(v196:0, sum~cons_1~v213:0, v205:0) -> f_330(v196:0, v213:0, 1 + v205:0) :|: v205:0 > 0 && v196:0 < 1 + v213:0 && sum~cons_1~v213:0 = 1 + v213:0

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

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

(10)
Obligation:
Rules:
f_330(v196:0:0, sum~cons_1~v213:0:0, v205:0:0) -> f_330(v196:0:0, v213:0:0, 1 + v205:0:0) :|: v205:0:0 > 0 && v196:0:0 < 1 + v213:0:0 && sum~cons_1~v213:0:0 = 1 + v213:0:0

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

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

The following rules are decreasing:
f_330(v196:0:0, sum~cons_1~v213:0:0, v205:0:0) -> f_330(v196:0:0, v213:0:0, 1 + v205:0:0) :|: v205:0:0 > 0 && v196:0:0 < 1 + v213:0:0 && sum~cons_1~v213:0:0 = 1 + v213:0:0
The following rules are bounded:
f_330(v196:0:0, sum~cons_1~v213:0:0, v205:0:0) -> f_330(v196:0:0, v213:0:0, 1 + v205:0:0) :|: v205:0:0 > 0 && v196:0:0 < 1 + v213:0:0 && sum~cons_1~v213:0:0 = 1 + v213:0:0

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

(12)
YES