/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, 178 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 693 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 70 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 11 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: true visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%x = alloca i32, align 4
		%y = alloca i32, align 4
		%old_y = alloca i32, align 4
		store 0, %1
		%2 = call i32 (...)* @__VERIFIER_nondet_int()
		store %2, %x
		%3 = call i32 (...)* @__VERIFIER_nondet_int()
		store %3, %y
		br %4
	4:
		%5 = load %x
		%6 = icmp sgt %5 0
		br %6, %7, %17
	7:
		%8 = load %y
		store %8, %x
		%9 = load %y
		store %9, %old_y
		%10 = call i32 (...)* @__VERIFIER_nondet_int()
		store %10, %y
		%11 = load %y
		%12 = load %old_y
		%13 = sub 0 %12
		%14 = icmp sgt %11 %13
		br %14, %15, %16
	15:
		br %17
	16:
		br %4
	17:
		ret 0


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 18 rulesP rules:
f_144(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_145(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 < v49 && 1 + v51 <= 0 && 1 + v50 <= 0
f_145(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_147(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0
f_147(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_149(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE
f_149(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_151(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0
f_151(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_152(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE
f_152(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_153(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0
f_153(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_154(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE
f_154(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_155(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE
f_155(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) -> f_156(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) :|: TRUE
f_156(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) -> f_157(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0
f_157(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) -> f_158(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0
f_158(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v51, 0, v53, v54, v55, v56, 3, 4) -> f_159(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: v67 + v50 = 0 && 1 <= v67
f_159(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_161(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: v65 <= v67
f_161(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_163(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0
f_163(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_165(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: TRUE
f_165(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_167(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: TRUE
f_167(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) -> f_143(v41, v42, v43, v44, v45, v46, v49, 1, v50, v65, v67, 0, v53, v54, v55, v56, 3, 4) :|: TRUE
f_143(v41, v42, v43, v44, v45, v46, v47, 1, v49, v50, v51, 0, v53, v54, v55, v56, 3, 4) -> f_144(v41, v42, v43, v44, v45, v46, v49, 1, v50, v51, 0, v53, v54, v55, v56, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_144(v41:0, v42:0, v43:0, v44:0, v45:0, v46:0, v49:0, 1, v50:0, v51:0, 0, v53:0, v54:0, v55:0, v56:0, 3, 4) -> f_144(v41:0, v42:0, v43:0, v44:0, v45:0, v46:0, v50:0, 1, v65:0, v67:0, 0, v53:0, v54:0, v55:0, v56:0, 3, 4) :|: v51:0 < 0 && v49:0 > 0 && v50:0 < 0 && v67:0 > 0 && v67:0 >= v65:0 && v67:0 + v50:0 = 0
Filtered unneeded arguments:
   f_144(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_144(x7, x9, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_144(v49:0, v50:0, v51:0) -> f_144(v50:0, v65:0, v67:0) :|: v49:0 > 0 && v51:0 < 0 && v50:0 < 0 && v67:0 > 0 && v67:0 + v50:0 = 0 && v67:0 >= v65:0

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

(8)
Obligation:
Rules:
f_144(v49:0, v50:0, v51:0) -> f_144(v50:0, v65:0, v67:0) :|: v49:0 > 0 && v51:0 < 0 && v50:0 < 0 && v67:0 > 0 && v67:0 + v50:0 = 0 && v67:0 >= v65:0

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

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

(10)
Obligation:
Rules:
f_144(v49:0:0, v50:0:0, v51:0:0) -> f_144(v50:0:0, v65:0:0, v67:0:0) :|: v67:0:0 + v50:0:0 = 0 && v67:0:0 >= v65:0:0 && v67:0:0 > 0 && v50:0:0 < 0 && v51:0:0 < 0 && v49:0:0 > 0

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

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

The following rules are decreasing:
f_144(v49:0:0, v50:0:0, v51:0:0) -> f_144(v50:0:0, v65:0:0, v67:0:0) :|: v67:0:0 + v50:0:0 = 0 && v67:0:0 >= v65:0:0 && v67:0:0 > 0 && v50:0:0 < 0 && v51:0:0 < 0 && v49:0:0 > 0
The following rules are bounded:
f_144(v49:0:0, v50:0:0, v51:0:0) -> f_144(v50:0:0, v65:0:0, v67:0:0) :|: v67:0:0 + v50:0:0 = 0 && v67:0:0 >= v65:0:0 && v67:0:0 > 0 && v50:0:0 < 0 && v51:0:0 < 0 && v49:0:0 > 0

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

(12)
YES