/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) CToIRSProof [EQUIVALENT, 0 ms]
(2) IntTRS
(3) TerminationGraphProcessor [SOUND, 70 ms]
(4) IntTRS
(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(6) IntTRS
(7) PolynomialOrderProcessor [EQUIVALENT, 11 ms]
(8) IntTRS
(9) PolynomialOrderProcessor [EQUIVALENT, 3 ms]
(10) YES


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

(0)
Obligation:
c file /export/starexec/sandbox/benchmark/theBenchmark.c
----------------------------------------

(1) CToIRSProof (EQUIVALENT)
Parsed C Integer Program as IRS.
----------------------------------------

(2)
Obligation:
Rules:
f1(c, n) -> f2(1, n) :|: TRUE
f2(x, x1) -> f3(x, x2) :|: TRUE
f5(x3, x4) -> f8(x3, arith) :|: TRUE && arith = x4 - 10
f8(x25, x26) -> f9(x27, x26) :|: TRUE && x27 = x25 - 1
f6(x28, x29) -> f10(x28, x30) :|: TRUE && x30 = x29 + 11
f10(x31, x32) -> f11(x33, x32) :|: TRUE && x33 = x31 + 1
f4(x11, x12) -> f5(x11, x12) :|: x12 > 100
f4(x13, x14) -> f6(x13, x14) :|: x14 <= 100
f9(x15, x16) -> f7(x15, x16) :|: TRUE
f11(x17, x18) -> f7(x17, x18) :|: TRUE
f3(x19, x20) -> f4(x19, x20) :|: x19 > 0
f7(x21, x22) -> f3(x21, x22) :|: TRUE
f3(x23, x24) -> f12(x23, x24) :|: x23 <= 0
Start term: f1(c, n)

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

(3) TerminationGraphProcessor (SOUND)
Constructed the termination graph and obtained one non-trivial SCC.

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

(4)
Obligation:
Rules:
f3(x19, x20) -> f4(x19, x20) :|: x19 > 0
f7(x21, x22) -> f3(x21, x22) :|: TRUE
f9(x15, x16) -> f7(x15, x16) :|: TRUE
f8(x25, x26) -> f9(x27, x26) :|: TRUE && x27 = x25 - 1
f5(x3, x4) -> f8(x3, arith) :|: TRUE && arith = x4 - 10
f4(x11, x12) -> f5(x11, x12) :|: x12 > 100
f11(x17, x18) -> f7(x17, x18) :|: TRUE
f10(x31, x32) -> f11(x33, x32) :|: TRUE && x33 = x31 + 1
f6(x28, x29) -> f10(x28, x30) :|: TRUE && x30 = x29 + 11
f4(x13, x14) -> f6(x13, x14) :|: x14 <= 100

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

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

(6)
Obligation:
Rules:
f7(x21:0, x22:0) -> f7(x21:0 - 1, x22:0 - 10) :|: x21:0 > 0 && x22:0 > 100
f7(x, x1) -> f7(x + 1, x1 + 11) :|: x > 0 && x1 < 101

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

(7) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f7(x, x1)] = 90 + 10*x - x1

The following rules are decreasing:
f7(x, x1) -> f7(x + 1, x1 + 11) :|: x > 0 && x1 < 101
The following rules are bounded:
f7(x, x1) -> f7(x + 1, x1 + 11) :|: x > 0 && x1 < 101

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

(8)
Obligation:
Rules:
f7(x21:0, x22:0) -> f7(x21:0 - 1, x22:0 - 10) :|: x21:0 > 0 && x22:0 > 100

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

(9) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f7(x, x1)] = -1 + x

The following rules are decreasing:
f7(x21:0, x22:0) -> f7(x21:0 - 1, x22:0 - 10) :|: x21:0 > 0 && x22:0 > 100
The following rules are bounded:
f7(x21:0, x22:0) -> f7(x21:0 - 1, x22:0 - 10) :|: x21:0 > 0 && x22:0 > 100

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

(10)
YES