NO
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 1359 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(x) -> f2(x_1) :|: TRUE
f4(x1) -> f7(arith) :|: TRUE && arith = x1 - 1
f5(x12) -> f8(x13) :|: TRUE && x13 = x12 + 1
f3(x3) -> f4(x3) :|: x4 < 0
f3(x14) -> f4(x14) :|: x15 > 0
f3(x5) -> f5(x5) :|: x6 = 0
f7(x7) -> f6(x7) :|: TRUE
f8(x8) -> f6(x8) :|: TRUE
f2(x9) -> f3(x9) :|: x9 >= 0
f6(x10) -> f2(x10) :|: TRUE
f2(x11) -> f9(x11) :|: x11 < 0
Start term: f1(x)

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

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

   (f1_1,1)
   (f2_1,2)
   (f4_1,3)
   (f7_1,4)
   (f5_1,5)
   (f8_1,6)
   (f3_1,7)
   (f6_1,8)
   (f9_1,9)

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

(4)
Obligation:
START: 1;

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

FROM: 3;
oldX0 := x0;
oldX1 := -(1 - oldX0);
assume(0 = 0 && oldX1 = oldX0 - 1);
x0 := -(1 - oldX0);
TO: 4;

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

FROM: 7;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 < 0);
x0 := oldX0;
TO: 3;

FROM: 7;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 > 0);
x0 := oldX0;
TO: 3;

FROM: 7;
oldX0 := x0;
oldX1 := -(0);
assume(oldX1 = 0);
x0 := oldX0;
TO: 5;

FROM: 4;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 8;

FROM: 6;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 8;

FROM: 2;
oldX0 := x0;
assume(oldX0 >= 0);
x0 := oldX0;
TO: 7;

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

FROM: 2;
oldX0 := x0;
assume(oldX0 < 0);
x0 := oldX0;
TO: 9;


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

(5) T2 (COMPLETE)
Found this recurrent set for cutpoint 9: oldX1-x0 <= 0 and 0 <= 0

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

(6)
NO