/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToIRSProof [EQUIVALENT, 0 ms]
(2) IntTRS
(3) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 [EQUIVALENT, 2317 ms]
(6) YES


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

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

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

(2)
Obligation:
Rules:
f1(x, y, N) -> f2(x_1, y, N) :|: TRUE
f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE
f12(x9, x10, x11) -> f15(arith, x10, x11) :|: TRUE && arith = 2 * x9 + x10
f15(x65, x66, x67) -> f16(x65, x68, x67) :|: TRUE && x68 = x66 + 1
f13(x69, x70, x71) -> f17(x72, x70, x71) :|: TRUE && x72 = x69 + 1
f11(x18, x19, x20) -> f12(x18, x19, x20) :|: x21 < 0
f11(x73, x74, x75) -> f12(x73, x74, x75) :|: x76 > 0
f11(x22, x23, x24) -> f13(x22, x23, x24) :|: x25 = 0
f16(x26, x27, x28) -> f14(x26, x27, x28) :|: TRUE
f17(x29, x30, x31) -> f14(x29, x30, x31) :|: TRUE
f8(x32, x33, x34) -> f11(x32, x33, x34) :|: x32 <= x34
f14(x35, x36, x37) -> f8(x35, x36, x37) :|: TRUE
f8(x38, x39, x40) -> f18(x38, x39, x40) :|: x38 > x40
f5(x41, x42, x43) -> f8(x41, x42, x43) :|: x41 + x42 >= 0
f5(x44, x45, x46) -> f9(x44, x45, x46) :|: x44 + x45 < 0
f18(x47, x48, x49) -> f10(x47, x48, x49) :|: TRUE
f9(x50, x51, x52) -> f10(x50, x51, x52) :|: TRUE
f4(x53, x54, x55) -> f5(x53, x54, x55) :|: x55 < 536870912 && x53 < 536870912 && x54 < 536870912 && x53 >= 0 - 1073741824
f4(x56, x57, x58) -> f6(x56, x57, x58) :|: x56 < 0 - 1073741824
f4(x77, x78, x79) -> f6(x77, x78, x79) :|: x78 >= 536870912
f4(x80, x81, x82) -> f6(x80, x81, x82) :|: x82 >= 536870912
f4(x83, x84, x85) -> f6(x83, x84, x85) :|: x83 >= 536870912
f10(x59, x60, x61) -> f7(x59, x60, x61) :|: TRUE
f6(x62, x63, x64) -> f7(x62, x63, x64) :|: TRUE
Start term: f1(x, y, N)

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

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

   (f1_3,1)
   (f2_3,2)
   (f3_3,3)
   (f4_3,4)
   (f12_3,5)
   (f15_3,6)
   (f16_3,7)
   (f13_3,8)
   (f17_3,9)
   (f11_3,10)
   (f14_3,11)
   (f8_3,12)
   (f18_3,13)
   (f5_3,14)
   (f9_3,15)
   (f10_3,16)
   (f6_3,17)
   (f7_3,18)

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

(4)
Obligation:
START: 1;

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

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

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

FROM: 5;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0 && oldX3 = 2 * oldX0 + oldX1);
x0 := oldX3;
x1 := oldX1;
x2 := oldX2;
TO: 6;

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

FROM: 8;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(-(oldX0 + 1));
assume(0 = 0 && oldX3 = oldX0 + 1);
x0 := -(-(oldX0 + 1));
x1 := oldX1;
x2 := oldX2;
TO: 9;

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

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

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

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

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

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

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

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

FROM: 14;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX0 + oldX1 >= 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 12;

FROM: 14;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX0 + oldX1 < 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 15;

FROM: 13;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 16;

FROM: 15;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 16;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX2 < 536870912 && oldX0 < 536870912 && oldX1 < 536870912 && oldX0 >= 0 - 1073741824);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 14;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX0 < 0 - 1073741824);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 17;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 >= 536870912);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 17;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX2 >= 536870912);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 17;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX0 >= 536870912);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 17;

FROM: 16;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 18;

FROM: 17;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 18;


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

(5) T2 (EQUIVALENT)
No proof given by T2
----------------------------------------

(6)
YES