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