/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, 5 ms]
(4) T2IntSys
(5) T2 [COMPLETE, 1387 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) -> f2(x_1) :|: TRUE
f7(x) -> f10(arith) :|: TRUE && arith = 0 - 5
f11(x1) -> f14(35) :|: TRUE
f12(x19) -> f15(x20) :|: TRUE && x20 = x19 - 1
f8(x3) -> f11(x3) :|: x3 > 30
f8(x4) -> f12(x4) :|: x4 <= 30
f14(x5) -> f13(x5) :|: TRUE
f15(x6) -> f13(x6) :|: TRUE
f4(x7) -> f7(x7) :|: x7 < 0
f4(x8) -> f8(x8) :|: x8 >= 0
f10(x9) -> f9(x9) :|: TRUE
f13(x10) -> f9(x10) :|: TRUE
f5(x11) -> f16(0) :|: TRUE
f3(x12) -> f4(x12) :|: 0 - 5 <= x12 && x12 <= 35
f3(x13) -> f5(x13) :|: 0 - 5 > x13
f3(x21) -> f5(x21) :|: x21 > 35
f9(x14) -> f6(x14) :|: TRUE
f16(x15) -> f6(x15) :|: TRUE
f2(x16) -> f3(x16) :|: x16 < 0
f2(x22) -> f3(x22) :|: x22 > 0
f6(x17) -> f2(x17) :|: TRUE
f2(x18) -> f17(x18) :|: x18 = 0
Start term: f1(i)

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

(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)
   (f7_1,3)
   (f10_1,4)
   (f11_1,5)
   (f14_1,6)
   (f12_1,7)
   (f15_1,8)
   (f8_1,9)
   (f13_1,10)
   (f4_1,11)
   (f9_1,12)
   (f5_1,13)
   (f16_1,14)
   (f3_1,15)
   (f6_1,16)
   (f17_1,17)

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

(4)
Obligation:
START: 1;

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

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

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

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

FROM: 9;
oldX0 := x0;
assume(oldX0 > 30);
x0 := oldX0;
TO: 5;

FROM: 9;
oldX0 := x0;
assume(oldX0 <= 30);
x0 := oldX0;
TO: 7;

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

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

FROM: 11;
oldX0 := x0;
assume(oldX0 < 0);
x0 := oldX0;
TO: 3;

FROM: 11;
oldX0 := x0;
assume(oldX0 >= 0);
x0 := oldX0;
TO: 9;

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

FROM: 10;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 12;

FROM: 13;
oldX0 := x0;
assume(0 = 0);
x0 := 0;
TO: 14;

FROM: 15;
oldX0 := x0;
assume(0 - 5 <= oldX0 && oldX0 <= 35);
x0 := oldX0;
TO: 11;

FROM: 15;
oldX0 := x0;
assume(0 - 5 > oldX0);
x0 := oldX0;
TO: 13;

FROM: 15;
oldX0 := x0;
assume(oldX0 > 35);
x0 := oldX0;
TO: 13;

FROM: 12;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 16;

FROM: 14;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 16;

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

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

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

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


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

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

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

(6)
NO