details

property	value
status	complete
benchmark	ChenCookFuhsNimkarOHearn-TACAS2014-Introduction_false-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n127.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	6.25674 seconds
cpu usage	9.4857
user time	9.02883
system time	0.456871
max virtual memory	2.1030396E7
max residence set size	596724.0

stage attributes

key	value
starexec-result	NO

output

9.25/3.13 NO 9.25/3.13 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 9.25/3.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.25/3.13 9.25/3.13 9.25/3.13 Termination of the given C Problem could be disproven: 9.25/3.13 9.25/3.13 (0) C Problem 9.25/3.13 (1) CToIRSProof [EQUIVALENT, 0 ms] 9.25/3.13 (2) IntTRS 9.25/3.13 (3) IRS2T2 [EQUIVALENT, 0 ms] 9.25/3.13 (4) T2IntSys 9.25/3.13 (5) T2 [COMPLETE, 1242 ms] 9.25/3.13 (6) NO 9.25/3.13 9.25/3.13 9.25/3.13 ---------------------------------------- 9.25/3.13 9.25/3.13 (0) 9.25/3.13 Obligation: 9.25/3.13 c file /export/starexec/sandbox/benchmark/theBenchmark.c 9.25/3.13 ---------------------------------------- 9.25/3.13 9.25/3.13 (1) CToIRSProof (EQUIVALENT) 9.25/3.13 Parsed C Integer Program as IRS. 9.25/3.13 ---------------------------------------- 9.25/3.13 9.25/3.13 (2) 9.25/3.13 Obligation: 9.25/3.13 Rules: 9.25/3.13 f1(k, i) -> f2(x_1, i) :|: TRUE 9.25/3.13 f2(x, x1) -> f3(x, x2) :|: TRUE 9.25/3.13 f5(x3, x4) -> f7(x3, arith) :|: TRUE && arith = 0 - 1 9.25/3.13 f3(x5, x6) -> f4(x5, x6) :|: x5 >= 0 9.25/3.13 f3(x7, x8) -> f5(x7, x8) :|: x7 < 0 9.25/3.13 f4(x9, x10) -> f6(x9, x10) :|: TRUE 9.25/3.13 f7(x11, x12) -> f6(x11, x12) :|: TRUE 9.25/3.13 f8(x13, x14) -> f9(x13, x15) :|: TRUE 9.25/3.13 f6(x16, x17) -> f8(x16, x17) :|: x17 >= 0 9.25/3.13 f9(x18, x19) -> f6(x18, x19) :|: TRUE 9.25/3.13 f6(x20, x21) -> f10(x20, x21) :|: x21 < 0 9.25/3.13 f10(x22, x23) -> f11(x22, 2) :|: TRUE 9.25/3.13 Start term: f1(k, i) 9.25/3.13 9.25/3.13 ---------------------------------------- 9.25/3.13 9.25/3.13 (3) IRS2T2 (EQUIVALENT) 9.25/3.13 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 9.25/3.13 9.25/3.13 (f1_2,1) 9.25/3.13 (f2_2,2) 9.25/3.13 (f3_2,3) 9.25/3.13 (f5_2,4) 9.25/3.13 (f7_2,5) 9.25/3.13 (f4_2,6) 9.25/3.13 (f6_2,7) 9.25/3.13 (f8_2,8) 9.25/3.13 (f9_2,9) 9.25/3.13 (f10_2,10) 9.25/3.13 (f11_2,11) 9.25/3.13 9.25/3.13 ---------------------------------------- 9.25/3.13 9.25/3.13 (4) 9.25/3.13 Obligation: 9.25/3.13 START: 1; 9.25/3.13 9.25/3.13 FROM: 1; 9.25/3.13 oldX0 := x0; 9.25/3.13 oldX1 := x1; 9.25/3.13 oldX2 := nondet(); 9.25/3.13 assume(0 = 0); 9.25/3.13 x0 := oldX2; 9.25/3.13 x1 := oldX1; 9.25/3.13 TO: 2; 9.25/3.13 9.25/3.13 FROM: 2; 9.25/3.13 oldX0 := x0; 9.25/3.13 oldX1 := x1; 9.25/3.13 oldX2 := nondet(); 9.25/3.13 assume(0 = 0); 9.25/3.13 x0 := oldX0; 9.25/3.13 x1 := oldX2; 9.25/3.13 TO: 3; 9.25/3.13 9.25/3.13 FROM: 4; 9.25/3.13 oldX0 := x0; 9.25/3.13 oldX1 := x1; 9.25/3.13 oldX2 := -(1); 9.25/3.13 assume(0 = 0 && oldX2 = 0 - 1); 9.25/3.13 x0 := oldX0; 9.25/3.13 x1 := -(1); 9.25/3.13 TO: 5; 9.25/3.13 9.25/3.13 FROM: 3; 9.25/3.13 oldX0 := x0; 9.25/3.13 oldX1 := x1; 9.25/3.13 assume(oldX0 >= 0); 9.25/3.13 x0 := oldX0; 9.25/3.13 x1 := oldX1; popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to C_Integer 2019-03-28 22.15