/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, 1727 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(choose, life, death, temp) -> f2(2, life, death, temp) :|: TRUE
f2(x, x1, x2, x3) -> f3(x, 13, x2, x3) :|: TRUE
f3(x4, x5, x6, x7) -> f4(x4, x5, 17, x7) :|: TRUE
f5(x8, x9, x10, x11) -> f6(x8, x9, x10, x10) :|: TRUE
f6(x12, x13, x14, x15) -> f7(x12, x13, arith, x15) :|: TRUE && arith = x13 + 1
f7(x16, x17, x18, x19) -> f8(x16, x19, x18, x19) :|: TRUE
f9(x20, x21, x22, x23) -> f12(x20, x20, x22, x23) :|: TRUE
f8(x24, x25, x26, x27) -> f9(x24, x25, x26, x27) :|: x24 < x25
f8(x52, x53, x54, x55) -> f9(x52, x53, x54, x55) :|: x52 < x54
f8(x28, x29, x30, x31) -> f10(x28, x29, x30, x31) :|: x28 >= x29 && x28 >= x30
f12(x32, x33, x34, x35) -> f11(x32, x33, x34, x35) :|: TRUE
f10(x36, x37, x38, x39) -> f11(x36, x37, x38, x39) :|: TRUE
f4(x40, x41, x42, x43) -> f5(x40, x41, x42, x43) :|: x41 < x42
f11(x44, x45, x46, x47) -> f4(x44, x45, x46, x47) :|: TRUE
f4(x48, x49, x50, x51) -> f13(x48, x49, x50, x51) :|: x49 >= x50
Start term: f1(choose, life, death, temp)

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

(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)
   (f12_4,10)
   (f10_4,11)
   (f11_4,12)
   (f13_4,13)

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

(4)
Obligation:
START: 1;

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

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

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

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

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

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

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

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

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

FROM: 8;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
assume(oldX0 >= oldX1 && oldX0 >= oldX2);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
x3 := oldX3;
TO: 11;

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

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

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

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

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


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

(5) T2 (COMPLETE)
Found this recurrent set for cutpoint 9: 2 <= oldX0 and oldX0 <= 2 and 0 <= oldX1 and oldX1 <= 13 and 2 <= x0 and x0 <= 2 and 0 <= x1 and x1 <= 13 and 0 <= x2 and x2 <= 17 and oldX0-oldX1 <= 0 and oldX1-oldX0 <= 11 and oldX0+oldX1 <= 15 and 0 <= oldX0+oldX1 and oldX0-x1 <= 0 and x1-oldX0 <= 11 and oldX0+x1 <= 15 and 0 <= oldX0+x1 and oldX0-x2 <= 0 and x2-oldX0 <= 15 and oldX0+x2 <= 19 and 0 <= oldX0+x2 and oldX1-x2 <= 0 and oldX1+x2 <= 30 and 0 <= oldX1+x2 and x0-oldX0 <= 0 and oldX0-x0 <= 0 and x0+oldX0 <= 4 and 4 <= x0+oldX0 and x0-oldX1 <= 0 and oldX1-x0 <= 11 and x0+oldX1 <= 15 and 0 <= x0+oldX1 and x0-x1 <= 0 and x1-x0 <= 11 and x0+x1 <= 15 and 0 <= x0+x1 and x0-x2 <= 0 and x2-x0 <= 15 and x0+x2 <= 19 and 0 <= x0+x2 and x1-oldX1 <= 0 and oldX1-x1 <= 0 and x1+oldX1 <= 26 and 0 <= x1+oldX1 and x1-x2 <= 0 and x1+x2 <= 30 and 0 <= x1+x2 and -x2+x1+1 <= 0

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

(6)
NO