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