/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, 80 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 1518 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 51 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [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: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%i = alloca *i32, align 8
		%c = alloca *i32, align 8
		store 0, %1
		%2 = alloca i8, numElementsLit: 4
		%3 = bitcast *i8 %2 to *i32
		store %3, %i
		%4 = alloca i8, numElementsLit: 4
		%5 = bitcast *i8 %4 to *i32
		store %5, %c
		%6 = load %i
		store 0, %6
		%7 = load %c
		store 0, %7
		br %8
	8:
		%9 = load %i
		%10 = load %9
		%11 = icmp sgt %10 10
		br %11, %12, %13
	12:
		br %20
	13:
		%14 = load %i
		%15 = load %14
		%16 = add %15 1
		store %16, %14
		%17 = load %c
		%18 = load %17
		%19 = add %18 1
		store %19, %17
		br %8
	20:
		%21 = load %c
		%22 = load %21
		ret %22


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 15 rulesP rules:
f_232(v93, v94, v95, v96, v97, v98, 0, v100, v101, v102, v103, v104, v105, 3, 7, 1, 4, 8) -> f_233(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 4, 8) :|: 0 = 0
f_233(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 4, 8) -> f_235(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) :|: v100 <= 10 && v98 <= 9
f_235(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) -> f_237(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) :|: 0 = 0
f_237(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) -> f_239(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) :|: TRUE
f_239(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) -> f_241(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) :|: 0 = 0
f_241(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) -> f_243(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) :|: 0 = 0
f_243(v93, v94, v95, v96, v97, v100, 0, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8) -> f_245(v93, v94, v95, v96, v97, v100, 0, v106, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8, 2, 11) :|: v106 = 1 + v100 && 2 <= v106 && v106 <= 11
f_245(v93, v94, v95, v96, v97, v100, 0, v106, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8, 2, 11) -> f_246(v93, v94, v95, v96, v97, v100, 0, v106, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8, 2, 11) :|: TRUE
f_246(v93, v94, v95, v96, v97, v100, 0, v106, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8, 2, 11) -> f_247(v93, v94, v95, v96, v97, v100, 0, v106, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8, 2, 11) :|: 0 = 0
f_247(v93, v94, v95, v96, v97, v100, 0, v106, v98, v101, v102, v103, v104, v105, 3, 7, 1, 9, 10, 4, 8, 2, 11) -> f_248(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 10, 4, 8, 2, 11) :|: 0 = 0
f_248(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 10, 4, 8, 2, 11) -> f_249(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 10, 4, 8, 2, 11) :|: v106 = 1 + v100
f_249(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 10, 4, 8, 2, 11) -> f_250(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 10, 4, 8, 2, 11) :|: TRUE
f_250(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 10, 4, 8, 2, 11) -> f_251(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 10, 4, 8, 2, 11) :|: TRUE
f_251(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 10, 4, 8, 2, 11) -> f_231(v93, v94, v95, v96, v97, v100, 0, v106, v101, v102, v103, v104, v105, 3, 7, 1, 4, 8) :|: TRUE
f_231(v93, v94, v95, v96, v97, v98, 0, v100, v101, v102, v103, v104, v105, 3, 7, 1, 4, 8) -> f_232(v93, v94, v95, v96, v97, v98, 0, v100, v101, v102, v103, v104, v105, 3, 7, 1, 4, 8) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_232(v93:0, v94:0, v95:0, v96:0, v97:0, v98:0, 0, v100:0, v101:0, v102:0, v103:0, v104:0, v105:0, 3, 7, 1, 4, 8) -> f_232(v93:0, v94:0, v95:0, v96:0, v97:0, v100:0, 0, 1 + v100:0, v101:0, v102:0, v103:0, v104:0, v105:0, 3, 7, 1, 4, 8) :|: v98:0 < 10 && v100:0 < 11 && v100:0 > 0
Filtered unneeded arguments:
   f_232(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_232(x6, x8)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_232(v98:0, v100:0) -> f_232(v100:0, 1 + v100:0) :|: v100:0 < 11 && v100:0 > 0 && v98:0 < 10

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

(8)
Obligation:
Rules:
f_232(v98:0, v100:0) -> f_232(v100:0, 1 + v100:0) :|: v100:0 < 11 && v100:0 > 0 && v98:0 < 10

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

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

(10)
Obligation:
Rules:
f_232(v98:0:0, v100:0:0) -> f_232(v100:0:0, 1 + v100:0:0) :|: v100:0:0 < 11 && v100:0:0 > 0 && v98:0:0 < 10

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_232 ] = -1*f_232_2

The following rules are decreasing:
f_232(v98:0:0, v100:0:0) -> f_232(v100:0:0, 1 + v100:0:0) :|: v100:0:0 < 11 && v100:0:0 > 0 && v98:0:0 < 10

The following rules are bounded:
f_232(v98:0:0, v100:0:0) -> f_232(v100:0:0, 1 + v100:0:0) :|: v100:0:0 < 11 && v100:0:0 > 0 && v98:0:0 < 10


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

(12)
YES