/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, 1413 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(x, d1, d2, d1old) -> f2(x, 73, d2, d1old) :|: TRUE
f2(x1, x2, x3, x4) -> f3(x1, x2, 74, x4) :|: TRUE
f3(x5, x6, x7, x8) -> f4(x9, x6, x7, x8) :|: TRUE
f5(x10, x11, x12, x13) -> f6(arith, x11, x12, x13) :|: TRUE && arith = x10 - x11
f6(x14, x15, x16, x17) -> f7(x14, x15, x16, x15) :|: TRUE
f7(x38, x39, x40, x41) -> f8(x38, x42, x40, x41) :|: TRUE && x42 = x40 + 1
f8(x43, x44, x45, x46) -> f9(x43, x44, x47, x46) :|: TRUE && x47 = x46 + 1
f4(x26, x27, x28, x29) -> f5(x26, x27, x28, x29) :|: x26 >= 0
f9(x30, x31, x32, x33) -> f4(x30, x31, x32, x33) :|: TRUE
f4(x34, x35, x36, x37) -> f10(x34, x35, x36, x37) :|: x34 < 0
Start term: f1(x, d1, d2, d1old)

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

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

   (f1_4,1)
   (f2_4,2)
   (f3_4,3)
   (f4_4,4)
   (f5_4,5)
   (f6_4,6)
   (f7_4,7)
   (f8_4,8)
   (f9_4,9)
   (f10_4,10)

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

(4)
Obligation:
START: 1;

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

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

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

FROM: 5;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := -(oldX1 - oldX0);
assume(0 = 0 && oldX4 = oldX0 - oldX1);
x0 := -(oldX1 - oldX0);
x1 := oldX1;
x2 := oldX2;
x3 := oldX3;
TO: 6;

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

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

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

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

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

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


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

(5) T2 (EQUIVALENT)
Used the following cutpoint-specific lexicographic rank functions:
 * For cutpoint 6, used the following rank functions/bounds (in descending priority order):
    - RF x0, bound 0

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

(6)
YES