8.91/3.16	NO
8.91/3.17	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
8.91/3.17	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
8.91/3.17	
8.91/3.17	
8.91/3.17	Termination of the given C Problem could be disproven:
8.91/3.17	
8.91/3.17	(0) C Problem
8.91/3.17	(1) CToIRSProof [EQUIVALENT, 0 ms]
8.91/3.17	(2) IntTRS
8.91/3.17	(3) IRS2T2 [EQUIVALENT, 0 ms]
8.91/3.17	(4) T2IntSys
8.91/3.17	(5) T2 [COMPLETE, 1314 ms]
8.91/3.17	(6) NO
8.91/3.17	
8.91/3.17	
8.91/3.17	----------------------------------------
8.91/3.17	
8.91/3.17	(0)
8.91/3.17	Obligation:
8.91/3.17	c file /export/starexec/sandbox/benchmark/theBenchmark.c
8.91/3.17	----------------------------------------
8.91/3.17	
8.91/3.17	(1) CToIRSProof (EQUIVALENT)
8.91/3.17	Parsed C Integer Program as IRS.
8.91/3.17	----------------------------------------
8.91/3.17	
8.91/3.17	(2)
8.91/3.17	Obligation:
8.91/3.17	Rules:
8.91/3.17	f1(y1, y2) -> f2(x_1, y2) :|: TRUE
8.91/3.17	f2(x, x1) -> f3(x, x2) :|: TRUE
8.91/3.17	f8(x3, x4) -> f11(arith, x4) :|: TRUE && arith = x3 - x4
8.91/3.17	f9(x29, x30) -> f12(x29, x31) :|: TRUE && x31 = x30 - x29
8.91/3.17	f7(x7, x8) -> f8(x7, x8) :|: x7 > x8
8.91/3.17	f7(x9, x10) -> f9(x9, x10) :|: x9 <= x10
8.91/3.17	f11(x11, x12) -> f10(x11, x12) :|: TRUE
8.91/3.17	f12(x13, x14) -> f10(x13, x14) :|: TRUE
8.91/3.17	f4(x15, x16) -> f7(x15, x16) :|: x15 < x16
8.91/3.17	f4(x32, x33) -> f7(x32, x33) :|: x32 > x33
8.91/3.17	f10(x17, x18) -> f4(x17, x18) :|: TRUE
8.91/3.17	f4(x19, x20) -> f13(x19, x20) :|: x19 = x20
8.91/3.17	f3(x21, x22) -> f4(x21, x22) :|: x21 >= 0 && x22 >= 0
8.91/3.17	f3(x23, x24) -> f5(x23, x24) :|: x23 < 0
8.91/3.17	f3(x34, x35) -> f5(x34, x35) :|: x35 < 0
8.91/3.17	f13(x25, x26) -> f6(x25, x26) :|: TRUE
8.91/3.17	f5(x27, x28) -> f6(x27, x28) :|: TRUE
8.91/3.17	Start term: f1(y1, y2)
8.91/3.17	
8.91/3.17	----------------------------------------
8.91/3.17	
8.91/3.17	(3) IRS2T2 (EQUIVALENT)
8.91/3.17	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
8.91/3.17	
8.91/3.17	   (f1_2,1)
8.91/3.17	   (f2_2,2)
8.91/3.17	   (f3_2,3)
8.91/3.17	   (f8_2,4)
8.91/3.17	   (f11_2,5)
8.91/3.17	   (f9_2,6)
8.91/3.17	   (f12_2,7)
8.91/3.17	   (f7_2,8)
8.91/3.17	   (f10_2,9)
8.91/3.17	   (f4_2,10)
8.91/3.17	   (f13_2,11)
8.91/3.17	   (f5_2,12)
8.91/3.17	   (f6_2,13)
8.91/3.17	
8.91/3.17	----------------------------------------
8.91/3.17	
8.91/3.17	(4)
8.91/3.17	Obligation:
8.91/3.17	START: 1;
8.91/3.17	
8.91/3.17	FROM: 1;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	oldX2 := nondet();
8.91/3.17	assume(0 = 0);
8.91/3.17	x0 := oldX2;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 2;
8.91/3.17	
8.91/3.17	FROM: 2;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	oldX2 := nondet();
8.91/3.17	assume(0 = 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX2;
8.91/3.17	TO: 3;
8.91/3.17	
8.91/3.17	FROM: 4;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	oldX2 := -(oldX1 - oldX0);
8.91/3.17	assume(0 = 0 && oldX2 = oldX0 - oldX1);
8.91/3.17	x0 := -(oldX1 - oldX0);
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 5;
8.91/3.17	
8.91/3.17	FROM: 6;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	oldX2 := -(oldX0 - oldX1);
8.91/3.17	assume(0 = 0 && oldX2 = oldX1 - oldX0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := -(oldX0 - oldX1);
8.91/3.17	TO: 7;
8.91/3.17	
8.91/3.17	FROM: 8;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(oldX0 > oldX1);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 4;
8.91/3.17	
8.91/3.17	FROM: 8;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(oldX0 <= oldX1);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 6;
8.91/3.17	
8.91/3.17	FROM: 5;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(0 = 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 9;
8.91/3.17	
8.91/3.17	FROM: 7;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(0 = 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 9;
8.91/3.17	
8.91/3.17	FROM: 10;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(oldX0 < oldX1);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 8;
8.91/3.17	
8.91/3.17	FROM: 10;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(oldX0 > oldX1);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 8;
8.91/3.17	
8.91/3.17	FROM: 9;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(0 = 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 10;
8.91/3.17	
8.91/3.17	FROM: 10;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(oldX0 = oldX1);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 11;
8.91/3.17	
8.91/3.17	FROM: 3;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(oldX0 >= 0 && oldX1 >= 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 10;
8.91/3.17	
8.91/3.17	FROM: 3;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(oldX0 < 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 12;
8.91/3.17	
8.91/3.17	FROM: 3;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(oldX1 < 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 12;
8.91/3.17	
8.91/3.17	FROM: 11;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(0 = 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 13;
8.91/3.17	
8.91/3.17	FROM: 12;
8.91/3.17	oldX0 := x0;
8.91/3.17	oldX1 := x1;
8.91/3.17	assume(0 = 0);
8.91/3.17	x0 := oldX0;
8.91/3.17	x1 := oldX1;
8.91/3.17	TO: 13;
8.91/3.17	
8.91/3.17	
8.91/3.17	----------------------------------------
8.91/3.17	
8.91/3.17	(5) T2 (COMPLETE)
8.91/3.17	Found this recurrent set for cutpoint 12: oldX2 == 0 and x0 == 1 and x1 == 0
8.91/3.17	
8.91/3.17	----------------------------------------
8.91/3.17	
8.91/3.17	(6)
8.91/3.17	NO
9.27/3.22	EOF