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

*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
		%z = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %x
		%3 = load %x
		%4 = icmp slt %3 0
		br %4, %5, %6
	5:
		store 0, %1
		br %15
	6:
		%7 = call i32 @__VERIFIER_nondet_int()
		store %7, %y
		%8 = load %y
		%9 = icmp slt %8 0
		br %9, %10, %11
	10:
		store 0, %1
		br %15
	11:
		%12 = call i32 @__VERIFIER_nondet_int()
		store %12, %z
		%13 = load %x
		%14 = call i32 @fact(i32 %13)
		br %15
	15:
		%16 = load %1
		ret %16


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 13 rulesP rules:
f_220(v85, v98, v86, v87, v88, v89, v90, v91, v92, v93, v99, 0, v95, v96, v97, 3, 1, 4) -> f_222(v85, v98, v106, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, 0, v95, v96, v97, 3, 1, 4) :|: 1 <= v106 && v107 = 3 + v106 && 4 <= v107
f_222(v85, v98, v106, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, 0, v95, v96, v97, 3, 1, 4) -> f_223(v85, v98, v106, v108, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 1, 4) :|: 1 <= v108 && v109 = 3 + v108 && 4 <= v109
f_223(v85, v98, v106, v108, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 1, 4) -> f_224(v85, v98, v106, v108, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 1, 4) :|: TRUE
f_224(v85, v98, v106, v108, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 1, 4) -> f_225(v85, v98, v106, v108, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 1, 4) :|: 0 = 0
f_225(v85, v98, v106, v108, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 1, 4) -> f_226(v85, v98, v106, v108, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 1, 4) :|: 1 < v85 && 2 <= v95
f_226(v85, v98, v106, v108, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 1, 4) -> f_228(v85, v98, v106, v108, 1, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 4) :|: 0 = 0
f_228(v85, v98, v106, v108, 1, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 4) -> f_230(v85, v98, v106, v108, 1, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 4) :|: TRUE
f_230(v85, v98, v106, v108, 1, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 4) -> f_232(v85, v98, v106, v108, 1, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 4) :|: 0 = 0
f_232(v85, v98, v106, v108, 1, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 4) -> f_234(v85, v98, v106, v108, 1, v111, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 4) :|: 1 + v111 = v85 && 1 <= v111
f_234(v85, v98, v106, v108, 1, v111, v86, v87, v88, v89, v90, v91, v92, v93, v99, v107, v109, 0, v95, v96, v97, 3, 2, 4) -> f_236(v111, v86, v87, v88, v89, v90, v91, v92, v93, v98, v99, v106, v107, v108, v109, 0, v95, v96, v97, v85, 1, 3, 2, 4) :|: 0 = 0
f_236(v111, v86, v87, v88, v89, v90, v91, v92, v93, v98, v99, v106, v107, v108, v109, 0, v95, v96, v97, v85, 1, 3, 2, 4) -> f_238(v111, v86, v87, v88, v89, v90, v91, v92, v93, v98, v99, v106, v107, v108, v109, 0, v95, v96, v97, v85, 3, 1, 2, 4) :|: TRUE
f_238(v111, v86, v87, v88, v89, v90, v91, v92, v93, v98, v99, v106, v107, v108, v109, 0, v95, v96, v97, v85, 3, 1, 2, 4) -> f_218(v111, v86, v87, v88, v89, v90, v91, v92, v93, 0, v95, v96, v97, 3, 1, 4) :|: TRUE
f_218(v85, v86, v87, v88, v89, v90, v91, v92, v93, 0, v95, v96, v97, 3, 1, 4) -> f_220(v85, v98, v86, v87, v88, v89, v90, v91, v92, v93, v99, 0, v95, v96, v97, 3, 1, 4) :|: 1 <= v98 && v99 = 3 + v98 && 4 <= v99
Combined rules. Obtained 1 rulesP rules:
f_220(1 + v111:0, v98:0, v86:0, v87:0, v88:0, v89:0, v90:0, v91:0, v92:0, v93:0, v99:0, 0, v95:0, v96:0, v97:0, 3, 1, 4) -> f_220(v111:0, v98:1, v86:0, v87:0, v88:0, v89:0, v90:0, v91:0, v92:0, v93:0, 3 + v98:1, 0, v95:0, v96:0, v97:0, 3, 1, 4) :|: v108:0 > 0 && v106:0 > 0 && v95:0 > 1 && v111:0 > 0 && v98:1 > 0
Filtered unneeded arguments:
   f_220(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_220(x1, x13)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_220(sum~cons_1~v111:0, v95:0) -> f_220(v111:0, v95:0) :|: v95:0 > 1 && v111:0 > 0 && sum~cons_1~v111:0 = 1 + v111:0

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

(8)
Obligation:
Rules:
f_220(sum~cons_1~v111:0, v95:0) -> f_220(v111:0, v95:0) :|: v95:0 > 1 && v111:0 > 0 && sum~cons_1~v111:0 = 1 + v111:0

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

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

(10)
Obligation:
Rules:
f_220(sum~cons_1~v111:0:0, v95:0:0) -> f_220(v111:0:0, v95:0:0) :|: v95:0:0 > 1 && v111:0:0 > 0 && sum~cons_1~v111:0:0 = 1 + v111:0:0

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

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_220(x, x1)] = x

The following rules are decreasing:
f_220(sum~cons_1~v111:0:0, v95:0:0) -> f_220(v111:0:0, v95:0:0) :|: v95:0:0 > 1 && v111:0:0 > 0 && sum~cons_1~v111:0:0 = 1 + v111:0:0
The following rules are bounded:
f_220(sum~cons_1~v111:0:0, v95:0:0) -> f_220(v111:0:0, v95:0:0) :|: v95:0:0 > 1 && v111:0:0 > 0 && sum~cons_1~v111:0:0 = 1 + v111:0:0

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

(12)
YES