13.53/4.29	YES
13.53/4.29	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
13.53/4.29	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
13.53/4.29	
13.53/4.29	
13.53/4.29	Termination of the given C Problem could be proven:
13.53/4.29	
13.53/4.29	(0) C Problem
13.53/4.29	(1) CToIRSProof [EQUIVALENT, 0 ms]
13.53/4.29	(2) IntTRS
13.53/4.29	(3) IRS2T2 [EQUIVALENT, 0 ms]
13.53/4.29	(4) T2IntSys
13.53/4.29	(5) T2 [EQUIVALENT, 2447 ms]
13.53/4.29	(6) YES
13.53/4.29	
13.53/4.29	
13.53/4.29	----------------------------------------
13.53/4.29	
13.53/4.29	(0)
13.53/4.29	Obligation:
13.53/4.29	c file /export/starexec/sandbox/benchmark/theBenchmark.c
13.53/4.29	----------------------------------------
13.53/4.29	
13.53/4.29	(1) CToIRSProof (EQUIVALENT)
13.53/4.29	Parsed C Integer Program as IRS.
13.53/4.29	----------------------------------------
13.53/4.29	
13.53/4.29	(2)
13.53/4.29	Obligation:
13.53/4.29	Rules:
13.53/4.29	f1(r, x, y) -> f2(r, x_1, y) :|: TRUE
13.53/4.29	f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE
13.53/4.29	f4(x5, x6, x7) -> f7(x5, arith, x7) :|: TRUE && arith = 0 - x6
13.53/4.29	f3(x8, x9, x10) -> f4(x8, x9, x10) :|: x9 < 0
13.53/4.29	f3(x11, x12, x13) -> f5(x11, x12, x13) :|: x12 >= 0
13.53/4.29	f7(x14, x15, x16) -> f6(x14, x15, x16) :|: TRUE
13.53/4.29	f5(x17, x18, x19) -> f6(x17, x18, x19) :|: TRUE
13.53/4.29	f8(x65, x66, x67) -> f11(x65, x66, x68) :|: TRUE && x68 = 0 - x67
13.53/4.29	f6(x23, x24, x25) -> f8(x23, x24, x25) :|: x25 < 0
13.53/4.29	f6(x26, x27, x28) -> f9(x26, x27, x28) :|: x28 >= 0
13.53/4.29	f11(x29, x30, x31) -> f10(x29, x30, x31) :|: TRUE
13.53/4.29	f9(x32, x33, x34) -> f10(x32, x33, x34) :|: TRUE
13.53/4.29	f12(x35, x36, x37) -> f13(x36, x36, x37) :|: TRUE
13.53/4.29	f14(x69, x70, x71) -> f15(x72, x70, x71) :|: TRUE && x72 = x69 - x71
13.53/4.29	f13(x41, x42, x43) -> f14(x41, x42, x43) :|: x41 >= x43
13.53/4.29	f15(x44, x45, x46) -> f13(x44, x45, x46) :|: TRUE
13.53/4.29	f13(x47, x48, x49) -> f16(x47, x48, x49) :|: x47 < x49
13.53/4.29	f16(x50, x51, x52) -> f17(x50, x52, x52) :|: TRUE
13.53/4.29	f17(x53, x54, x55) -> f18(x53, x54, x53) :|: TRUE
13.53/4.29	f10(x56, x57, x58) -> f12(x56, x57, x58) :|: x58 > 0
13.53/4.29	f18(x59, x60, x61) -> f10(x59, x60, x61) :|: TRUE
13.53/4.29	f10(x62, x63, x64) -> f19(x62, x63, x64) :|: x64 <= 0
13.53/4.29	Start term: f1(r, x, y)
13.53/4.29	
13.53/4.29	----------------------------------------
13.53/4.29	
13.53/4.29	(3) IRS2T2 (EQUIVALENT)
13.53/4.29	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
13.53/4.29	
13.53/4.29	   (f1_3,1)
13.53/4.29	   (f2_3,2)
13.53/4.29	   (f3_3,3)
13.53/4.29	   (f4_3,4)
13.53/4.29	   (f7_3,5)
13.53/4.29	   (f5_3,6)
13.53/4.29	   (f6_3,7)
13.53/4.29	   (f8_3,8)
13.53/4.29	   (f11_3,9)
13.53/4.29	   (f9_3,10)
13.53/4.29	   (f10_3,11)
13.53/4.29	   (f12_3,12)
13.53/4.29	   (f13_3,13)
13.53/4.29	   (f14_3,14)
13.53/4.29	   (f15_3,15)
13.53/4.29	   (f16_3,16)
13.53/4.29	   (f17_3,17)
13.53/4.29	   (f18_3,18)
13.53/4.29	   (f19_3,19)
13.53/4.29	
13.53/4.29	----------------------------------------
13.53/4.29	
13.53/4.29	(4)
13.53/4.29	Obligation:
13.53/4.29	START: 1;
13.53/4.29	
13.53/4.29	FROM: 1;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	oldX3 := nondet();
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX3;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 2;
13.53/4.29	
13.53/4.29	FROM: 2;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	oldX3 := nondet();
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX3;
13.53/4.29	TO: 3;
13.53/4.29	
13.53/4.29	FROM: 4;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	oldX3 := -(0 - -(oldX1));
13.53/4.29	assume(0 = 0 && oldX3 = 0 - oldX1);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := -(0 - -(oldX1));
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 5;
13.53/4.29	
13.53/4.29	FROM: 3;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(oldX1 < 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 4;
13.53/4.29	
13.53/4.29	FROM: 3;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(oldX1 >= 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 6;
13.53/4.29	
13.53/4.29	FROM: 5;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 7;
13.53/4.29	
13.53/4.29	FROM: 6;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 7;
13.53/4.29	
13.53/4.29	FROM: 8;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	oldX3 := -(0 - -(oldX2));
13.53/4.29	assume(0 = 0 && oldX3 = 0 - oldX2);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := -(0 - -(oldX2));
13.53/4.29	TO: 9;
13.53/4.29	
13.53/4.29	FROM: 7;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(oldX2 < 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 8;
13.53/4.29	
13.53/4.29	FROM: 7;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(oldX2 >= 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 10;
13.53/4.29	
13.53/4.29	FROM: 9;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 11;
13.53/4.29	
13.53/4.29	FROM: 10;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 11;
13.53/4.29	
13.53/4.29	FROM: 12;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX1;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 13;
13.53/4.29	
13.53/4.29	FROM: 14;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	oldX3 := -(oldX2 - oldX0);
13.53/4.29	assume(0 = 0 && oldX3 = oldX0 - oldX2);
13.53/4.29	x0 := -(oldX2 - oldX0);
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 15;
13.53/4.29	
13.53/4.29	FROM: 13;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(oldX0 >= oldX2);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 14;
13.53/4.29	
13.53/4.29	FROM: 15;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 13;
13.53/4.29	
13.53/4.29	FROM: 13;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(oldX0 < oldX2);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 16;
13.53/4.29	
13.53/4.29	FROM: 16;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX2;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 17;
13.53/4.29	
13.53/4.29	FROM: 17;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX0;
13.53/4.29	TO: 18;
13.53/4.29	
13.53/4.29	FROM: 11;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(oldX2 > 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 12;
13.53/4.29	
13.53/4.29	FROM: 18;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(0 = 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 11;
13.53/4.29	
13.53/4.29	FROM: 11;
13.53/4.29	oldX0 := x0;
13.53/4.29	oldX1 := x1;
13.53/4.29	oldX2 := x2;
13.53/4.29	assume(oldX2 <= 0);
13.53/4.29	x0 := oldX0;
13.53/4.29	x1 := oldX1;
13.53/4.29	x2 := oldX2;
13.53/4.29	TO: 19;
13.53/4.29	
13.53/4.29	
13.53/4.29	----------------------------------------
13.53/4.29	
13.53/4.29	(5) T2 (EQUIVALENT)
13.53/4.29	Initially, performed program simplifications using lexicographic rank functions:
13.53/4.29	 * Removed transitions 13, 18, 21, 22 using the following rank functions:
13.53/4.29	    - Rank function 1:
13.53/4.29	      RF for loc. 10: 2*x2
13.53/4.29	      RF for loc. 11: 2*x2
13.53/4.29	      RF for loc. 15: 1+2*x2
13.53/4.29	      Bound for (chained) transitions 21: 3
13.53/4.29	      Bound for (chained) transitions 22: 3
13.53/4.29	    - Rank function 2:
13.53/4.29	      RF for loc. 10: 0
13.53/4.29	      RF for loc. 11: 0
13.53/4.29	      RF for loc. 15: -1
13.53/4.29	      Bound for (chained) transitions 13, 18: 0
13.53/4.29	Used the following cutpoint-specific lexicographic rank functions:
13.53/4.29	 * For cutpoint 10, used the following rank functions/bounds (in descending priority order):
13.53/4.29	    - RF 2*x0, bound 0
13.53/4.29	    - RF x0, bound 1
13.53/4.29	
13.53/4.29	----------------------------------------
13.53/4.29	
13.53/4.29	(6)
13.53/4.29	YES
13.65/4.34	EOF