/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, 176 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 806 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 35 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: 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
		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, %11
	7:
		%8 = load %x
		%9 = load %y
		%10 = icmp slt %8 %9
		br %11
	11:
		%12 = phi [0, %4], [%10, %7]
		br %12, %13, %18
	13:
		%14 = load %x
		%15 = mul 2 %14
		store %15, %x
		%16 = load %y
		%17 = add %16 1
		store %17, %y
		br %4
	18:
		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 17 rulesP rules:
f_158(v126, v127, v128, v129, v130, v134, 1, v131, v133, v135, v136, v137, v138, 0, 3, 2, 4) -> f_159(v126, v127, v128, v129, v130, v134, 1, v131, v133, v135, v136, v137, v138, 0, 3, 2, 4) :|: 0 = 0
f_159(v126, v127, v128, v129, v130, v134, 1, v131, v133, v135, v136, v137, v138, 0, 3, 2, 4) -> f_160(v126, v127, v128, v129, v130, v134, 1, v131, v133, v135, v136, v137, v138, 0, 3, 2, 4) :|: TRUE
f_160(v126, v127, v128, v129, v130, v134, 1, v131, v133, v135, v136, v137, v138, 0, 3, 2, 4) -> f_161(v126, v127, v128, v129, v130, v134, 1, v133, v131, v135, v136, v137, v138, 0, 3, 2, 4) :|: 0 = 0
f_161(v126, v127, v128, v129, v130, v134, 1, v133, v131, v135, v136, v137, v138, 0, 3, 2, 4) -> f_162(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) :|: 0 = 0
f_162(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) -> f_163(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) :|: v134 < v135
f_163(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) -> f_165(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) :|: 0 = 0
f_165(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) -> f_167(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) :|: 0 = 0
f_167(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) -> f_169(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) :|: TRUE
f_169(v126, v127, v128, v129, v130, v134, 1, v135, v131, v133, v136, v137, v138, 0, 3, 2, 4) -> f_171(v126, v127, v128, v129, v130, v134, 1, v135, v133, v136, v137, v138, 0, 3, 2, 4) :|: 0 = 0
f_171(v126, v127, v128, v129, v130, v134, 1, v135, v133, v136, v137, v138, 0, 3, 2, 4) -> f_172(v126, v127, v128, v129, v130, v134, 1, v135, v178, v133, v136, v137, v138, 0, 3, 2, 4) :|: v178 = 2 * v134 && 4 <= v178
f_172(v126, v127, v128, v129, v130, v134, 1, v135, v178, v133, v136, v137, v138, 0, 3, 2, 4) -> f_173(v126, v127, v128, v129, v130, v134, 1, v135, v178, v133, v136, v137, v138, 0, 3, 2, 4) :|: TRUE
f_173(v126, v127, v128, v129, v130, v134, 1, v135, v178, v133, v136, v137, v138, 0, 3, 2, 4) -> f_174(v126, v127, v128, v129, v130, v134, 1, v135, v178, v136, v137, v138, 0, 3, 2, 4) :|: 0 = 0
f_174(v126, v127, v128, v129, v130, v134, 1, v135, v178, v136, v137, v138, 0, 3, 2, 4) -> f_175(v126, v127, v128, v129, v130, v134, 1, v135, v178, v180, v136, v137, v138, 0, 3, 2, 4) :|: v180 = 1 + v135 && 4 <= v180
f_175(v126, v127, v128, v129, v130, v134, 1, v135, v178, v180, v136, v137, v138, 0, 3, 2, 4) -> f_176(v126, v127, v128, v129, v130, v134, 1, v135, v178, v180, v136, v137, v138, 0, 3, 2, 4) :|: TRUE
f_176(v126, v127, v128, v129, v130, v134, 1, v135, v178, v180, v136, v137, v138, 0, 3, 2, 4) -> f_177(v126, v127, v128, v129, v130, v134, 1, v135, v178, v180, v136, v137, v138, 0, 3, 2, 4) :|: TRUE
f_177(v126, v127, v128, v129, v130, v134, 1, v135, v178, v180, v136, v137, v138, 0, 3, 2, 4) -> f_157(v126, v127, v128, v129, v130, v134, 1, v135, v178, v180, v136, v137, v138, 0, 3, 2, 4) :|: TRUE
f_157(v126, v127, v128, v129, v130, v131, 1, v133, v134, v135, v136, v137, v138, 0, 3, 2, 4) -> f_158(v126, v127, v128, v129, v130, v134, 1, v131, v133, v135, v136, v137, v138, 0, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_158(v126:0, v127:0, v128:0, v129:0, v130:0, v134:0, 1, v131:0, v133:0, v135:0, v136:0, v137:0, v138:0, 0, 3, 2, 4) -> f_158(v126:0, v127:0, v128:0, v129:0, v130:0, 2 * v134:0, 1, v134:0, v135:0, 1 + v135:0, v136:0, v137:0, v138:0, 0, 3, 2, 4) :|: v135:0 > v134:0 && v135:0 > 2 && 3 < 2 * v134:0
Filtered unneeded arguments:
   f_158(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_158(x6, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_158(v134:0, v135:0) -> f_158(2 * v134:0, 1 + v135:0) :|: v135:0 > 2 && 3 < 2 * v134:0 && v135:0 > v134:0

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

(8)
Obligation:
Rules:
f_158(v134:0, v135:0) -> f_158(2 * v134:0, 1 + v135:0) :|: v135:0 > 2 && 3 < 2 * v134:0 && v135:0 > v134:0

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

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

(10)
Obligation:
Rules:
f_158(v134:0:0, v135:0:0) -> f_158(2 * v134:0:0, 1 + v135:0:0) :|: v135:0:0 > 2 && 3 < 2 * v134:0:0 && v135:0:0 > v134:0:0

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

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

The following rules are decreasing:
f_158(v134:0:0, v135:0:0) -> f_158(2 * v134:0:0, 1 + v135:0:0) :|: v135:0:0 > 2 && 3 < 2 * v134:0:0 && v135:0:0 > v134:0:0
The following rules are bounded:
f_158(v134:0:0, v135:0:0) -> f_158(2 * v134:0:0, 1 + v135:0:0) :|: v135:0:0 > 2 && 3 < 2 * v134:0:0 && v135:0:0 > v134:0:0

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

(12)
YES