/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


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


NO
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be disproven:

(0) C Problem
(1) CToIRSProof [EQUIVALENT, 0 ms]
(2) IntTRS
(3) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 [COMPLETE, 1353 ms]
(6) NO


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

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

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

(2)
Obligation:
Rules:
f1(i, j) -> f2(x_1, j) :|: TRUE
f3(x, x1) -> f4(x, x) :|: TRUE
f5(x2, x3) -> f6(x2, arith) :|: TRUE && arith = x3 + 1
f4(x4, x5) -> f5(x4, x5) :|: x5 > 0
f6(x6, x7) -> f4(x6, x7) :|: TRUE
f4(x8, x9) -> f7(x8, x9) :|: x9 <= 0
f7(x18, x19) -> f8(x20, x19) :|: TRUE && x20 = x18 + 1
f2(x12, x13) -> f3(x12, x13) :|: x12 < 10
f8(x14, x15) -> f2(x14, x15) :|: TRUE
f2(x16, x17) -> f9(x16, x17) :|: x16 >= 10
Start term: f1(i, j)

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

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

   (f1_2,1)
   (f2_2,2)
   (f3_2,3)
   (f4_2,4)
   (f5_2,5)
   (f6_2,6)
   (f7_2,7)
   (f8_2,8)
   (f9_2,9)

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

(4)
Obligation:
START: 1;

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

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

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

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

FROM: 6;
oldX0 := x0;
oldX1 := x1;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
TO: 4;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
assume(oldX1 <= 0);
x0 := oldX0;
x1 := oldX1;
TO: 7;

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

FROM: 2;
oldX0 := x0;
oldX1 := x1;
assume(oldX0 < 10);
x0 := oldX0;
x1 := oldX1;
TO: 3;

FROM: 8;
oldX0 := x0;
oldX1 := x1;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
assume(oldX0 >= 10);
x0 := oldX0;
x1 := oldX1;
TO: 9;


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

(5) T2 (COMPLETE)
Found this recurrent set for cutpoint 8: oldX0 <= 9 and oldX2 <= 9 and x0 <= 9 and oldX0-x1 <= 0 and oldX2-oldX0 <= 0 and oldX0-oldX2 <= 0 and oldX2+oldX0 <= 18 and oldX2-x0 <= 0 and x0-oldX2 <= 0 and oldX2+x0 <= 18 and oldX2-x1 <= 0 and x0-oldX0 <= 0 and oldX0-x0 <= 0 and x0+oldX0 <= 18 and x0-x1 <= 0 and -x1+1 <= 0

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

(6)
NO