10.13/3.38	YES
10.13/3.39	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
10.13/3.39	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.13/3.39	
10.13/3.39	
10.13/3.39	Termination of the given C Problem could be proven:
10.13/3.39	
10.13/3.39	(0) C Problem
10.13/3.39	(1) CToIRSProof [EQUIVALENT, 0 ms]
10.13/3.39	(2) IntTRS
10.13/3.39	(3) IRS2T2 [EQUIVALENT, 4 ms]
10.13/3.39	(4) T2IntSys
10.13/3.39	(5) T2 [EQUIVALENT, 1414 ms]
10.13/3.39	(6) YES
10.13/3.39	
10.13/3.39	
10.13/3.39	----------------------------------------
10.13/3.39	
10.13/3.39	(0)
10.13/3.39	Obligation:
10.13/3.39	c file /export/starexec/sandbox/benchmark/theBenchmark.c
10.13/3.39	----------------------------------------
10.13/3.39	
10.13/3.39	(1) CToIRSProof (EQUIVALENT)
10.13/3.39	Parsed C Integer Program as IRS.
10.13/3.39	----------------------------------------
10.13/3.39	
10.13/3.39	(2)
10.13/3.39	Obligation:
10.13/3.39	Rules:
10.13/3.39	f1(c, x, y, z) -> f2(c, x_1, y, z) :|: TRUE
10.13/3.39	f2(x1, x2, x3, x4) -> f3(x1, x2, x5, x4) :|: TRUE
10.13/3.39	f3(x6, x7, x8, x9) -> f4(x6, x7, x8, x10) :|: TRUE
10.13/3.39	f4(x11, x12, x13, x14) -> f5(0, x12, x13, x14) :|: TRUE
10.13/3.39	f7(x15, x16, x17, x18) -> f10(x15, arith, x17, x18) :|: TRUE && arith = x16 - 1
10.13/3.39	f11(x71, x72, x73, x74) -> f14(x71, x72, x75, x74) :|: TRUE && x75 = x73 - 1
10.13/3.39	f8(x23, x24, x25, x26) -> f11(x23, x24, x25, x26) :|: x25 > x26
10.13/3.39	f8(x27, x28, x29, x30) -> f12(x27, x28, x29, x30) :|: x29 <= x30
10.13/3.39	f14(x31, x32, x33, x34) -> f13(x31, x32, x33, x34) :|: TRUE
10.13/3.39	f12(x35, x36, x37, x38) -> f13(x35, x36, x37, x38) :|: TRUE
10.13/3.39	f6(x39, x40, x41, x42) -> f7(x39, x40, x41, x42) :|: x40 > x42
10.13/3.39	f6(x43, x44, x45, x46) -> f8(x43, x44, x45, x46) :|: x44 <= x46
10.13/3.39	f10(x47, x48, x49, x50) -> f9(x47, x48, x49, x50) :|: TRUE
10.13/3.39	f13(x51, x52, x53, x54) -> f9(x51, x52, x53, x54) :|: TRUE
10.13/3.39	f9(x76, x77, x78, x79) -> f15(x80, x77, x78, x79) :|: TRUE && x80 = x76 + 1
10.13/3.39	f5(x59, x60, x61, x62) -> f6(x59, x60, x61, x62) :|: x60 > x62
10.13/3.39	f5(x81, x82, x83, x84) -> f6(x81, x82, x83, x84) :|: x83 > x84
10.13/3.39	f15(x63, x64, x65, x66) -> f5(x63, x64, x65, x66) :|: TRUE
10.13/3.39	f5(x67, x68, x69, x70) -> f16(x67, x68, x69, x70) :|: x68 <= x70 && x69 <= x70
10.13/3.39	Start term: f1(c, x, y, z)
10.13/3.39	
10.13/3.39	----------------------------------------
10.13/3.39	
10.13/3.39	(3) IRS2T2 (EQUIVALENT)
10.13/3.39	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
10.13/3.39	
10.13/3.39	   (f1_4,1)
10.13/3.39	   (f2_4,2)
10.13/3.39	   (f3_4,3)
10.13/3.39	   (f4_4,4)
10.13/3.39	   (f5_4,5)
10.13/3.39	   (f7_4,6)
10.13/3.39	   (f10_4,7)
10.13/3.39	   (f11_4,8)
10.13/3.39	   (f14_4,9)
10.13/3.39	   (f8_4,10)
10.13/3.39	   (f12_4,11)
10.13/3.39	   (f13_4,12)
10.13/3.39	   (f6_4,13)
10.13/3.39	   (f9_4,14)
10.13/3.39	   (f15_4,15)
10.13/3.39	   (f16_4,16)
10.13/3.39	
10.13/3.39	----------------------------------------
10.13/3.39	
10.13/3.39	(4)
10.13/3.39	Obligation:
10.13/3.39	START: 1;
10.13/3.39	
10.13/3.39	FROM: 1;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	oldX4 := nondet();
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX4;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 2;
10.13/3.39	
10.13/3.39	FROM: 2;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	oldX4 := nondet();
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX4;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 3;
10.13/3.39	
10.13/3.39	FROM: 3;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	oldX4 := nondet();
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX4;
10.13/3.39	TO: 4;
10.13/3.39	
10.13/3.39	FROM: 4;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := 0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 5;
10.13/3.39	
10.13/3.39	FROM: 6;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	oldX4 := -(1 - oldX1);
10.13/3.39	assume(0 = 0 && oldX4 = oldX1 - 1);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := -(1 - oldX1);
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 7;
10.13/3.39	
10.13/3.39	FROM: 8;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	oldX4 := -(1 - oldX2);
10.13/3.39	assume(0 = 0 && oldX4 = oldX2 - 1);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := -(1 - oldX2);
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 9;
10.13/3.39	
10.13/3.39	FROM: 10;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(oldX2 > oldX3);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 8;
10.13/3.39	
10.13/3.39	FROM: 10;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(oldX2 <= oldX3);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 11;
10.13/3.39	
10.13/3.39	FROM: 9;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 12;
10.13/3.39	
10.13/3.39	FROM: 11;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 12;
10.13/3.39	
10.13/3.39	FROM: 13;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(oldX1 > oldX3);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 6;
10.13/3.39	
10.13/3.39	FROM: 13;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(oldX1 <= oldX3);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 10;
10.13/3.39	
10.13/3.39	FROM: 7;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 14;
10.13/3.39	
10.13/3.39	FROM: 12;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 14;
10.13/3.39	
10.13/3.39	FROM: 14;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	oldX4 := -(-(oldX0 + 1));
10.13/3.39	assume(0 = 0 && oldX4 = oldX0 + 1);
10.13/3.39	x0 := -(-(oldX0 + 1));
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 15;
10.13/3.39	
10.13/3.39	FROM: 5;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(oldX1 > oldX3);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 13;
10.13/3.39	
10.13/3.39	FROM: 5;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(oldX2 > oldX3);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 13;
10.13/3.39	
10.13/3.39	FROM: 15;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(0 = 0);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 5;
10.13/3.39	
10.13/3.39	FROM: 5;
10.13/3.39	oldX0 := x0;
10.13/3.39	oldX1 := x1;
10.13/3.39	oldX2 := x2;
10.13/3.39	oldX3 := x3;
10.13/3.39	assume(oldX1 <= oldX3 && oldX2 <= oldX3);
10.13/3.39	x0 := oldX0;
10.13/3.39	x1 := oldX1;
10.13/3.39	x2 := oldX2;
10.13/3.39	x3 := oldX3;
10.13/3.39	TO: 16;
10.13/3.39	
10.13/3.39	
10.13/3.39	----------------------------------------
10.13/3.39	
10.13/3.39	(5) T2 (EQUIVALENT)
10.13/3.39	Initially, performed program simplifications using lexicographic rank functions:
10.13/3.39	 * Removed transitions 11, 13 using the following rank functions:
10.13/3.39	    - Rank function 1:
10.13/3.39	      RF for loc. 11: 2*x1-2*x3
10.13/3.39	      RF for loc. 12: 2*x1-2*x3
10.13/3.39	      RF for loc. 13: 2*x1-2*x3
10.13/3.39	      RF for loc. 14: 2*x1-2*x3
10.13/3.39	      RF for loc. 15: 2*x1-2*x3
10.13/3.39	      Bound for (chained) transitions 13: 2
10.13/3.39	    - Rank function 2:
10.13/3.39	      RF for loc. 11: x2-x3
10.13/3.39	      RF for loc. 12: x2-x3
10.13/3.39	      RF for loc. 13: x2-x3
10.13/3.39	      RF for loc. 14: x2-x3
10.13/3.39	      RF for loc. 15: x2-x3
10.13/3.39	      Bound for (chained) transitions 11: 1
10.13/3.39	
10.13/3.39	----------------------------------------
10.13/3.39	
10.13/3.39	(6)
10.13/3.39	YES
10.13/3.42	EOF