/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, 171 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 592 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) RankingReductionPairProof [EQUIVALENT, 17 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: "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
		%4 = load %y
		%5 = icmp slt %4 1
		br %5, %6, %7
	6:
		store 0, %1
		br %16
	7:
		br %8
	8:
		%9 = load %x
		%10 = icmp sge %9 0
		br %10, %11, %15
	11:
		%12 = load %x
		%13 = load %y
		%14 = sub %12 %13
		store %14, %x
		br %8
	15:
		store 0, %1
		br %16
	16:
		%17 = load %1
		ret %17


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 10 rulesP rules:
f_132(v18, v19, v20, v21, v22, 0, v26, 1, v24, v27, v28, v29, 3, 4) -> f_133(v18, v19, v20, v21, v22, 0, v26, 1, v24, v27, v28, v29, 3, 4) :|: 0 <= v26 && 1 <= v24
f_133(v18, v19, v20, v21, v22, 0, v26, 1, v24, v27, v28, v29, 3, 4) -> f_135(v18, v19, v20, v21, v22, 0, v26, 1, v24, v27, v28, v29, 3, 4) :|: 0 = 0
f_135(v18, v19, v20, v21, v22, 0, v26, 1, v24, v27, v28, v29, 3, 4) -> f_137(v18, v19, v20, v21, v22, 0, v26, 1, v24, v27, v28, v29, 3, 4) :|: TRUE
f_137(v18, v19, v20, v21, v22, 0, v26, 1, v24, v27, v28, v29, 3, 4) -> f_139(v18, v19, v20, v21, v22, 0, v26, 1, v27, v28, v29, 3, 4) :|: 0 = 0
f_139(v18, v19, v20, v21, v22, 0, v26, 1, v27, v28, v29, 3, 4) -> f_141(v18, v19, v20, v21, v22, 0, v26, 1, v27, v28, v29, 3, 4) :|: 0 = 0
f_141(v18, v19, v20, v21, v22, 0, v26, 1, v27, v28, v29, 3, 4) -> f_143(v18, v19, v20, v21, v22, 0, v26, 1, v33, v27, v28, v29, 3, 4) :|: v33 + v22 = v26
f_143(v18, v19, v20, v21, v22, 0, v26, 1, v33, v27, v28, v29, 3, 4) -> f_145(v18, v19, v20, v21, v22, 0, v26, 1, v33, v27, v28, v29, 3, 4) :|: TRUE
f_145(v18, v19, v20, v21, v22, 0, v26, 1, v33, v27, v28, v29, 3, 4) -> f_146(v18, v19, v20, v21, v22, 0, v26, 1, v33, v27, v28, v29, 3, 4) :|: TRUE
f_146(v18, v19, v20, v21, v22, 0, v26, 1, v33, v27, v28, v29, 3, 4) -> f_131(v18, v19, v20, v21, v22, 0, v26, 1, v33, v27, v28, v29, 3, 4) :|: 1 <= v18 && 1 <= v19 && 1 <= v20 && 0 <= v21 && 1 <= v22 && 0 <= v26 && 4 <= v27 && 4 <= v28 && 4 <= v29 && v18 <= v27 && v19 <= v28 && v20 <= v29
f_131(v18, v19, v20, v21, v22, 0, v24, 1, v26, v27, v28, v29, 3, 4) -> f_132(v18, v19, v20, v21, v22, 0, v26, 1, v24, v27, v28, v29, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_132(v18:0, v19:0, v20:0, v21:0, v22:0, 0, v33:0 + v22:0, 1, v24:0, v27:0, v28:0, v29:0, 3, 4) -> f_132(v18:0, v19:0, v20:0, v21:0, v22:0, 0, v33:0, 1, v33:0 + v22:0, v27:0, v28:0, v29:0, 3, 4) :|: v19:0 > 0 && v18:0 > 0 && v20:0 > 0 && v21:0 > -1 && v22:0 > 0 && v24:0 > 0 && v33:0 + v22:0 > -1 && v27:0 > 3 && v28:0 > 3 && v29:0 > 3 && v27:0 >= v18:0 && v29:0 >= v20:0 && v28:0 >= v19:0
Filtered unneeded arguments:
   f_132(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_132(x1, x2, x3, x4, x5, x7, x9, x10, x11, x12)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_132(v18:0, v19:0, v20:0, v21:0, v22:0, sum~v33:0~v22:0, v24:0, v27:0, v28:0, v29:0) -> f_132(v18:0, v19:0, v20:0, v21:0, v22:0, v33:0, v33:0 + v22:0, v27:0, v28:0, v29:0) :|: v18:0 > 0 && v19:0 > 0 && v20:0 > 0 && v21:0 > -1 && v22:0 > 0 && v24:0 > 0 && v33:0 + v22:0 > -1 && v27:0 > 3 && v28:0 > 3 && v29:0 > 3 && v27:0 >= v18:0 && v28:0 >= v19:0 && v29:0 >= v20:0 && sum~v33:0~v22:0 = v33:0 + v22:0

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

(8)
Obligation:
Rules:
f_132(v18:0, v19:0, v20:0, v21:0, v22:0, sum~v33:0~v22:0, v24:0, v27:0, v28:0, v29:0) -> f_132(v18:0, v19:0, v20:0, v21:0, v22:0, v33:0, v33:0 + v22:0, v27:0, v28:0, v29:0) :|: v18:0 > 0 && v19:0 > 0 && v20:0 > 0 && v21:0 > -1 && v22:0 > 0 && v24:0 > 0 && v33:0 + v22:0 > -1 && v27:0 > 3 && v28:0 > 3 && v29:0 > 3 && v27:0 >= v18:0 && v28:0 >= v19:0 && v29:0 >= v20:0 && sum~v33:0~v22:0 = v33:0 + v22:0

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

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

(10)
Obligation:
Rules:
f_132(v18:0:0, v19:0:0, v20:0:0, v21:0:0, v22:0:0, sum~v33:0:0~v22:0:0, v24:0:0, v27:0:0, v28:0:0, v29:0:0) -> f_132(v18:0:0, v19:0:0, v20:0:0, v21:0:0, v22:0:0, v33:0:0, v33:0:0 + v22:0:0, v27:0:0, v28:0:0, v29:0:0) :|: v28:0:0 >= v19:0:0 && v29:0:0 >= v20:0:0 && v27:0:0 >= v18:0:0 && v29:0:0 > 3 && v28:0:0 > 3 && v27:0:0 > 3 && v33:0:0 + v22:0:0 > -1 && v24:0:0 > 0 && v22:0:0 > 0 && v21:0:0 > -1 && v20:0:0 > 0 && v19:0:0 > 0 && v18:0:0 > 0 && sum~v33:0:0~v22:0:0 = v33:0:0 + v22:0:0

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_132 ] = f_132_6

The following rules are decreasing:
f_132(v18:0:0, v19:0:0, v20:0:0, v21:0:0, v22:0:0, sum~v33:0:0~v22:0:0, v24:0:0, v27:0:0, v28:0:0, v29:0:0) -> f_132(v18:0:0, v19:0:0, v20:0:0, v21:0:0, v22:0:0, v33:0:0, v33:0:0 + v22:0:0, v27:0:0, v28:0:0, v29:0:0) :|: v28:0:0 >= v19:0:0 && v29:0:0 >= v20:0:0 && v27:0:0 >= v18:0:0 && v29:0:0 > 3 && v28:0:0 > 3 && v27:0:0 > 3 && v33:0:0 + v22:0:0 > -1 && v24:0:0 > 0 && v22:0:0 > 0 && v21:0:0 > -1 && v20:0:0 > 0 && v19:0:0 > 0 && v18:0:0 > 0 && sum~v33:0:0~v22:0:0 = v33:0:0 + v22:0:0

The following rules are bounded:
f_132(v18:0:0, v19:0:0, v20:0:0, v21:0:0, v22:0:0, sum~v33:0:0~v22:0:0, v24:0:0, v27:0:0, v28:0:0, v29:0:0) -> f_132(v18:0:0, v19:0:0, v20:0:0, v21:0:0, v22:0:0, v33:0:0, v33:0:0 + v22:0:0, v27:0:0, v28:0:0, v29:0:0) :|: v28:0:0 >= v19:0:0 && v29:0:0 >= v20:0:0 && v27:0:0 >= v18:0:0 && v29:0:0 > 3 && v28:0:0 > 3 && v27:0:0 > 3 && v33:0:0 + v22:0:0 > -1 && v24:0:0 > 0 && v22:0:0 > 0 && v21:0:0 > -1 && v20:0:0 > 0 && v19:0:0 > 0 && v18:0:0 > 0 && sum~v33:0:0~v22:0:0 = v33:0:0 + v22:0:0


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

(12)
YES