8.86/3.16	NO
9.17/3.18	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
9.17/3.18	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.17/3.18	
9.17/3.18	
9.17/3.18	Termination of the given C Problem could be disproven:
9.17/3.18	
9.17/3.18	(0) C Problem
9.17/3.18	(1) CToIRSProof [EQUIVALENT, 0 ms]
9.17/3.18	(2) IntTRS
9.17/3.18	(3) IRS2T2 [EQUIVALENT, 0 ms]
9.17/3.18	(4) T2IntSys
9.17/3.18	(5) T2 [COMPLETE, 1256 ms]
9.17/3.18	(6) NO
9.17/3.18	
9.17/3.18	
9.17/3.18	----------------------------------------
9.17/3.18	
9.17/3.18	(0)
9.17/3.18	Obligation:
9.17/3.18	c file /export/starexec/sandbox/benchmark/theBenchmark.c
9.17/3.18	----------------------------------------
9.17/3.18	
9.17/3.18	(1) CToIRSProof (EQUIVALENT)
9.17/3.18	Parsed C Integer Program as IRS.
9.17/3.18	----------------------------------------
9.17/3.18	
9.17/3.18	(2)
9.17/3.18	Obligation:
9.17/3.18	Rules:
9.17/3.18	f1(i) -> f2(x_1) :|: TRUE
9.17/3.18	f7(x) -> f10(arith) :|: TRUE && arith = x + 1
9.17/3.18	f4(x1) -> f7(x1) :|: x1 < 0
9.17/3.18	f4(x2) -> f8(x2) :|: x2 >= 0
9.17/3.18	f10(x3) -> f9(x3) :|: TRUE
9.17/3.18	f8(x4) -> f9(x4) :|: TRUE
9.17/3.18	f11(x17) -> f14(x18) :|: TRUE && x18 = x17 - 1
9.17/3.18	f9(x6) -> f11(x6) :|: x6 > 0
9.17/3.18	f9(x7) -> f12(x7) :|: x7 <= 0
9.17/3.18	f14(x8) -> f13(x8) :|: TRUE
9.17/3.18	f12(x9) -> f13(x9) :|: TRUE
9.17/3.18	f3(x10) -> f4(x10) :|: x10 > 0 - 5 && x10 < 5
9.17/3.18	f3(x11) -> f5(x11) :|: x11 <= 0 - 5
9.17/3.18	f3(x19) -> f5(x19) :|: x19 >= 5
9.17/3.18	f13(x12) -> f6(x12) :|: TRUE
9.17/3.18	f5(x13) -> f6(x13) :|: TRUE
9.17/3.18	f2(x14) -> f3(x14) :|: x14 < 0
9.17/3.18	f2(x20) -> f3(x20) :|: x20 > 0
9.17/3.18	f6(x15) -> f2(x15) :|: TRUE
9.17/3.18	f2(x16) -> f15(x16) :|: x16 = 0
9.17/3.18	Start term: f1(i)
9.17/3.18	
9.17/3.18	----------------------------------------
9.17/3.18	
9.17/3.18	(3) IRS2T2 (EQUIVALENT)
9.17/3.18	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
9.17/3.18	
9.17/3.18	   (f1_1,1)
9.17/3.18	   (f2_1,2)
9.17/3.18	   (f7_1,3)
9.17/3.18	   (f10_1,4)
9.17/3.18	   (f4_1,5)
9.17/3.18	   (f8_1,6)
9.17/3.18	   (f9_1,7)
9.17/3.18	   (f11_1,8)
9.17/3.18	   (f14_1,9)
9.17/3.18	   (f12_1,10)
9.17/3.18	   (f13_1,11)
9.17/3.18	   (f3_1,12)
9.17/3.18	   (f5_1,13)
9.17/3.18	   (f6_1,14)
9.17/3.18	   (f15_1,15)
9.17/3.18	
9.17/3.18	----------------------------------------
9.17/3.18	
9.17/3.18	(4)
9.17/3.18	Obligation:
9.17/3.18	START: 1;
9.17/3.18	
9.17/3.18	FROM: 1;
9.17/3.18	oldX0 := x0;
9.17/3.18	oldX1 := nondet();
9.17/3.18	assume(0 = 0);
9.17/3.18	x0 := oldX1;
9.17/3.18	TO: 2;
9.17/3.18	
9.17/3.18	FROM: 3;
9.17/3.18	oldX0 := x0;
9.17/3.18	oldX1 := -(-(oldX0 + 1));
9.17/3.18	assume(0 = 0 && oldX1 = oldX0 + 1);
9.17/3.18	x0 := -(-(oldX0 + 1));
9.17/3.18	TO: 4;
9.17/3.18	
9.17/3.18	FROM: 5;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 < 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 3;
9.17/3.18	
9.17/3.18	FROM: 5;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 >= 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 6;
9.17/3.18	
9.17/3.18	FROM: 4;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(0 = 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 7;
9.17/3.18	
9.17/3.18	FROM: 6;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(0 = 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 7;
9.17/3.18	
9.17/3.18	FROM: 8;
9.17/3.18	oldX0 := x0;
9.17/3.18	oldX1 := -(1 - oldX0);
9.17/3.18	assume(0 = 0 && oldX1 = oldX0 - 1);
9.17/3.18	x0 := -(1 - oldX0);
9.17/3.18	TO: 9;
9.17/3.18	
9.17/3.18	FROM: 7;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 > 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 8;
9.17/3.18	
9.17/3.18	FROM: 7;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 <= 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 10;
9.17/3.18	
9.17/3.18	FROM: 9;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(0 = 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 11;
9.17/3.18	
9.17/3.18	FROM: 10;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(0 = 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 11;
9.17/3.18	
9.17/3.18	FROM: 12;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 > 0 - 5 && oldX0 < 5);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 5;
9.17/3.18	
9.17/3.18	FROM: 12;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 <= 0 - 5);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 13;
9.17/3.18	
9.17/3.18	FROM: 12;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 >= 5);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 13;
9.17/3.18	
9.17/3.18	FROM: 11;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(0 = 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 14;
9.17/3.18	
9.17/3.18	FROM: 13;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(0 = 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 14;
9.17/3.18	
9.17/3.18	FROM: 2;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 < 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 12;
9.17/3.18	
9.17/3.18	FROM: 2;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 > 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 12;
9.17/3.18	
9.17/3.18	FROM: 14;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(0 = 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 2;
9.17/3.18	
9.17/3.18	FROM: 2;
9.17/3.18	oldX0 := x0;
9.17/3.18	assume(oldX0 = 0);
9.17/3.18	x0 := oldX0;
9.17/3.18	TO: 15;
9.17/3.18	
9.17/3.18	
9.17/3.18	----------------------------------------
9.17/3.18	
9.17/3.18	(5) T2 (COMPLETE)
9.17/3.18	Found this recurrent set for cutpoint 12: oldX1 == 5 and x0 == 5
9.17/3.18	
9.17/3.18	----------------------------------------
9.17/3.18	
9.17/3.18	(6)
9.17/3.18	NO
9.24/3.23	EOF