/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, 177 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 1652 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 61 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 9 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_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 = icmp sgt %4 1
		br %5, %6, %10
	6:
		%7 = load %1
		%8 = load %2
		%9 = icmp slt %7 %8
		br %10
	10:
		%11 = phi [0, %3], [%9, %6]
		br %11, %12, %18
	12:
		%13 = load %1
		%14 = load %1
		%15 = mul %13 %14
		store %15, %1
		%16 = load %c
		%17 = add %16 1
		store %17, %c
		br %3
	18:
		%19 = load %c
		ret %19

*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 19 rulesP rules:
f_298(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_299(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 1 < v449
f_299(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_301(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
f_301(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_303(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: TRUE
f_303(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_305(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
f_305(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_307(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
f_307(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_309(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: v449 < v443
f_309(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_312(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
f_312(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_314(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
f_314(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_316(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: TRUE
f_316(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_318(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
f_318(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_320(v442, v443, v444, v445, v446, v449, 1, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
f_320(v442, v443, v444, v445, v446, v449, 1, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_322(v442, v443, v444, v445, v446, v449, 1, v525, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: v525 = v449 * v449
f_322(v442, v443, v444, v445, v446, v449, 1, v525, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_323(v442, v443, v444, v445, v446, v449, 1, v525, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: TRUE
f_323(v442, v443, v444, v445, v446, v449, 1, v525, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_324(v442, v443, v444, v445, v446, v449, 1, v525, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
f_324(v442, v443, v444, v445, v446, v449, 1, v525, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_325(v442, v443, v444, v445, v446, v449, 1, v525, v451, v527, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: v527 = 1 + v451 && 2 <= v527
f_325(v442, v443, v444, v445, v446, v449, 1, v525, v451, v527, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_326(v442, v443, v444, v445, v446, v449, 1, v525, v451, v527, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: TRUE
f_326(v442, v443, v444, v445, v446, v449, 1, v525, v451, v527, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_327(v442, v443, v444, v445, v446, v449, 1, v525, v451, v527, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: TRUE
f_327(v442, v443, v444, v445, v446, v449, 1, v525, v451, v527, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_297(v442, v443, v444, v445, v446, v449, 1, v525, v451, v527, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: TRUE
f_297(v442, v443, v444, v445, v446, v447, 1, v449, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) -> f_298(v442, v443, v444, v445, v446, v449, 1, v447, v450, v451, v452, v453, v454, v455, v456, 0, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_298(v442:0, v443:0, v444:0, v445:0, v446:0, v449:0, 1, v447:0, v450:0, v451:0, v452:0, v453:0, v454:0, v455:0, v456:0, 0, 3, 2, 4) -> f_298(v442:0, v443:0, v444:0, v445:0, v446:0, v449:0 * v449:0, 1, v449:0, v451:0, 1 + v451:0, v452:0, v453:0, v454:0, v455:0, v456:0, 0, 3, 2, 4) :|: v449:0 > 1 && v451:0 > 0 && v449:0 < v443:0
Filtered unneeded arguments:
   f_298(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19) -> f_298(x2, x6, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_298(v443:0, v449:0, v451:0) -> f_298(v443:0, v449:0 * v449:0, 1 + v451:0) :|: v451:0 > 0 && v449:0 < v443:0 && v449:0 > 1

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

(8)
Obligation:
Rules:
f_298(v443:0, v449:0, v451:0) -> f_298(v443:0, v449:0 * v449:0, 1 + v451:0) :|: v451:0 > 0 && v449:0 < v443:0 && v449:0 > 1

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

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

(10)
Obligation:
Rules:
f_298(v443:0:0, v449:0:0, v451:0:0) -> f_298(v443:0:0, v449:0:0 * v449:0:0, 1 + v451:0:0) :|: v451:0:0 > 0 && v449:0:0 < v443:0:0 && v449:0:0 > 1

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

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

The following rules are decreasing:
f_298(v443:0:0, v449:0:0, v451:0:0) -> f_298(v443:0:0, v449:0:0 * v449:0:0, 1 + v451:0:0) :|: v451:0:0 > 0 && v449:0:0 < v443:0:0 && v449:0:0 > 1
The following rules are bounded:
f_298(v443:0:0, v449:0:0, v451:0:0) -> f_298(v443:0:0, v449:0:0 * v449:0:0, 1 + v451:0:0) :|: v451:0:0 > 0 && v449:0:0 < v443:0:0 && v449:0:0 > 1

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

(12)
YES