/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, 179 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 2500 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) LLVM Symbolic Execution SCC
        (8) SCC2IRS [SOUND, 50 ms]
        (9) IntTRS
        (10) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (11) IntTRS
        (12) RankingReductionPairProof [EQUIVALENT, 27 ms]
        (13) YES
    (14) LLVM Symbolic Execution SCC
        (15) SCC2IRS [SOUND, 65 ms]
        (16) IntTRS
        (17) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (18) IntTRS
        (19) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (20) 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: "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 slt %10 20
		br %11, %12, %24
	12:
		%13 = load %i
		%14 = load %13
		%15 = add %14 1
		store %15, %13
		%16 = load %i
		%17 = load %16
		%18 = icmp sle %17 10
		br %18, %19, %20
	19:
		br %8
	20:
		%21 = load %c
		%22 = load %21
		%23 = add %22 1
		store %23, %21
		br %8
	24:
		%25 = load %c
		%26 = load %25
		ret %26


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 2 SCCs.
----------------------------------------

(6)
Complex Obligation (AND)

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

(7)
Obligation:
SCC
----------------------------------------

(8) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 19 rulesP rules:
f_383(v346, v347, v348, v349, v350, v351, 1, v353, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 19, 11, 20, 9, 4, 8) -> f_384(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 19, 11, 20, 9, 4, 8) :|: 0 = 0
f_384(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 19, 11, 20, 9, 4, 8) -> f_385(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 18, 11, 19, 8, 9, 4) :|: v353 < 20 && v351 <= 18 && v355 <= 8 && v356 <= 9
f_385(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 18, 11, 19, 8, 9, 4) -> f_387(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 18, 11, 19, 8, 9, 4) :|: 0 = 0
f_387(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 18, 11, 19, 8, 9, 4) -> f_389(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 18, 11, 19, 8, 9, 4) :|: TRUE
f_389(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 18, 11, 19, 8, 9, 4) -> f_391(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 18, 11, 19, 8, 9, 4) :|: 0 = 0
f_391(v346, v347, v348, v349, v350, v353, 1, v351, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 18, 11, 19, 8, 9, 4) -> f_393(v346, v347, v348, v349, v350, v353, 1, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4) :|: 0 = 0
f_393(v346, v347, v348, v349, v350, v353, 1, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4) -> f_395(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) :|: v367 = 1 + v353 && 12 <= v367 && v367 <= 20
f_395(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) -> f_396(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) :|: TRUE
f_396(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) -> f_397(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) :|: 0 = 0
f_397(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) -> f_398(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) :|: 0 = 0
f_398(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) -> f_399(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) :|: 0 = 0
f_399(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) -> f_400(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) :|: TRUE
f_400(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) -> f_401(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) :|: 0 = 0
f_401(v346, v347, v348, v349, v350, v353, 1, v367, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 11, 19, 8, 9, 4, 12, 20) -> f_402(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v357, v358, v359, v360, v361, 3, 7, 10, 11, 19, 9, 4, 8, 12, 20) :|: 0 = 0
f_402(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v357, v358, v359, v360, v361, 3, 7, 10, 11, 19, 9, 4, 8, 12, 20) -> f_403(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v374, v357, v358, v359, v360, v361, 3, 7, 10, 11, 19, 9, 4, 8, 12, 20, 2) :|: v374 = 1 + v356 && 2 <= v374 && v374 <= 10
f_403(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v374, v357, v358, v359, v360, v361, 3, 7, 10, 11, 19, 9, 4, 8, 12, 20, 2) -> f_404(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v374, v357, v358, v359, v360, v361, 3, 7, 10, 11, 19, 9, 4, 8, 12, 20, 2) :|: TRUE
f_404(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v374, v357, v358, v359, v360, v361, 3, 7, 10, 11, 19, 9, 4, 8, 12, 20, 2) -> f_405(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v374, v357, v358, v359, v360, v361, 3, 7, 10, 11, 19, 9, 4, 8, 12, 20, 2) :|: TRUE
f_405(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v374, v357, v358, v359, v360, v361, 3, 7, 10, 11, 19, 9, 4, 8, 12, 20, 2) -> f_382(v346, v347, v348, v349, v350, v353, 1, v367, 0, v356, v374, v357, v358, v359, v360, v361, 3, 7, 10, 19, 11, 20, 9, 4, 8) :|: TRUE
f_382(v346, v347, v348, v349, v350, v351, 1, v353, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 19, 11, 20, 9, 4, 8) -> f_383(v346, v347, v348, v349, v350, v351, 1, v353, 0, v355, v356, v357, v358, v359, v360, v361, 3, 7, 10, 19, 11, 20, 9, 4, 8) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_383(v346:0, v347:0, v348:0, v349:0, v350:0, v351:0, 1, v353:0, 0, v355:0, v356:0, v357:0, v358:0, v359:0, v360:0, v361:0, 3, 7, 10, 19, 11, 20, 9, 4, 8) -> f_383(v346:0, v347:0, v348:0, v349:0, v350:0, v353:0, 1, 1 + v353:0, 0, v356:0, 1 + v356:0, v357:0, v358:0, v359:0, v360:0, v361:0, 3, 7, 10, 19, 11, 20, 9, 4, 8) :|: v351:0 < 19 && v353:0 < 20 && v355:0 < 9 && v356:0 < 10 && v353:0 > 10 && v356:0 > 0
Filtered unneeded arguments:
   f_383(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24, x25) -> f_383(x6, x8, x10, x11)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_383(v351:0, v353:0, v355:0, v356:0) -> f_383(v353:0, 1 + v353:0, v356:0, 1 + v356:0) :|: v353:0 < 20 && v351:0 < 19 && v355:0 < 9 && v356:0 < 10 && v356:0 > 0 && v353:0 > 10

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

(9)
Obligation:
Rules:
f_383(v351:0, v353:0, v355:0, v356:0) -> f_383(v353:0, 1 + v353:0, v356:0, 1 + v356:0) :|: v353:0 < 20 && v351:0 < 19 && v355:0 < 9 && v356:0 < 10 && v356:0 > 0 && v353:0 > 10

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

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

(11)
Obligation:
Rules:
f_383(v351:0:0, v353:0:0, v355:0:0, v356:0:0) -> f_383(v353:0:0, 1 + v353:0:0, v356:0:0, 1 + v356:0:0) :|: v356:0:0 > 0 && v353:0:0 > 10 && v356:0:0 < 10 && v355:0:0 < 9 && v351:0:0 < 19 && v353:0:0 < 20

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

(12) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_383 ] = -1*f_383_2

The following rules are decreasing:
f_383(v351:0:0, v353:0:0, v355:0:0, v356:0:0) -> f_383(v353:0:0, 1 + v353:0:0, v356:0:0, 1 + v356:0:0) :|: v356:0:0 > 0 && v353:0:0 > 10 && v356:0:0 < 10 && v355:0:0 < 9 && v351:0:0 < 19 && v353:0:0 < 20

The following rules are bounded:
f_383(v351:0:0, v353:0:0, v355:0:0, v356:0:0) -> f_383(v353:0:0, 1 + v353:0:0, v356:0:0, 1 + v356:0:0) :|: v356:0:0 > 0 && v353:0:0 > 10 && v356:0:0 < 10 && v355:0:0 < 9 && v351:0:0 < 19 && v353:0:0 < 20


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

(13)
YES

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

(14)
Obligation:
SCC
----------------------------------------

(15) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 15 rulesP rules:
f_235(v93, v94, v95, v96, v97, v98, 1, v100, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) -> f_236(v93, v94, v95, v96, v97, v100, 1, v98, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) :|: 0 = 0
f_236(v93, v94, v95, v96, v97, v100, 1, v98, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) -> f_237(v93, v94, v95, v96, v97, v100, 1, v98, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) :|: 0 = 0
f_237(v93, v94, v95, v96, v97, v100, 1, v98, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) -> f_238(v93, v94, v95, v96, v97, v100, 1, v98, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) :|: TRUE
f_238(v93, v94, v95, v96, v97, v100, 1, v98, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) -> f_239(v93, v94, v95, v96, v97, v100, 1, v98, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) :|: 0 = 0
f_239(v93, v94, v95, v96, v97, v100, 1, v98, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) -> f_240(v93, v94, v95, v96, v97, v100, 1, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8) :|: 0 = 0
f_240(v93, v94, v95, v96, v97, v100, 1, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8) -> f_241(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8, 2, 11) :|: v107 = 1 + v100 && 2 <= v107 && v107 <= 11
f_241(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8, 2, 11) -> f_242(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8, 2, 11) :|: TRUE
f_242(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8, 2, 11) -> f_243(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8, 2, 11) :|: 0 = 0
f_243(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8, 2, 11) -> f_244(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8, 2, 11) :|: 0 = 0
f_244(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 10, 4, 8, 2, 11) -> f_245(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 4, 8, 2, 10) :|: v107 <= 10 && v100 <= 9
f_245(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 4, 8, 2, 10) -> f_247(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 4, 8, 2, 10) :|: 0 = 0
f_247(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 4, 8, 2, 10) -> f_249(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 4, 8, 2, 10) :|: TRUE
f_249(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 4, 8, 2, 10) -> f_251(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 4, 8, 2, 10) :|: TRUE
f_251(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 4, 8, 2, 10) -> f_234(v93, v94, v95, v96, v97, v100, 1, v107, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) :|: TRUE
f_234(v93, v94, v95, v96, v97, v98, 1, v100, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) -> f_235(v93, v94, v95, v96, v97, v98, 1, v100, v101, v102, v103, v104, v105, 0, 3, 7, 9, 10, 4, 8) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_235(v93:0, v94:0, v95:0, v96:0, v97:0, v98:0, 1, v100:0, v101:0, v102:0, v103:0, v104:0, v105:0, 0, 3, 7, 9, 10, 4, 8) -> f_235(v93:0, v94:0, v95:0, v96:0, v97:0, v100:0, 1, 1 + v100:0, v101:0, v102:0, v103:0, v104:0, v105:0, 0, 3, 7, 9, 10, 4, 8) :|: v100:0 > 0 && v100:0 < 11 && v100:0 < 10
Filtered unneeded arguments:
   f_235(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20) -> f_235(x8)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_235(v100:0) -> f_235(1 + v100:0) :|: v100:0 < 11 && v100:0 < 10 && v100:0 > 0

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

(16)
Obligation:
Rules:
f_235(v100:0) -> f_235(1 + v100:0) :|: v100:0 < 11 && v100:0 < 10 && v100:0 > 0

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

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

(18)
Obligation:
Rules:
f_235(v100:0:0) -> f_235(1 + v100:0:0) :|: v100:0:0 < 11 && v100:0:0 < 10 && v100:0:0 > 0

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

(19) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_235(x)] = 9 - x

The following rules are decreasing:
f_235(v100:0:0) -> f_235(1 + v100:0:0) :|: v100:0:0 < 11 && v100:0:0 < 10 && v100:0:0 > 0
The following rules are bounded:
f_235(v100:0:0) -> f_235(1 + v100:0:0) :|: v100:0:0 < 11 && v100:0:0 < 10 && v100:0:0 > 0

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

(20)
YES