9.31/3.11 NO 9.31/3.12 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 9.31/3.12 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.31/3.12 9.31/3.12 9.31/3.12 Termination of the given C Problem could be disproven: 9.31/3.12 9.31/3.12 (0) C Problem 9.31/3.12 (1) CToIRSProof [EQUIVALENT, 0 ms] 9.31/3.12 (2) IntTRS 9.31/3.12 (3) IRS2T2 [EQUIVALENT, 0 ms] 9.31/3.12 (4) T2IntSys 9.31/3.12 (5) T2 [COMPLETE, 1417 ms] 9.31/3.12 (6) NO 9.31/3.12 9.31/3.12 9.31/3.12 ---------------------------------------- 9.31/3.12 9.31/3.12 (0) 9.31/3.12 Obligation: 9.31/3.12 c file /export/starexec/sandbox/benchmark/theBenchmark.c 9.31/3.12 ---------------------------------------- 9.31/3.12 9.31/3.12 (1) CToIRSProof (EQUIVALENT) 9.31/3.12 Parsed C Integer Program as IRS. 9.31/3.12 ---------------------------------------- 9.31/3.12 9.31/3.12 (2) 9.31/3.12 Obligation: 9.31/3.12 Rules: 9.31/3.12 f1(a, b) -> f2(1, b) :|: TRUE 9.31/3.12 f2(x, x1) -> f3(x, 2) :|: TRUE 9.31/3.12 f4(x2, x3) -> f5(arith, x3) :|: TRUE && arith = x2 - x3 9.31/3.12 f5(x14, x15) -> f6(x14, x16) :|: TRUE && x16 = x14 + x15 9.31/3.12 f6(x17, x18) -> f7(x19, x18) :|: TRUE && x19 = x18 - x17 9.31/3.12 f3(x8, x9) -> f4(x8, x9) :|: x8 + x9 < 5 9.31/3.12 f7(x10, x11) -> f3(x10, x11) :|: TRUE 9.31/3.12 f3(x12, x13) -> f8(x12, x13) :|: x12 + x13 >= 5 9.31/3.12 Start term: f1(a, b) 9.31/3.12 9.31/3.12 ---------------------------------------- 9.31/3.12 9.31/3.12 (3) IRS2T2 (EQUIVALENT) 9.31/3.12 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 9.31/3.12 9.31/3.12 (f1_2,1) 9.31/3.12 (f2_2,2) 9.31/3.12 (f3_2,3) 9.31/3.12 (f4_2,4) 9.31/3.12 (f5_2,5) 9.31/3.12 (f6_2,6) 9.31/3.12 (f7_2,7) 9.31/3.12 (f8_2,8) 9.31/3.12 9.31/3.12 ---------------------------------------- 9.31/3.12 9.31/3.12 (4) 9.31/3.12 Obligation: 9.31/3.12 START: 1; 9.31/3.12 9.31/3.12 FROM: 1; 9.31/3.12 oldX0 := x0; 9.31/3.12 oldX1 := x1; 9.31/3.12 assume(0 = 0); 9.31/3.12 x0 := 1; 9.31/3.12 x1 := oldX1; 9.31/3.12 TO: 2; 9.31/3.12 9.31/3.12 FROM: 2; 9.31/3.12 oldX0 := x0; 9.31/3.12 oldX1 := x1; 9.31/3.12 assume(0 = 0); 9.31/3.12 x0 := oldX0; 9.31/3.12 x1 := 2; 9.31/3.12 TO: 3; 9.31/3.12 9.31/3.12 FROM: 4; 9.31/3.12 oldX0 := x0; 9.31/3.12 oldX1 := x1; 9.31/3.12 oldX2 := -(oldX1 - oldX0); 9.31/3.12 assume(0 = 0 && oldX2 = oldX0 - oldX1); 9.31/3.12 x0 := -(oldX1 - oldX0); 9.31/3.12 x1 := oldX1; 9.31/3.12 TO: 5; 9.31/3.12 9.31/3.12 FROM: 5; 9.31/3.12 oldX0 := x0; 9.31/3.12 oldX1 := x1; 9.31/3.12 oldX2 := -(-(oldX0 + oldX1)); 9.31/3.12 assume(0 = 0 && oldX2 = oldX0 + oldX1); 9.31/3.12 x0 := oldX0; 9.31/3.12 x1 := -(-(oldX0 + oldX1)); 9.31/3.12 TO: 6; 9.31/3.12 9.31/3.12 FROM: 6; 9.31/3.12 oldX0 := x0; 9.31/3.12 oldX1 := x1; 9.31/3.12 oldX2 := -(oldX0 - oldX1); 9.31/3.12 assume(0 = 0 && oldX2 = oldX1 - oldX0); 9.31/3.12 x0 := -(oldX0 - oldX1); 9.31/3.12 x1 := oldX1; 9.31/3.12 TO: 7; 9.31/3.12 9.31/3.12 FROM: 3; 9.31/3.12 oldX0 := x0; 9.31/3.12 oldX1 := x1; 9.31/3.12 assume(oldX0 + oldX1 < 5); 9.31/3.12 x0 := oldX0; 9.31/3.12 x1 := oldX1; 9.31/3.12 TO: 4; 9.31/3.12 9.31/3.12 FROM: 7; 9.31/3.12 oldX0 := x0; 9.31/3.12 oldX1 := x1; 9.31/3.12 assume(0 = 0); 9.31/3.12 x0 := oldX0; 9.31/3.12 x1 := oldX1; 9.31/3.12 TO: 3; 9.31/3.12 9.31/3.12 FROM: 3; 9.31/3.12 oldX0 := x0; 9.31/3.12 oldX1 := x1; 9.31/3.12 assume(oldX0 + oldX1 >= 5); 9.31/3.12 x0 := oldX0; 9.31/3.12 x1 := oldX1; 9.31/3.12 TO: 8; 9.31/3.12 9.31/3.12 9.31/3.12 ---------------------------------------- 9.31/3.12 9.31/3.12 (5) T2 (COMPLETE) 9.31/3.12 Found this recurrent set for cutpoint 6: oldX0 == 1 and x0 == 1 and x1 == 2 or oldX0 == 2 and x0 == 2 and x1 == 1 9.31/3.12 9.31/3.12 ---------------------------------------- 9.31/3.12 9.31/3.12 (6) 9.31/3.12 NO 9.36/3.17 EOF