8.93/3.04	NO
9.16/3.06	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
9.16/3.06	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.16/3.06	
9.16/3.06	
9.16/3.06	Termination of the given C Problem could be disproven:
9.16/3.06	
9.16/3.06	(0) C Problem
9.16/3.06	(1) CToIRSProof [EQUIVALENT, 0 ms]
9.16/3.06	(2) IntTRS
9.16/3.06	(3) IRS2T2 [EQUIVALENT, 0 ms]
9.16/3.06	(4) T2IntSys
9.16/3.06	(5) T2 [COMPLETE, 1293 ms]
9.16/3.06	(6) NO
9.16/3.06	
9.16/3.06	
9.16/3.06	----------------------------------------
9.16/3.06	
9.16/3.06	(0)
9.16/3.06	Obligation:
9.16/3.06	c file /export/starexec/sandbox/benchmark/theBenchmark.c
9.16/3.06	----------------------------------------
9.16/3.06	
9.16/3.06	(1) CToIRSProof (EQUIVALENT)
9.16/3.06	Parsed C Integer Program as IRS.
9.16/3.06	----------------------------------------
9.16/3.06	
9.16/3.06	(2)
9.16/3.06	Obligation:
9.16/3.06	Rules:
9.16/3.06	f1(x, y) -> f2(x_1, y) :|: TRUE
9.16/3.06	f2(x1, x2) -> f3(x1, x3) :|: TRUE
9.16/3.06	f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = x4 + x5
9.16/3.06	f5(x14, x15) -> f6(x14, x16) :|: TRUE && x16 = 0 - 2 * x15
9.16/3.06	f3(x8, x9) -> f4(x8, x9) :|: x8 < x9
9.16/3.06	f6(x10, x11) -> f3(x10, x11) :|: TRUE
9.16/3.06	f3(x12, x13) -> f7(x12, x13) :|: x12 >= x13
9.16/3.06	Start term: f1(x, y)
9.16/3.06	
9.16/3.06	----------------------------------------
9.16/3.06	
9.16/3.06	(3) IRS2T2 (EQUIVALENT)
9.16/3.06	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
9.16/3.06	
9.16/3.06	   (f1_2,1)
9.16/3.06	   (f2_2,2)
9.16/3.06	   (f3_2,3)
9.16/3.06	   (f4_2,4)
9.16/3.06	   (f5_2,5)
9.16/3.06	   (f6_2,6)
9.16/3.06	   (f7_2,7)
9.16/3.06	
9.16/3.06	----------------------------------------
9.16/3.06	
9.16/3.06	(4)
9.16/3.06	Obligation:
9.16/3.06	START: 1;
9.16/3.06	
9.16/3.06	FROM: 1;
9.16/3.06	oldX0 := x0;
9.16/3.06	oldX1 := x1;
9.16/3.06	oldX2 := nondet();
9.16/3.06	assume(0 = 0);
9.16/3.06	x0 := oldX2;
9.16/3.06	x1 := oldX1;
9.16/3.06	TO: 2;
9.16/3.06	
9.16/3.06	FROM: 2;
9.16/3.06	oldX0 := x0;
9.16/3.06	oldX1 := x1;
9.16/3.06	oldX2 := nondet();
9.16/3.06	assume(0 = 0);
9.16/3.06	x0 := oldX0;
9.16/3.06	x1 := oldX2;
9.16/3.06	TO: 3;
9.16/3.06	
9.16/3.06	FROM: 4;
9.16/3.06	oldX0 := x0;
9.16/3.06	oldX1 := x1;
9.16/3.06	oldX2 := -(-(oldX0 + oldX1));
9.16/3.06	assume(0 = 0 && oldX2 = oldX0 + oldX1);
9.16/3.06	x0 := -(-(oldX0 + oldX1));
9.16/3.06	x1 := oldX1;
9.16/3.06	TO: 5;
9.16/3.06	
9.16/3.06	FROM: 5;
9.16/3.06	oldX0 := x0;
9.16/3.06	oldX1 := x1;
9.16/3.06	oldX2 := nondet();
9.16/3.06	assume(0 = 0 && oldX2 = 0 - 2 * oldX1);
9.16/3.06	x0 := oldX0;
9.16/3.06	x1 := oldX2;
9.16/3.06	TO: 6;
9.16/3.06	
9.16/3.06	FROM: 3;
9.16/3.06	oldX0 := x0;
9.16/3.06	oldX1 := x1;
9.16/3.06	assume(oldX0 < oldX1);
9.16/3.06	x0 := oldX0;
9.16/3.06	x1 := oldX1;
9.16/3.06	TO: 4;
9.16/3.06	
9.16/3.06	FROM: 6;
9.16/3.06	oldX0 := x0;
9.16/3.06	oldX1 := x1;
9.16/3.06	assume(0 = 0);
9.16/3.06	x0 := oldX0;
9.16/3.06	x1 := oldX1;
9.16/3.06	TO: 3;
9.16/3.06	
9.16/3.06	FROM: 3;
9.16/3.06	oldX0 := x0;
9.16/3.06	oldX1 := x1;
9.16/3.06	assume(oldX0 >= oldX1);
9.16/3.06	x0 := oldX0;
9.16/3.06	x1 := oldX1;
9.16/3.06	TO: 7;
9.16/3.06	
9.16/3.06	
9.16/3.06	----------------------------------------
9.16/3.06	
9.16/3.06	(5) T2 (COMPLETE)
9.16/3.06	Found this recurrent set for cutpoint 6: oldX2 == 0 and x0 == -1 and x1 == 0
9.16/3.06	
9.16/3.06	----------------------------------------
9.16/3.06	
9.16/3.06	(6)
9.16/3.06	NO
9.16/3.11	EOF