NO
proof of /export/starexec/sandbox2/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, 4 ms]
(4) T2IntSys
(5) T2 [COMPLETE, 1396 ms]
(6) NO


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

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

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

(2)
Obligation:
Rules:
f1(n, sum) -> f2(x_1, sum) :|: TRUE
f2(x, x1) -> f3(x, 0) :|: TRUE
f4(x2, x3) -> f5(x2, arith) :|: TRUE && arith = x3 + x2
f5(x12, x13) -> f6(x14, x13) :|: TRUE && x14 = x12 - 1
f3(x6, x7) -> f4(x6, x7) :|: x6 < 0
f3(x15, x16) -> f4(x15, x16) :|: x15 > 0
f6(x8, x9) -> f3(x8, x9) :|: TRUE
f3(x10, x11) -> f7(x10, x11) :|: x10 = 0
Start term: f1(n, sum)

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

(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)

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

(4)
Obligation:
START: 1;

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

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

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

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

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

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

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

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


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

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

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

(6)
NO