9.94/3.45 NO 9.94/3.46 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 9.94/3.46 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.94/3.46 9.94/3.46 9.94/3.46 Termination of the given C Problem could be disproven: 9.94/3.46 9.94/3.46 (0) C Problem 9.94/3.46 (1) CToIRSProof [EQUIVALENT, 0 ms] 9.94/3.46 (2) IntTRS 9.94/3.46 (3) IRS2T2 [EQUIVALENT, 0 ms] 9.94/3.46 (4) T2IntSys 9.94/3.46 (5) T2 [COMPLETE, 1237 ms] 9.94/3.46 (6) NO 9.94/3.46 9.94/3.46 9.94/3.46 ---------------------------------------- 9.94/3.46 9.94/3.46 (0) 9.94/3.46 Obligation: 9.94/3.46 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 9.94/3.46 ---------------------------------------- 9.94/3.46 9.94/3.46 (1) CToIRSProof (EQUIVALENT) 9.94/3.46 Parsed C Integer Program as IRS. 9.94/3.46 ---------------------------------------- 9.94/3.46 9.94/3.46 (2) 9.94/3.46 Obligation: 9.94/3.46 Rules: 9.94/3.46 f1(x) -> f2(x_1) :|: TRUE 9.94/3.46 f6(x1) -> f7(arith) :|: TRUE && arith = x1 - 1 9.94/3.46 f3(x2) -> f6(x2) :|: x2 < 0 9.94/3.46 f3(x11) -> f6(x11) :|: x11 > 0 9.94/3.46 f7(x3) -> f3(x3) :|: TRUE 9.94/3.46 f3(x4) -> f8(x4) :|: x4 = 0 9.94/3.46 f2(x5) -> f3(x5) :|: x5 > x6 9.94/3.46 f2(x7) -> f4(x7) :|: x7 <= x8 9.94/3.46 f8(x9) -> f5(x9) :|: TRUE 9.94/3.46 f4(x10) -> f5(x10) :|: TRUE 9.94/3.46 Start term: f1(x) 9.94/3.46 9.94/3.46 ---------------------------------------- 9.94/3.46 9.94/3.46 (3) IRS2T2 (EQUIVALENT) 9.94/3.46 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 9.94/3.46 9.94/3.46 (f1_1,1) 9.94/3.46 (f2_1,2) 9.94/3.46 (f6_1,3) 9.94/3.46 (f7_1,4) 9.94/3.46 (f3_1,5) 9.94/3.46 (f8_1,6) 9.94/3.46 (f4_1,7) 9.94/3.46 (f5_1,8) 9.94/3.46 9.94/3.46 ---------------------------------------- 9.94/3.46 9.94/3.46 (4) 9.94/3.46 Obligation: 9.94/3.46 START: 1; 9.94/3.46 9.94/3.46 FROM: 1; 9.94/3.46 oldX0 := x0; 9.94/3.46 oldX1 := nondet(); 9.94/3.46 assume(0 = 0); 9.94/3.46 x0 := oldX1; 9.94/3.46 TO: 2; 9.94/3.46 9.94/3.46 FROM: 3; 9.94/3.46 oldX0 := x0; 9.94/3.46 oldX1 := -(1 - oldX0); 9.94/3.46 assume(0 = 0 && oldX1 = oldX0 - 1); 9.94/3.46 x0 := -(1 - oldX0); 9.94/3.46 TO: 4; 9.94/3.46 9.94/3.46 FROM: 5; 9.94/3.46 oldX0 := x0; 9.94/3.46 assume(oldX0 < 0); 9.94/3.46 x0 := oldX0; 9.94/3.46 TO: 3; 9.94/3.46 9.94/3.46 FROM: 5; 9.94/3.46 oldX0 := x0; 9.94/3.46 assume(oldX0 > 0); 9.94/3.46 x0 := oldX0; 9.94/3.46 TO: 3; 9.94/3.46 9.94/3.46 FROM: 4; 9.94/3.46 oldX0 := x0; 9.94/3.46 assume(0 = 0); 9.94/3.46 x0 := oldX0; 9.94/3.46 TO: 5; 9.94/3.46 9.94/3.46 FROM: 5; 9.94/3.46 oldX0 := x0; 9.94/3.46 assume(oldX0 = 0); 9.94/3.46 x0 := oldX0; 9.94/3.46 TO: 6; 9.94/3.46 9.94/3.46 FROM: 2; 9.94/3.46 oldX0 := x0; 9.94/3.46 oldX1 := nondet(); 9.94/3.46 assume(oldX0 > oldX1); 9.94/3.46 x0 := oldX0; 9.94/3.46 TO: 5; 9.94/3.46 9.94/3.46 FROM: 2; 9.94/3.46 oldX0 := x0; 9.94/3.46 oldX1 := nondet(); 9.94/3.46 assume(oldX0 <= oldX1); 9.94/3.46 x0 := oldX0; 9.94/3.46 TO: 7; 9.94/3.46 9.94/3.46 FROM: 6; 9.94/3.46 oldX0 := x0; 9.94/3.46 assume(0 = 0); 9.94/3.46 x0 := oldX0; 9.94/3.46 TO: 8; 9.94/3.46 9.94/3.46 FROM: 7; 9.94/3.46 oldX0 := x0; 9.94/3.46 assume(0 = 0); 9.94/3.46 x0 := oldX0; 9.94/3.46 TO: 8; 9.94/3.46 9.94/3.46 9.94/3.46 ---------------------------------------- 9.94/3.46 9.94/3.46 (5) T2 (COMPLETE) 9.94/3.46 Found this recurrent set for cutpoint 9: 0 <= 0 and x0+1 <= 0 9.94/3.46 9.94/3.46 ---------------------------------------- 9.94/3.46 9.94/3.46 (6) 9.94/3.46 NO 9.94/3.50 EOF