9.13/3.20	YES
9.67/3.32	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
9.67/3.32	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.67/3.32	
9.67/3.32	
9.67/3.32	Termination of the given C Problem could be proven:
9.67/3.32	
9.67/3.32	(0) C Problem
9.67/3.32	(1) CToIRSProof [EQUIVALENT, 0 ms]
9.67/3.32	(2) IntTRS
9.67/3.32	(3) IRS2T2 [EQUIVALENT, 0 ms]
9.67/3.32	(4) T2IntSys
9.67/3.32	(5) T2 [EQUIVALENT, 1433 ms]
9.67/3.32	(6) YES
9.67/3.32	
9.67/3.32	
9.67/3.32	----------------------------------------
9.67/3.32	
9.67/3.32	(0)
9.67/3.32	Obligation:
9.67/3.32	c file /export/starexec/sandbox/benchmark/theBenchmark.c
9.67/3.32	----------------------------------------
9.67/3.32	
9.67/3.32	(1) CToIRSProof (EQUIVALENT)
9.67/3.32	Parsed C Integer Program as IRS.
9.67/3.32	----------------------------------------
9.67/3.32	
9.67/3.32	(2)
9.67/3.32	Obligation:
9.67/3.32	Rules:
9.67/3.32	f1(x, y) -> f2(x_1, y) :|: TRUE
9.67/3.32	f2(x1, x2) -> f3(x1, x3) :|: TRUE
9.67/3.32	f7(x4, x5) -> f8(x4, arith) :|: TRUE && arith = x4 + x5
9.67/3.32	f4(x6, x7) -> f7(x6, x7) :|: x6 > x7
9.67/3.32	f8(x8, x9) -> f4(x8, x9) :|: TRUE
9.67/3.32	f4(x10, x11) -> f9(x10, x11) :|: x10 <= x11
9.67/3.32	f3(x12, x13) -> f4(x12, x13) :|: x12 > 0
9.67/3.32	f3(x14, x15) -> f5(x14, x15) :|: x14 <= 0
9.67/3.32	f9(x16, x17) -> f6(x16, x17) :|: TRUE
9.67/3.32	f5(x18, x19) -> f6(x18, x19) :|: TRUE
9.67/3.32	Start term: f1(x, y)
9.67/3.32	
9.67/3.32	----------------------------------------
9.67/3.32	
9.67/3.32	(3) IRS2T2 (EQUIVALENT)
9.67/3.32	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
9.67/3.32	
9.67/3.32	   (f1_2,1)
9.67/3.32	   (f2_2,2)
9.67/3.32	   (f3_2,3)
9.67/3.32	   (f7_2,4)
9.67/3.32	   (f8_2,5)
9.67/3.32	   (f4_2,6)
9.67/3.32	   (f9_2,7)
9.67/3.32	   (f5_2,8)
9.67/3.32	   (f6_2,9)
9.67/3.32	
9.67/3.32	----------------------------------------
9.67/3.32	
9.67/3.32	(4)
9.67/3.32	Obligation:
9.67/3.32	START: 1;
9.67/3.32	
9.67/3.32	FROM: 1;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	oldX2 := nondet();
9.67/3.32	assume(0 = 0);
9.67/3.32	x0 := oldX2;
9.67/3.32	x1 := oldX1;
9.67/3.32	TO: 2;
9.67/3.32	
9.67/3.32	FROM: 2;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	oldX2 := nondet();
9.67/3.32	assume(0 = 0);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := oldX2;
9.67/3.32	TO: 3;
9.67/3.32	
9.67/3.32	FROM: 4;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	oldX2 := -(-(oldX0 + oldX1));
9.67/3.32	assume(0 = 0 && oldX2 = oldX0 + oldX1);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := -(-(oldX0 + oldX1));
9.67/3.32	TO: 5;
9.67/3.32	
9.67/3.32	FROM: 6;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	assume(oldX0 > oldX1);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := oldX1;
9.67/3.32	TO: 4;
9.67/3.32	
9.67/3.32	FROM: 5;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	assume(0 = 0);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := oldX1;
9.67/3.32	TO: 6;
9.67/3.32	
9.67/3.32	FROM: 6;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	assume(oldX0 <= oldX1);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := oldX1;
9.67/3.32	TO: 7;
9.67/3.32	
9.67/3.32	FROM: 3;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	assume(oldX0 > 0);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := oldX1;
9.67/3.32	TO: 6;
9.67/3.32	
9.67/3.32	FROM: 3;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	assume(oldX0 <= 0);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := oldX1;
9.67/3.32	TO: 8;
9.67/3.32	
9.67/3.32	FROM: 7;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	assume(0 = 0);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := oldX1;
9.67/3.32	TO: 9;
9.67/3.32	
9.67/3.32	FROM: 8;
9.67/3.32	oldX0 := x0;
9.67/3.32	oldX1 := x1;
9.67/3.32	assume(0 = 0);
9.67/3.32	x0 := oldX0;
9.67/3.32	x1 := oldX1;
9.67/3.32	TO: 9;
9.67/3.32	
9.67/3.32	
9.67/3.32	----------------------------------------
9.67/3.32	
9.67/3.32	(5) T2 (EQUIVALENT)
9.67/3.32	Used the following cutpoint-specific lexicographic rank functions:
9.67/3.32	 * For cutpoint 7, used the following rank functions/bounds (in descending priority order):
9.67/3.32	    - RF -x1+oldX0, bound 1
9.67/3.32	
9.67/3.32	----------------------------------------
9.67/3.32	
9.67/3.32	(6)
9.67/3.32	YES
10.06/3.42	EOF