/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, 177 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 3501 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) LLVM Symbolic Execution SCC
        (8) SCC2IRS [SOUND, 32 ms]
        (9) IntTRS
        (10) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (11) IntTRS
        (12) RankingReductionPairProof [EQUIVALENT, 8 ms]
        (13) YES
    (14) LLVM Symbolic Execution SCC
        (15) SCC2IRS [SOUND, 54 ms]
        (16) IntTRS
        (17) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (18) IntTRS
        (19) RankingReductionPairProof [EQUIVALENT, 25 ms]
        (20) YES
    (21) LLVM Symbolic Execution SCC
        (22) SCC2IRS [SOUND, 50 ms]
        (23) IntTRS
        (24) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (25) IntTRS
        (26) RankingReductionPairProof [EQUIVALENT, 15 ms]
        (27) 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: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32, y i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		%c = alloca i32, align 4
		store %x, %1
		store %y, %2
		store 0, %c
		br %3
	3:
		%4 = load %1
		%5 = icmp sgt %4 0
		br %5, %6, %20
	6:
		br %7
	7:
		%8 = load %2
		%9 = icmp sgt %8 0
		br %9, %10, %15
	10:
		%11 = load %2
		%12 = sub %11 1
		store %12, %2
		%13 = load %c
		%14 = add %13 1
		store %14, %c
		br %7
	15:
		%16 = load %1
		%17 = sub %16 1
		store %17, %1
		%18 = load %c
		%19 = add %18 1
		store %19, %c
		br %3
	20:
		%21 = load %c
		ret %21

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		%3 = call i32 @__VERIFIER_nondet_int()
		%4 = call i32 @test_fun(i32 %2, i32 %3)
		ret %4


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 3 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 16 rulesP rules:
f_449(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_450(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: 0 < v451 && 2 <= v446 && 2 <= v441
f_450(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_452(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: 0 = 0
f_452(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_454(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: TRUE
f_454(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_456(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: TRUE
f_456(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_458(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: 0 = 0
f_458(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_460(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: 0 = 0
f_460(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_461(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: TRUE
f_461(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_462(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: 0 = 0
f_462(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_463(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: 1 + v475 = v451 && 0 <= v475
f_463(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_464(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: TRUE
f_464(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_465(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: 0 = 0
f_465(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_466(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v477, v454, v455, v456, v457, v458, 3, 2, 4) :|: v477 = 1 + v453 && 3 <= v477
f_466(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v477, v454, v455, v456, v457, v458, 3, 2, 4) -> f_467(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v477, v454, v455, v456, v457, v458, 3, 2, 4) :|: TRUE
f_467(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v477, v454, v455, v456, v457, v458, 3, 2, 4) -> f_468(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v477, v454, v455, v456, v457, v458, 3, 2, 4) :|: TRUE
f_468(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v477, v454, v455, v456, v457, v458, 3, 2, 4) -> f_448(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v475, v453, v477, v454, v455, v456, v457, v458, 3, 2, 4) :|: TRUE
f_448(v441, v442, v443, v444, v445, v446, 1, 0, v449, v450, v451, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) -> f_449(v441, v442, v443, v444, v445, v451, 1, 0, v449, v450, v446, v452, v453, v454, v455, v456, v457, v458, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_449(v441:0, v442:0, v443:0, v444:0, v445:0, 1 + v475:0, 1, 0, v449:0, v450:0, v446:0, v452:0, v453:0, v454:0, v455:0, v456:0, v457:0, v458:0, 3, 2, 4) -> f_449(v441:0, v442:0, v443:0, v444:0, v445:0, v475:0, 1, 0, v449:0, v450:0, 1 + v475:0, v453:0, 1 + v453:0, v454:0, v455:0, v456:0, v457:0, v458:0, 3, 2, 4) :|: v446:0 > 1 && v475:0 > -1 && v441:0 > 1 && v453:0 > 1
Filtered unneeded arguments:
   f_449(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_449(x1, x6, x11, x13)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_449(v441:0, sum~cons_1~v475:0, v446:0, v453:0) -> f_449(v441:0, v475:0, 1 + v475:0, 1 + v453:0) :|: v475:0 > -1 && v446:0 > 1 && v453:0 > 1 && v441:0 > 1 && sum~cons_1~v475:0 = 1 + v475:0

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

(9)
Obligation:
Rules:
f_449(v441:0, sum~cons_1~v475:0, v446:0, v453:0) -> f_449(v441:0, v475:0, 1 + v475:0, 1 + v453:0) :|: v475:0 > -1 && v446:0 > 1 && v453:0 > 1 && v441:0 > 1 && sum~cons_1~v475:0 = 1 + v475:0

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

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

(11)
Obligation:
Rules:
f_449(v441:0:0, sum~cons_1~v475:0:0, v446:0:0, v453:0:0) -> f_449(v441:0:0, v475:0:0, 1 + v475:0:0, 1 + v453:0:0) :|: v453:0:0 > 1 && v441:0:0 > 1 && v446:0:0 > 1 && v475:0:0 > -1 && sum~cons_1~v475:0:0 = 1 + v475:0:0

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

(12) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_449 ] = f_449_2

The following rules are decreasing:
f_449(v441:0:0, sum~cons_1~v475:0:0, v446:0:0, v453:0:0) -> f_449(v441:0:0, v475:0:0, 1 + v475:0:0, 1 + v453:0:0) :|: v453:0:0 > 1 && v441:0:0 > 1 && v446:0:0 > 1 && v475:0:0 > -1 && sum~cons_1~v475:0:0 = 1 + v475:0:0

The following rules are bounded:
f_449(v441:0:0, sum~cons_1~v475:0:0, v446:0:0, v453:0:0) -> f_449(v441:0:0, v475:0:0, 1 + v475:0:0, 1 + v453:0:0) :|: v453:0:0 > 1 && v441:0:0 > 1 && v446:0:0 > 1 && v475:0:0 > -1 && sum~cons_1~v475:0:0 = 1 + v475:0:0


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

(13)
YES

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

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

(15) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 16 rulesP rules:
f_402(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 4) -> f_404(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: 0 < v333 && 2 <= v330 && 2 <= v325
f_404(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_407(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: 0 = 0
f_407(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_410(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: TRUE
f_410(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_413(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: TRUE
f_413(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_417(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: 0 = 0
f_417(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_420(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: 0 = 0
f_420(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_423(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: TRUE
f_423(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_426(v325, v326, v327, v328, v329, v333, 1, 0, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: 0 = 0
f_426(v325, v326, v327, v328, v329, v333, 1, 0, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_429(v325, v326, v327, v328, v329, v333, 1, 0, v390, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: 1 + v390 = v333 && 0 <= v390
f_429(v325, v326, v327, v328, v329, v333, 1, 0, v390, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_432(v325, v326, v327, v328, v329, v333, 1, 0, v390, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: TRUE
f_432(v325, v326, v327, v328, v329, v333, 1, 0, v390, v334, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_435(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v336, v337, v338, v339, v340, 3, 2, 4) :|: 0 = 0
f_435(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v336, v337, v338, v339, v340, 3, 2, 4) -> f_437(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v399, v336, v337, v338, v339, v340, 3, 2, 4) :|: v399 = 1 + v335 && 2 <= v399
f_437(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v399, v336, v337, v338, v339, v340, 3, 2, 4) -> f_439(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v399, v336, v337, v338, v339, v340, 3, 2, 4) :|: TRUE
f_439(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v399, v336, v337, v338, v339, v340, 3, 2, 4) -> f_441(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v399, v336, v337, v338, v339, v340, 3, 2, 4) :|: TRUE
f_441(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v399, v336, v337, v338, v339, v340, 3, 2, 4) -> f_400(v325, v326, v327, v328, v329, v333, 1, 0, v390, v335, v399, v336, v337, v338, v339, v340, 3, 4) :|: TRUE
f_400(v325, v326, v327, v328, v329, v330, 1, 0, v333, v334, v335, v336, v337, v338, v339, v340, 3, 4) -> f_402(v325, v326, v327, v328, v329, v333, 1, 0, v330, v334, v335, v336, v337, v338, v339, v340, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_402(v325:0, v326:0, v327:0, v328:0, v329:0, 1 + v390:0, 1, 0, v330:0, v334:0, v335:0, v336:0, v337:0, v338:0, v339:0, v340:0, 3, 4) -> f_402(v325:0, v326:0, v327:0, v328:0, v329:0, v390:0, 1, 0, 1 + v390:0, v335:0, 1 + v335:0, v336:0, v337:0, v338:0, v339:0, v340:0, 3, 4) :|: v330:0 > 1 && v390:0 > -1 && v325:0 > 1 && v335:0 > 0
Filtered unneeded arguments:
   f_402(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_402(x1, x6, x9, x11)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_402(v325:0, sum~cons_1~v390:0, v330:0, v335:0) -> f_402(v325:0, v390:0, 1 + v390:0, 1 + v335:0) :|: v390:0 > -1 && v330:0 > 1 && v335:0 > 0 && v325:0 > 1 && sum~cons_1~v390:0 = 1 + v390:0

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

(16)
Obligation:
Rules:
f_402(v325:0, sum~cons_1~v390:0, v330:0, v335:0) -> f_402(v325:0, v390:0, 1 + v390:0, 1 + v335:0) :|: v390:0 > -1 && v330:0 > 1 && v335:0 > 0 && v325:0 > 1 && sum~cons_1~v390:0 = 1 + v390:0

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

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

(18)
Obligation:
Rules:
f_402(v325:0:0, sum~cons_1~v390:0:0, v330:0:0, v335:0:0) -> f_402(v325:0:0, v390:0:0, 1 + v390:0:0, 1 + v335:0:0) :|: v335:0:0 > 0 && v325:0:0 > 1 && v330:0:0 > 1 && v390:0:0 > -1 && sum~cons_1~v390:0:0 = 1 + v390:0:0

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

(19) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_402 ] = f_402_2

The following rules are decreasing:
f_402(v325:0:0, sum~cons_1~v390:0:0, v330:0:0, v335:0:0) -> f_402(v325:0:0, v390:0:0, 1 + v390:0:0, 1 + v335:0:0) :|: v335:0:0 > 0 && v325:0:0 > 1 && v330:0:0 > 1 && v390:0:0 > -1 && sum~cons_1~v390:0:0 = 1 + v390:0:0

The following rules are bounded:
f_402(v325:0:0, sum~cons_1~v390:0:0, v330:0:0, v335:0:0) -> f_402(v325:0:0, v390:0:0, 1 + v390:0:0, 1 + v335:0:0) :|: v335:0:0 > 0 && v325:0:0 > 1 && v330:0:0 > 1 && v390:0:0 > -1 && sum~cons_1~v390:0:0 = 1 + v390:0:0


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

(20)
YES

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

(21)
Obligation:
SCC
----------------------------------------

(22) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 12 rulesP rules:
f_339(v206, v207, v208, v209, v210, 1, v213, v212, v214, v215, v216, v217, v218, v219, v220, 0, 3, 4) -> f_341(v206, v207, v208, v209, v210, 1, v213, v212, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: 0 < v213 && 2 <= v212 && 2 <= v207
f_341(v206, v207, v208, v209, v210, 1, v213, v212, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_344(v206, v207, v208, v209, v210, 1, v213, v212, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: 0 = 0
f_344(v206, v207, v208, v209, v210, 1, v213, v212, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_347(v206, v207, v208, v209, v210, 1, v213, v212, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: TRUE
f_347(v206, v207, v208, v209, v210, 1, v213, v212, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_350(v206, v207, v208, v209, v210, 1, v213, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: 0 = 0
f_350(v206, v207, v208, v209, v210, 1, v213, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_354(v206, v207, v208, v209, v210, 1, v213, v250, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: 1 + v250 = v213 && 0 <= v250
f_354(v206, v207, v208, v209, v210, 1, v213, v250, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_357(v206, v207, v208, v209, v210, 1, v213, v250, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: TRUE
f_357(v206, v207, v208, v209, v210, 1, v213, v250, v214, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_361(v206, v207, v208, v209, v210, 1, v213, v250, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: 0 = 0
f_361(v206, v207, v208, v209, v210, 1, v213, v250, v215, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_365(v206, v207, v208, v209, v210, 1, v213, v250, v215, v254, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: v254 = 1 + v215 && 2 <= v254
f_365(v206, v207, v208, v209, v210, 1, v213, v250, v215, v254, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_369(v206, v207, v208, v209, v210, 1, v213, v250, v215, v254, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: TRUE
f_369(v206, v207, v208, v209, v210, 1, v213, v250, v215, v254, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_373(v206, v207, v208, v209, v210, 1, v213, v250, v215, v254, v216, v217, v218, v219, v220, 0, 3, 2, 4) :|: TRUE
f_373(v206, v207, v208, v209, v210, 1, v213, v250, v215, v254, v216, v217, v218, v219, v220, 0, 3, 2, 4) -> f_337(v206, v207, v208, v209, v210, 1, v213, v250, v215, v254, v216, v217, v218, v219, v220, 0, 3, 4) :|: TRUE
f_337(v206, v207, v208, v209, v210, 1, v212, v213, v214, v215, v216, v217, v218, v219, v220, 0, 3, 4) -> f_339(v206, v207, v208, v209, v210, 1, v213, v212, v214, v215, v216, v217, v218, v219, v220, 0, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_339(v206:0, v207:0, v208:0, v209:0, v210:0, 1, 1 + v250:0, v212:0, v214:0, v215:0, v216:0, v217:0, v218:0, v219:0, v220:0, 0, 3, 4) -> f_339(v206:0, v207:0, v208:0, v209:0, v210:0, 1, v250:0, 1 + v250:0, v215:0, 1 + v215:0, v216:0, v217:0, v218:0, v219:0, v220:0, 0, 3, 4) :|: v212:0 > 1 && v250:0 > -1 && v207:0 > 1 && v215:0 > 0
Filtered unneeded arguments:
   f_339(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_339(x2, x7, x8, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_339(v207:0, sum~cons_1~v250:0, v212:0, v215:0) -> f_339(v207:0, v250:0, 1 + v250:0, 1 + v215:0) :|: v250:0 > -1 && v212:0 > 1 && v215:0 > 0 && v207:0 > 1 && sum~cons_1~v250:0 = 1 + v250:0

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

(23)
Obligation:
Rules:
f_339(v207:0, sum~cons_1~v250:0, v212:0, v215:0) -> f_339(v207:0, v250:0, 1 + v250:0, 1 + v215:0) :|: v250:0 > -1 && v212:0 > 1 && v215:0 > 0 && v207:0 > 1 && sum~cons_1~v250:0 = 1 + v250:0

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

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

(25)
Obligation:
Rules:
f_339(v207:0:0, sum~cons_1~v250:0:0, v212:0:0, v215:0:0) -> f_339(v207:0:0, v250:0:0, 1 + v250:0:0, 1 + v215:0:0) :|: v215:0:0 > 0 && v207:0:0 > 1 && v212:0:0 > 1 && v250:0:0 > -1 && sum~cons_1~v250:0:0 = 1 + v250:0:0

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

(26) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_339 ] = f_339_2

The following rules are decreasing:
f_339(v207:0:0, sum~cons_1~v250:0:0, v212:0:0, v215:0:0) -> f_339(v207:0:0, v250:0:0, 1 + v250:0:0, 1 + v215:0:0) :|: v215:0:0 > 0 && v207:0:0 > 1 && v212:0:0 > 1 && v250:0:0 > -1 && sum~cons_1~v250:0:0 = 1 + v250:0:0

The following rules are bounded:
f_339(v207:0:0, sum~cons_1~v250:0:0, v212:0:0, v215:0:0) -> f_339(v207:0:0, v250:0:0, 1 + v250:0:0, 1 + v215:0:0) :|: v215:0:0 > 0 && v207:0:0 > 1 && v212:0:0 > 1 && v250:0:0 > -1 && sum~cons_1~v250:0:0 = 1 + v250:0:0


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

(27)
YES