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