/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) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 [EQUIVALENT, 1572 ms]
(6) 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, x, y) -> f2(c, x_1, y) :|: TRUE
f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE
f3(x5, x6, x7) -> f4(0, x6, x7) :|: TRUE
f5(x8, x9, x10) -> f6(x8, x9, 1) :|: TRUE
f7(x11, x12, x13) -> f8(x11, x12, arith) :|: TRUE && arith = 2 * x13
f8(x38, x39, x40) -> f9(x41, x39, x40) :|: TRUE && x41 = x38 + 1
f6(x17, x18, x19) -> f7(x17, x18, x19) :|: x18 > x19
f9(x20, x21, x22) -> f6(x20, x21, x22) :|: TRUE
f6(x23, x24, x25) -> f10(x23, x24, x25) :|: x24 <= x25
f10(x42, x43, x44) -> f11(x42, x45, x44) :|: TRUE && x45 = x43 - 1
f4(x29, x30, x31) -> f5(x29, x30, x31) :|: x30 >= 0
f11(x32, x33, x34) -> f4(x32, x33, x34) :|: TRUE
f4(x35, x36, x37) -> f12(x35, x36, x37) :|: x36 < 0
Start term: f1(c, x, y)

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

(3) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f1_3,1)
   (f2_3,2)
   (f3_3,3)
   (f4_3,4)
   (f5_3,5)
   (f6_3,6)
   (f7_3,7)
   (f8_3,8)
   (f9_3,9)
   (f10_3,10)
   (f11_3,11)
   (f12_3,12)

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

(4)
Obligation:
START: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX0;
x1 := oldX3;
x2 := oldX2;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX3;
TO: 3;

FROM: 3;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := 0;
x1 := oldX1;
x2 := oldX2;
TO: 4;

FROM: 5;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := 1;
TO: 6;

FROM: 7;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0 && oldX3 = 2 * oldX2);
x0 := oldX0;
x1 := oldX1;
x2 := oldX3;
TO: 8;

FROM: 8;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(-(oldX0 + 1));
assume(0 = 0 && oldX3 = oldX0 + 1);
x0 := -(-(oldX0 + 1));
x1 := oldX1;
x2 := oldX2;
TO: 9;

FROM: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 > oldX2);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 7;

FROM: 9;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 6;

FROM: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 <= oldX2);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 10;

FROM: 10;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(1 - oldX1);
assume(0 = 0 && oldX3 = oldX1 - 1);
x0 := oldX0;
x1 := -(1 - oldX1);
x2 := oldX2;
TO: 11;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 >= 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 5;

FROM: 11;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 4;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 < 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 12;


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

(5) T2 (EQUIVALENT)
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 9, 14, 17, 18 using the following rank functions:
    - Rank function 1:
      RF for loc. 8: 2*x1
      RF for loc. 9: 2*x1
      RF for loc. 13: 1+2*x1
      Bound for (chained) transitions 17: 1
    - Rank function 2:
      RF for loc. 8: 2*x1
      RF for loc. 9: 2*x1
      RF for loc. 13: 1+2*x1
      Bound for (chained) transitions 18: 1
    - Rank function 3:
      RF for loc. 8: 0
      RF for loc. 9: 0
      RF for loc. 13: -1
      Bound for (chained) transitions 9, 14: 0
Used the following cutpoint-specific lexicographic rank functions:
 * For cutpoint 8, used the following rank functions/bounds (in descending priority order):
    - RF -x2+oldX1, bound 1

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

(6)
YES