/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, 1563 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(n, i, j, t) -> f2(x_1, i, j, t) :|: TRUE
f2(x, x1, x2, x3) -> f3(x, 0, x2, x3) :|: TRUE
f3(x4, x5, x6, x7) -> f4(x4, x5, 1, x7) :|: TRUE
f4(x8, x9, x10, x11) -> f5(x8, x9, x10, 0) :|: TRUE
f6(x12, x13, x14, x15) -> f7(x12, x13, x14, arith) :|: TRUE && arith = x14 + x13
f7(x16, x17, x18, x19) -> f8(x16, x18, x18, x19) :|: TRUE
f8(x20, x21, x22, x23) -> f9(x20, x21, x23, x23) :|: TRUE
f5(x24, x25, x26, x27) -> f6(x24, x25, x26, x27) :|: x26 < x24
f5(x36, x37, x38, x39) -> f6(x36, x37, x38, x39) :|: x38 > x36
f9(x28, x29, x30, x31) -> f5(x28, x29, x30, x31) :|: TRUE
f5(x32, x33, x34, x35) -> f10(x32, x33, x34, x35) :|: x34 = x32
Start term: f1(n, i, j, t)

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

(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;
oldX4 := nondet();
assume(0 = 0);
x0 := oldX4;
x1 := oldX1;
x2 := oldX2;
x3 := oldX3;
TO: 2;

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

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

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

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

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

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

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

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

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

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


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

(5) T2 (COMPLETE)
Found this recurrent set for cutpoint 7: 0 <= oldX1 and 1 <= oldX2 and 0 <= x1 and 1 <= x2 and 0 <= x3 and oldX1-oldX2 <= 0 and 1 <= oldX1+oldX2 and oldX1-x2 <= 0 and 1 <= oldX1+x2 and oldX1-x3 <= 0 and 0 <= oldX1+x3 and oldX2-x3 <= 1 and x3-oldX2 <= 0 and 1 <= oldX2+x3 and oldX4-x0 <= 0 and x0-oldX4 <= 0 and x1-oldX1 <= 0 and oldX1-x1 <= 0 and 0 <= x1+oldX1 and x1-oldX2 <= 0 and 1 <= x1+oldX2 and x1-x2 <= 0 and 1 <= x1+x2 and x1-x3 <= 0 and 0 <= x1+x3 and x2-oldX2 <= 0 and oldX2-x2 <= 0 and 2 <= x2+oldX2 and x2-x3 <= 1 and x3-x2 <= 0 and 1 <= x2+x3 and 0 <= 0

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

(6)
NO