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