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