9.90/3.42	NO
9.90/3.43	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
9.90/3.43	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.90/3.43	
9.90/3.43	
9.90/3.43	Termination of the given C Problem could be disproven:
9.90/3.43	
9.90/3.43	(0) C Problem
9.90/3.43	(1) CToIRSProof [EQUIVALENT, 0 ms]
9.90/3.43	(2) IntTRS
9.90/3.43	(3) IRS2T2 [EQUIVALENT, 0 ms]
9.90/3.43	(4) T2IntSys
9.90/3.43	(5) T2 [COMPLETE, 1345 ms]
9.90/3.43	(6) NO
9.90/3.43	
9.90/3.43	
9.90/3.43	----------------------------------------
9.90/3.43	
9.90/3.43	(0)
9.90/3.43	Obligation:
9.90/3.43	c file /export/starexec/sandbox/benchmark/theBenchmark.c
9.90/3.43	----------------------------------------
9.90/3.43	
9.90/3.43	(1) CToIRSProof (EQUIVALENT)
9.90/3.43	Parsed C Integer Program as IRS.
9.90/3.43	----------------------------------------
9.90/3.43	
9.90/3.43	(2)
9.90/3.43	Obligation:
9.90/3.43	Rules:
9.90/3.43	f1(x) -> f2(x_1) :|: TRUE
9.90/3.43	f6(x1) -> f7(arith) :|: TRUE && arith = x1 - 2
9.90/3.43	f3(x2) -> f6(x2) :|: x2 < 0
9.90/3.43	f3(x9) -> f6(x9) :|: x9 > 0
9.90/3.43	f7(x3) -> f3(x3) :|: TRUE
9.90/3.43	f3(x4) -> f8(x4) :|: x4 = 0
9.90/3.43	f2(x5) -> f3(x5) :|: x5 > 0
9.90/3.43	f2(x6) -> f4(x6) :|: x6 <= 0
9.90/3.43	f8(x7) -> f5(x7) :|: TRUE
9.90/3.43	f4(x8) -> f5(x8) :|: TRUE
9.90/3.43	Start term: f1(x)
9.90/3.43	
9.90/3.43	----------------------------------------
9.90/3.43	
9.90/3.43	(3) IRS2T2 (EQUIVALENT)
9.90/3.43	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
9.90/3.43	
9.90/3.43	   (f1_1,1)
9.90/3.43	   (f2_1,2)
9.90/3.43	   (f6_1,3)
9.90/3.43	   (f7_1,4)
9.90/3.43	   (f3_1,5)
9.90/3.43	   (f8_1,6)
9.90/3.43	   (f4_1,7)
9.90/3.43	   (f5_1,8)
9.90/3.43	
9.90/3.43	----------------------------------------
9.90/3.43	
9.90/3.43	(4)
9.90/3.43	Obligation:
9.90/3.43	START: 1;
9.90/3.43	
9.90/3.43	FROM: 1;
9.90/3.43	oldX0 := x0;
9.90/3.43	oldX1 := nondet();
9.90/3.43	assume(0 = 0);
9.90/3.43	x0 := oldX1;
9.90/3.43	TO: 2;
9.90/3.43	
9.90/3.43	FROM: 3;
9.90/3.43	oldX0 := x0;
9.90/3.43	oldX1 := -(2 - oldX0);
9.90/3.43	assume(0 = 0 && oldX1 = oldX0 - 2);
9.90/3.43	x0 := -(2 - oldX0);
9.90/3.43	TO: 4;
9.90/3.43	
9.90/3.43	FROM: 5;
9.90/3.43	oldX0 := x0;
9.90/3.43	assume(oldX0 < 0);
9.90/3.43	x0 := oldX0;
9.90/3.43	TO: 3;
9.90/3.43	
9.90/3.43	FROM: 5;
9.90/3.43	oldX0 := x0;
9.90/3.43	assume(oldX0 > 0);
9.90/3.43	x0 := oldX0;
9.90/3.43	TO: 3;
9.90/3.43	
9.90/3.43	FROM: 4;
9.90/3.43	oldX0 := x0;
9.90/3.43	assume(0 = 0);
9.90/3.43	x0 := oldX0;
9.90/3.43	TO: 5;
9.90/3.43	
9.90/3.43	FROM: 5;
9.90/3.43	oldX0 := x0;
9.90/3.43	assume(oldX0 = 0);
9.90/3.43	x0 := oldX0;
9.90/3.43	TO: 6;
9.90/3.43	
9.90/3.43	FROM: 2;
9.90/3.43	oldX0 := x0;
9.90/3.43	assume(oldX0 > 0);
9.90/3.43	x0 := oldX0;
9.90/3.43	TO: 5;
9.90/3.43	
9.90/3.43	FROM: 2;
9.90/3.43	oldX0 := x0;
9.90/3.43	assume(oldX0 <= 0);
9.90/3.43	x0 := oldX0;
9.90/3.43	TO: 7;
9.90/3.43	
9.90/3.43	FROM: 6;
9.90/3.43	oldX0 := x0;
9.90/3.43	assume(0 = 0);
9.90/3.43	x0 := oldX0;
9.90/3.43	TO: 8;
9.90/3.43	
9.90/3.43	FROM: 7;
9.90/3.43	oldX0 := x0;
9.90/3.43	assume(0 = 0);
9.90/3.43	x0 := oldX0;
9.90/3.43	TO: 8;
9.90/3.43	
9.90/3.43	
9.90/3.43	----------------------------------------
9.90/3.43	
9.90/3.43	(5) T2 (COMPLETE)
9.90/3.43	Found this recurrent set for cutpoint 9: -1 <= oldX1 and x0-oldX1 <= 0 and x0+1 <= 0
9.90/3.43	
9.90/3.43	----------------------------------------
9.90/3.43	
9.90/3.43	(6)
9.90/3.43	NO
9.90/3.47	EOF