7.55/2.67 YES 7.55/2.68 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 7.55/2.68 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 7.55/2.68 7.55/2.68 7.55/2.68 Termination of the given C Problem could be proven: 7.55/2.68 7.55/2.68 (0) C Problem 7.55/2.68 (1) CToIRSProof [EQUIVALENT, 0 ms] 7.55/2.68 (2) IntTRS 7.55/2.68 (3) TerminationGraphProcessor [SOUND, 48 ms] 7.55/2.68 (4) IntTRS 7.55/2.68 (5) IntTRSCompressionProof [EQUIVALENT, 29 ms] 7.55/2.68 (6) IntTRS 7.55/2.68 (7) TerminationGraphProcessor [EQUIVALENT, 3 ms] 7.55/2.68 (8) IntTRS 7.55/2.68 (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] 7.55/2.68 (10) IntTRS 7.55/2.68 (11) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 7.55/2.68 (12) YES 7.55/2.68 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (0) 7.55/2.68 Obligation: 7.55/2.68 c file /export/starexec/sandbox/benchmark/theBenchmark.c 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (1) CToIRSProof (EQUIVALENT) 7.55/2.68 Parsed C Integer Program as IRS. 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (2) 7.55/2.68 Obligation: 7.55/2.68 Rules: 7.55/2.68 f1(x, y, z) -> f2(x_1, y, z) :|: TRUE 7.55/2.68 f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE 7.55/2.68 f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE 7.55/2.68 f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = 2 * x9 + x10 7.55/2.68 f6(x24, x25, x26) -> f7(x24, x27, x26) :|: TRUE && x27 = x25 + 1 7.55/2.68 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 >= 0 && x15 <= x17 7.55/2.68 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 7.55/2.68 f4(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 < 0 7.55/2.68 f4(x28, x29, x30) -> f8(x28, x29, x30) :|: x28 > x30 7.55/2.68 Start term: f1(x, y, z) 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (3) TerminationGraphProcessor (SOUND) 7.55/2.68 Constructed the termination graph and obtained one non-trivial SCC. 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (4) 7.55/2.68 Obligation: 7.55/2.68 Rules: 7.55/2.68 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 >= 0 && x15 <= x17 7.55/2.68 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 7.55/2.68 f6(x24, x25, x26) -> f7(x24, x27, x26) :|: TRUE && x27 = x25 + 1 7.55/2.68 f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = 2 * x9 + x10 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (5) IntTRSCompressionProof (EQUIVALENT) 7.55/2.68 Compressed rules. 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (6) 7.55/2.68 Obligation: 7.55/2.68 Rules: 7.55/2.68 f6(x24:0, x25:0, x26:0) -> f6(2 * x24:0 + (x25:0 + 1), x25:0 + 1, x26:0) :|: x24:0 > -1 && x26:0 >= x24:0 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (7) TerminationGraphProcessor (EQUIVALENT) 7.55/2.68 Constructed the termination graph and obtained one non-trivial SCC. 7.55/2.68 7.55/2.68 f6(x24:0, x25:0, x26:0) -> f6(2 * x24:0 + (x25:0 + 1), x25:0 + 1, x26:0) :|: x24:0 > -1 && x26:0 >= x24:0 7.55/2.68 has been transformed into 7.55/2.68 f6(x24:0, x25:0, x26:0) -> f6(2 * x24:0 + (x25:0 + 1), x25:0 + 1, x26:0) :|: x26:0 = x8 && (x24:0 > -1 && x26:0 >= x24:0) && x6 > -1 && x8 >= x6. 7.55/2.68 7.55/2.68 7.55/2.68 f6(x24:0, x25:0, x26:0) -> f6(2 * x24:0 + (x25:0 + 1), x25:0 + 1, x26:0) :|: x26:0 = x8 && (x24:0 > -1 && x26:0 >= x24:0) && x6 > -1 && x8 >= x6 and 7.55/2.68 f6(x24:0, x25:0, x26:0) -> f6(2 * x24:0 + (x25:0 + 1), x25:0 + 1, x26:0) :|: x26:0 = x8 && (x24:0 > -1 && x26:0 >= x24:0) && x6 > -1 && x8 >= x6 7.55/2.68 have been merged into the new rule 7.55/2.68 f6(x19, x20, x21) -> f6(2 * (2 * x19 + (x20 + 1)) + (x20 + 1 + 1), x20 + 1 + 1, x21) :|: x21 = x22 && (x19 > -1 && x21 >= x19) && x23 > -1 && x22 >= x23 && (x21 = x24 && (2 * x19 + (x20 + 1) > -1 && x21 >= 2 * x19 + (x20 + 1)) && x25 > -1 && x24 >= x25) 7.55/2.68 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (8) 7.55/2.68 Obligation: 7.55/2.68 Rules: 7.55/2.68 f6(x26, x27, x28) -> f6(4 * x26 + 3 * x27 + 4, x27 + 2, x28) :|: TRUE && x28 + -1 * x29 = 0 && x26 >= 0 && x28 + -1 * x26 >= 0 && x30 >= 0 && x29 + -1 * x30 >= 0 && x28 + -1 * x31 = 0 && 2 * x26 + x27 >= -1 && x28 + -2 * x26 + -1 * x27 >= 1 && x32 >= 0 && x31 + -1 * x32 >= 0 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (9) IntTRSCompressionProof (EQUIVALENT) 7.55/2.68 Compressed rules. 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (10) 7.55/2.68 Obligation: 7.55/2.68 Rules: 7.55/2.68 f6(x26:0, x27:0, x28:0) -> f6(4 * x26:0 + 3 * x27:0 + 4, x27:0 + 2, x28:0) :|: x32:0 > -1 && x31:0 + -1 * x32:0 >= 0 && x28:0 + -2 * x26:0 + -1 * x27:0 >= 1 && 2 * x26:0 + x27:0 >= -1 && x28:0 + -1 * x31:0 = 0 && x29:0 + -1 * x30:0 >= 0 && x30:0 > -1 && x28:0 + -1 * x26:0 >= 0 && x28:0 + -1 * x29:0 = 0 && x26:0 > -1 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (11) PolynomialOrderProcessor (EQUIVALENT) 7.55/2.68 Found the following polynomial interpretation: 7.55/2.68 [f6(x, x1, x2)] = -1 - x1 + x2 7.55/2.68 7.55/2.68 The following rules are decreasing: 7.55/2.68 f6(x26:0, x27:0, x28:0) -> f6(4 * x26:0 + 3 * x27:0 + 4, x27:0 + 2, x28:0) :|: x32:0 > -1 && x31:0 + -1 * x32:0 >= 0 && x28:0 + -2 * x26:0 + -1 * x27:0 >= 1 && 2 * x26:0 + x27:0 >= -1 && x28:0 + -1 * x31:0 = 0 && x29:0 + -1 * x30:0 >= 0 && x30:0 > -1 && x28:0 + -1 * x26:0 >= 0 && x28:0 + -1 * x29:0 = 0 && x26:0 > -1 7.55/2.68 The following rules are bounded: 7.55/2.68 f6(x26:0, x27:0, x28:0) -> f6(4 * x26:0 + 3 * x27:0 + 4, x27:0 + 2, x28:0) :|: x32:0 > -1 && x31:0 + -1 * x32:0 >= 0 && x28:0 + -2 * x26:0 + -1 * x27:0 >= 1 && 2 * x26:0 + x27:0 >= -1 && x28:0 + -1 * x31:0 = 0 && x29:0 + -1 * x30:0 >= 0 && x30:0 > -1 && x28:0 + -1 * x26:0 >= 0 && x28:0 + -1 * x29:0 = 0 && x26:0 > -1 7.55/2.68 7.55/2.68 ---------------------------------------- 7.55/2.68 7.55/2.68 (12) 7.55/2.68 YES 7.55/2.71 EOF