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