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