/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 174 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 890 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) LLVM Symbolic Execution SCC
        (8) SCC2IRS [SOUND, 53 ms]
        (9) IntTRS
        (10) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (11) IntTRS
        (12) RankingReductionPairProof [EQUIVALENT, 20 ms]
        (13) YES
    (14) LLVM Symbolic Execution SCC
        (15) SCC2IRS [SOUND, 67 ms]
        (16) IntTRS
        (17) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (18) IntTRS
        (19) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (20) 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: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%q = alloca i32, align 4
		%p = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %q
		%3 = call i32 @__VERIFIER_nondet_int()
		store %3, %p
		br %4
	4:
		%5 = load %q
		%6 = icmp sgt %5 0
		br %6, %7, %10
	7:
		%8 = load %p
		%9 = icmp sgt %8 0
		br %10
	10:
		%11 = phi [0, %4], [%9, %7]
		br %11, %12, %29
	12:
		%13 = load %q
		%14 = load %p
		%15 = icmp slt %13 %14
		br %15, %16, %19
	16:
		%17 = load %q
		%18 = sub %17 1
		store %18, %q
		br %28
	19:
		%20 = load %p
		%21 = load %q
		%22 = icmp slt %20 %21
		br %22, %23, %26
	23:
		%24 = load %p
		%25 = sub %24 1
		store %25, %p
		br %27
	26:
		br %29
	27:
		br %28
	28:
		br %4
	29:
		ret 0


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 23 rulesP rules:
f_286(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) -> f_288(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_288(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) -> f_289(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_289(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) -> f_290(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) :|: TRUE
f_290(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) -> f_291(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_291(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) -> f_292(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) :|: 0 < v382 && 2 <= v380 && 3 <= v377 && 2 <= v378
f_292(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) -> f_294(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_294(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) -> f_296(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_296(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) -> f_298(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) :|: TRUE
f_298(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) -> f_300(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_300(v374, v375, v376, v377, v378, 1, v382, v380, 0, v383, v384, v385, 3, 2, 4) -> f_301(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_301(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) -> f_302(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_302(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) -> f_303(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) :|: TRUE
f_303(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) -> f_304(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_304(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) -> f_305(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_305(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) -> f_306(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_306(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) -> f_307(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) :|: TRUE
f_307(v374, v375, v376, v377, v378, 1, v382, 0, v380, v383, v384, v385, 3, 2, 4) -> f_308(v374, v375, v376, v377, v378, 1, v382, 0, v383, v384, v385, 3, 2, 4) :|: 0 = 0
f_308(v374, v375, v376, v377, v378, 1, v382, 0, v383, v384, v385, 3, 2, 4) -> f_309(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) :|: 1 + v474 = v382 && 0 <= v474
f_309(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) -> f_310(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) :|: TRUE
f_310(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) -> f_311(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) :|: TRUE
f_311(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) -> f_312(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) :|: TRUE
f_312(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) -> f_284(v374, v375, v376, v377, v378, 1, v382, 0, v474, v383, v384, v385, 3, 2, 4) :|: TRUE
f_284(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) -> f_286(v374, v375, v376, v377, v378, 1, v380, 0, v382, v383, v384, v385, 3, 2, 4) :|: TRUE
Combined rules. Obtained 1 rulesP rules:
f_286(v374:0, v375:0, v376:0, v377:0, v378:0, 1, v380:0, 0, 1 + v474:0, v383:0, v384:0, v385:0, 3, 2, 4) -> f_286(v374:0, v375:0, v376:0, v377:0, v378:0, 1, 1 + v474:0, 0, v474:0, v383:0, v384:0, v385:0, 3, 2, 4) :|: v380:0 > 1 && v474:0 > -1 && v377:0 > 2 && v378:0 > 1
Filtered unneeded arguments:
   f_286(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15) -> f_286(x4, x5, x7, x9)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_286(v377:0, v378:0, v380:0, sum~cons_1~v474:0) -> f_286(v377:0, v378:0, 1 + v474:0, v474:0) :|: v474:0 > -1 && v380:0 > 1 && v378:0 > 1 && v377:0 > 2 && sum~cons_1~v474:0 = 1 + v474:0

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

(9)
Obligation:
Rules:
f_286(v377:0, v378:0, v380:0, sum~cons_1~v474:0) -> f_286(v377:0, v378:0, 1 + v474:0, v474:0) :|: v474:0 > -1 && v380:0 > 1 && v378:0 > 1 && v377:0 > 2 && sum~cons_1~v474:0 = 1 + v474:0

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

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

(11)
Obligation:
Rules:
f_286(v377:0:0, v378:0:0, v380:0:0, sum~cons_1~v474:0:0) -> f_286(v377:0:0, v378:0:0, 1 + v474:0:0, v474:0:0) :|: v378:0:0 > 1 && v377:0:0 > 2 && v380:0:0 > 1 && v474:0:0 > -1 && sum~cons_1~v474:0:0 = 1 + v474:0:0

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

(12) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_286 ] = f_286_4

The following rules are decreasing:
f_286(v377:0:0, v378:0:0, v380:0:0, sum~cons_1~v474:0:0) -> f_286(v377:0:0, v378:0:0, 1 + v474:0:0, v474:0:0) :|: v378:0:0 > 1 && v377:0:0 > 2 && v380:0:0 > 1 && v474:0:0 > -1 && sum~cons_1~v474:0:0 = 1 + v474:0:0

The following rules are bounded:
f_286(v377:0:0, v378:0:0, v380:0:0, sum~cons_1~v474:0:0) -> f_286(v377:0:0, v378:0:0, 1 + v474:0:0, v474:0:0) :|: v378:0:0 > 1 && v377:0:0 > 2 && v380:0:0 > 1 && v474:0:0 > -1 && sum~cons_1~v474:0:0 = 1 + v474:0:0


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

(13)
YES

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

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

(15) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 18 rulesP rules:
f_248(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_251(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 < v269 && 2 <= v267 && 3 <= v266 && 2 <= v265
f_251(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_255(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
f_255(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_258(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: TRUE
f_258(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_261(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
f_261(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_264(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
f_264(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_266(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
f_266(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_268(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: TRUE
f_268(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_270(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
f_270(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_272(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
f_272(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_274(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
f_274(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_276(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: TRUE
f_276(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) -> f_278(v262, v263, v264, v265, v266, v269, 1, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
f_278(v262, v263, v264, v265, v266, v269, 1, v270, v271, v272, 0, 3, 2, 4) -> f_280(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) :|: 1 + v372 = v269 && 0 <= v372
f_280(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) -> f_282(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) :|: TRUE
f_282(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) -> f_285(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) :|: TRUE
f_285(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) -> f_287(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) :|: TRUE
f_287(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) -> f_245(v262, v263, v264, v265, v266, v269, 1, v372, v270, v271, v272, 0, 3, 2, 4) :|: TRUE
f_245(v262, v263, v264, v265, v266, v267, 1, v269, v270, v271, v272, 0, 3, 2, 4) -> f_248(v262, v263, v264, v265, v266, v269, 1, v267, v270, v271, v272, 0, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_248(v262:0, v263:0, v264:0, v265:0, v266:0, 1 + v372:0, 1, v267:0, v270:0, v271:0, v272:0, 0, 3, 2, 4) -> f_248(v262:0, v263:0, v264:0, v265:0, v266:0, v372:0, 1, 1 + v372:0, v270:0, v271:0, v272:0, 0, 3, 2, 4) :|: v267:0 > 1 && v372:0 > -1 && v266:0 > 2 && v265:0 > 1
Filtered unneeded arguments:
   f_248(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15) -> f_248(x4, x5, x6, x8)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_248(v265:0, v266:0, sum~cons_1~v372:0, v267:0) -> f_248(v265:0, v266:0, v372:0, 1 + v372:0) :|: v372:0 > -1 && v267:0 > 1 && v265:0 > 1 && v266:0 > 2 && sum~cons_1~v372:0 = 1 + v372:0

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

(16)
Obligation:
Rules:
f_248(v265:0, v266:0, sum~cons_1~v372:0, v267:0) -> f_248(v265:0, v266:0, v372:0, 1 + v372:0) :|: v372:0 > -1 && v267:0 > 1 && v265:0 > 1 && v266:0 > 2 && sum~cons_1~v372:0 = 1 + v372:0

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

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

(18)
Obligation:
Rules:
f_248(v265:0:0, v266:0:0, sum~cons_1~v372:0:0, v267:0:0) -> f_248(v265:0:0, v266:0:0, v372:0:0, 1 + v372:0:0) :|: v265:0:0 > 1 && v266:0:0 > 2 && v267:0:0 > 1 && v372:0:0 > -1 && sum~cons_1~v372:0:0 = 1 + v372:0:0

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

(19) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_248(x, x1, x2, x3)] = x2

The following rules are decreasing:
f_248(v265:0:0, v266:0:0, sum~cons_1~v372:0:0, v267:0:0) -> f_248(v265:0:0, v266:0:0, v372:0:0, 1 + v372:0:0) :|: v265:0:0 > 1 && v266:0:0 > 2 && v267:0:0 > 1 && v372:0:0 > -1 && sum~cons_1~v372:0:0 = 1 + v372:0:0
The following rules are bounded:
f_248(v265:0:0, v266:0:0, sum~cons_1~v372:0:0, v267:0:0) -> f_248(v265:0:0, v266:0:0, v372:0:0, 1 + v372:0:0) :|: v265:0:0 > 1 && v266:0:0 > 2 && v267:0:0 > 1 && v372:0:0 > -1 && sum~cons_1~v372:0:0 = 1 + v372:0:0

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

(20)
YES