/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, 892 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 0 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 0 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
		%3 = alloca i32, align 4
		store %x, %2
		store %y, %3
		%4 = load %2
		%5 = icmp sle %4 0
		br %5, %6, %8
	6:
		%7 = load %3
		store %7, %1
		br %24
	8:
		br %9
	9:
		%10 = load %2
		%11 = load %3
		%12 = icmp sgt %10 %11
		br %12, %13, %22
	13:
		%14 = load %2
		%15 = icmp sle %14 0
		br %15, %16, %18
	16:
		%17 = load %3
		store %17, %1
		br %24
	18:
		%19 = load %3
		%20 = load %2
		%21 = add %19 %20
		store %21, %3
		br %9
	22:
		%23 = load %3
		store %23, %1
		br %24
	24:
		%25 = load %1
		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 14 rulesP rules:
f_207(v39, v40, v41, v42, v43, 0, v45, 1, v47, v48, v49, v50, v51, v52, 3, 4) -> f_208(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) :|: 0 = 0
f_208(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) -> f_209(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) :|: v47 < v39 && 1 + v45 <= 0
f_209(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) -> f_211(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) :|: 0 = 0
f_211(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) -> f_213(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) :|: TRUE
f_213(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) -> f_215(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) :|: 0 = 0
f_215(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) -> f_217(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) :|: 0 = 0
f_217(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) -> f_219(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) :|: TRUE
f_219(v39, v40, v41, v42, v43, 0, v47, 1, v45, v48, v49, v50, v51, v52, 3, 4) -> f_221(v39, v40, v41, v42, v43, 0, v47, 1, v48, v49, v50, v51, v52, 3, 4) :|: 0 = 0
f_221(v39, v40, v41, v42, v43, 0, v47, 1, v48, v49, v50, v51, v52, 3, 4) -> f_223(v39, v40, v41, v42, v43, 0, v47, 1, v48, v49, v50, v51, v52, 3, 4) :|: 0 = 0
f_223(v39, v40, v41, v42, v43, 0, v47, 1, v48, v49, v50, v51, v52, 3, 4) -> f_225(v39, v40, v41, v42, v43, 0, v47, 1, v55, v48, v49, v50, v51, v52, 3, 4) :|: v55 = v47 + v39
f_225(v39, v40, v41, v42, v43, 0, v47, 1, v55, v48, v49, v50, v51, v52, 3, 4) -> f_226(v39, v40, v41, v42, v43, 0, v47, 1, v55, v48, v49, v50, v51, v52, 3, 4) :|: TRUE
f_226(v39, v40, v41, v42, v43, 0, v47, 1, v55, v48, v49, v50, v51, v52, 3, 4) -> f_227(v39, v40, v41, v42, v43, 0, v47, 1, v55, v48, v49, v50, v51, v52, 3, 4) :|: TRUE
f_227(v39, v40, v41, v42, v43, 0, v47, 1, v55, v48, v49, v50, v51, v52, 3, 4) -> f_206(v39, v40, v41, v42, v43, 0, v47, 1, v55, v48, v49, v50, v51, v52, 3, 4) :|: v40 < v39 && 1 <= v39 && 1 <= v41 && 1 <= v42 && 1 <= v43 && 1 <= v48 && 4 <= v49 && 4 <= v50 && 4 <= v51 && 4 <= v52 && v48 <= v49 && v41 <= v50 && v42 <= v51 && v43 <= v52
f_206(v39, v40, v41, v42, v43, 0, v45, 1, v47, v48, v49, v50, v51, v52, 3, 4) -> f_207(v39, v40, v41, v42, v43, 0, v45, 1, v47, v48, v49, v50, v51, v52, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_207(v39:0, v40:0, v41:0, v42:0, v43:0, 0, v45:0, 1, v47:0, v48:0, v49:0, v50:0, v51:0, v52:0, 3, 4) -> f_207(v39:0, v40:0, v41:0, v42:0, v43:0, 0, v47:0, 1, v47:0 + v39:0, v48:0, v49:0, v50:0, v51:0, v52:0, 3, 4) :|: v39:0 > 0 && v40:0 < v39:0 && v41:0 > 0 && v45:0 < 0 && v47:0 < v39:0 && v42:0 > 0 && v43:0 > 0 && v48:0 > 0 && v49:0 > 3 && v50:0 > 3 && v51:0 > 3 && v52:0 > 3 && v49:0 >= v48:0 && v50:0 >= v41:0 && v52:0 >= v43:0 && v51:0 >= v42:0
Filtered unneeded arguments:
   f_207(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_207(x1, x2, x3, x4, x5, x7, x9, x10, x11, x12, x13, x14)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_207(v39:0, v40:0, v41:0, v42:0, v43:0, v45:0, v47:0, v48:0, v49:0, v50:0, v51:0, v52:0) -> f_207(v39:0, v40:0, v41:0, v42:0, v43:0, v47:0, v47:0 + v39:0, v48:0, v49:0, v50:0, v51:0, v52:0) :|: v40:0 < v39:0 && v39:0 > 0 && v41:0 > 0 && v45:0 < 0 && v47:0 < v39:0 && v42:0 > 0 && v43:0 > 0 && v48:0 > 0 && v49:0 > 3 && v50:0 > 3 && v51:0 > 3 && v52:0 > 3 && v49:0 >= v48:0 && v50:0 >= v41:0 && v51:0 >= v42:0 && v52:0 >= v43:0

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

(8)
Obligation:
Rules:
f_207(v39:0, v40:0, v41:0, v42:0, v43:0, v45:0, v47:0, v48:0, v49:0, v50:0, v51:0, v52:0) -> f_207(v39:0, v40:0, v41:0, v42:0, v43:0, v47:0, v47:0 + v39:0, v48:0, v49:0, v50:0, v51:0, v52:0) :|: v40:0 < v39:0 && v39:0 > 0 && v41:0 > 0 && v45:0 < 0 && v47:0 < v39:0 && v42:0 > 0 && v43:0 > 0 && v48:0 > 0 && v49:0 > 3 && v50:0 > 3 && v51:0 > 3 && v52:0 > 3 && v49:0 >= v48:0 && v50:0 >= v41:0 && v51:0 >= v42:0 && v52:0 >= v43:0

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

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

(10)
Obligation:
Rules:
f_207(v39:0:0, v40:0:0, v41:0:0, v42:0:0, v43:0:0, v45:0:0, v47:0:0, v48:0:0, v49:0:0, v50:0:0, v51:0:0, v52:0:0) -> f_207(v39:0:0, v40:0:0, v41:0:0, v42:0:0, v43:0:0, v47:0:0, v47:0:0 + v39:0:0, v48:0:0, v49:0:0, v50:0:0, v51:0:0, v52:0:0) :|: v51:0:0 >= v42:0:0 && v52:0:0 >= v43:0:0 && v50:0:0 >= v41:0:0 && v49:0:0 >= v48:0:0 && v52:0:0 > 3 && v51:0:0 > 3 && v50:0:0 > 3 && v49:0:0 > 3 && v48:0:0 > 0 && v43:0:0 > 0 && v42:0:0 > 0 && v47:0:0 < v39:0:0 && v45:0:0 < 0 && v41:0:0 > 0 && v39:0:0 > 0 && v40:0:0 < v39:0:0

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

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_207(x, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)] = x - x6

The following rules are decreasing:
f_207(v39:0:0, v40:0:0, v41:0:0, v42:0:0, v43:0:0, v45:0:0, v47:0:0, v48:0:0, v49:0:0, v50:0:0, v51:0:0, v52:0:0) -> f_207(v39:0:0, v40:0:0, v41:0:0, v42:0:0, v43:0:0, v47:0:0, v47:0:0 + v39:0:0, v48:0:0, v49:0:0, v50:0:0, v51:0:0, v52:0:0) :|: v51:0:0 >= v42:0:0 && v52:0:0 >= v43:0:0 && v50:0:0 >= v41:0:0 && v49:0:0 >= v48:0:0 && v52:0:0 > 3 && v51:0:0 > 3 && v50:0:0 > 3 && v49:0:0 > 3 && v48:0:0 > 0 && v43:0:0 > 0 && v42:0:0 > 0 && v47:0:0 < v39:0:0 && v45:0:0 < 0 && v41:0:0 > 0 && v39:0:0 > 0 && v40:0:0 < v39:0:0
The following rules are bounded:
f_207(v39:0:0, v40:0:0, v41:0:0, v42:0:0, v43:0:0, v45:0:0, v47:0:0, v48:0:0, v49:0:0, v50:0:0, v51:0:0, v52:0:0) -> f_207(v39:0:0, v40:0:0, v41:0:0, v42:0:0, v43:0:0, v47:0:0, v47:0:0 + v39:0:0, v48:0:0, v49:0:0, v50:0:0, v51:0:0, v52:0:0) :|: v51:0:0 >= v42:0:0 && v52:0:0 >= v43:0:0 && v50:0:0 >= v41:0:0 && v49:0:0 >= v48:0:0 && v52:0:0 > 3 && v51:0:0 > 3 && v50:0:0 > 3 && v49:0:0 > 3 && v48:0:0 > 0 && v43:0:0 > 0 && v42:0:0 > 0 && v47:0:0 < v39:0:0 && v45:0:0 < 0 && v41:0:0 > 0 && v39:0:0 > 0 && v40:0:0 < v39:0:0

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

(12)
YES