details

property	value
status	complete
benchmark	Even.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n142.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.58706 seconds
cpu usage	10.297
user time	9.80511
system time	0.49193
max virtual memory	3.8538708E7
max residence set size	671676.0

stage attributes

key	value
starexec-result	NO

output

9.53/3.21 NO 9.84/3.27 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 9.84/3.27 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.84/3.27 9.84/3.27 9.84/3.27 Termination of the given C Problem could be disproven: 9.84/3.27 9.84/3.27 (0) C Problem 9.84/3.27 (1) CToIRSProof [EQUIVALENT, 0 ms] 9.84/3.27 (2) IntTRS 9.84/3.27 (3) IRS2T2 [EQUIVALENT, 0 ms] 9.84/3.27 (4) T2IntSys 9.84/3.27 (5) T2 [COMPLETE, 1394 ms] 9.84/3.27 (6) NO 9.84/3.27 9.84/3.27 9.84/3.27 ---------------------------------------- 9.84/3.27 9.84/3.27 (0) 9.84/3.27 Obligation: 9.84/3.27 c file /export/starexec/sandbox/benchmark/theBenchmark.c 9.84/3.27 ---------------------------------------- 9.84/3.27 9.84/3.27 (1) CToIRSProof (EQUIVALENT) 9.84/3.27 Parsed C Integer Program as IRS. 9.84/3.27 ---------------------------------------- 9.84/3.27 9.84/3.27 (2) 9.84/3.27 Obligation: 9.84/3.27 Rules: 9.84/3.27 f1(i, b) -> f2(x_1, b) :|: TRUE 9.84/3.27 f3(x, x1) -> f4(arith, x1) :|: TRUE && arith = x - 2 9.84/3.27 f2(x2, x3) -> f3(x2, x3) :|: x2 < 1 && x2 < 0 9.84/3.27 f2(x8, x9) -> f3(x8, x9) :|: x8 < 1 && x8 > 0 9.84/3.27 f2(x10, x11) -> f3(x10, x11) :|: x10 > 1 && x10 < 0 9.84/3.27 f2(x12, x13) -> f3(x12, x13) :|: x12 > 1 && x12 > 0 9.84/3.27 f4(x4, x5) -> f2(x4, x5) :|: TRUE 9.84/3.27 f2(x6, x7) -> f5(x6, x7) :|: x6 = 1 9.84/3.27 f2(x14, x15) -> f5(x14, x15) :|: x14 = 0 9.84/3.27 Start term: f1(i, b) 9.84/3.27 9.84/3.27 ---------------------------------------- 9.84/3.27 9.84/3.27 (3) IRS2T2 (EQUIVALENT) 9.84/3.27 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 9.84/3.27 9.84/3.27 (f1_2,1) 9.84/3.27 (f2_2,2) 9.84/3.27 (f3_2,3) 9.84/3.27 (f4_2,4) 9.84/3.27 (f5_2,5) 9.84/3.27 9.84/3.27 ---------------------------------------- 9.84/3.27 9.84/3.27 (4) 9.84/3.27 Obligation: 9.84/3.27 START: 1; 9.84/3.27 9.84/3.27 FROM: 1; 9.84/3.27 oldX0 := x0; 9.84/3.27 oldX1 := x1; 9.84/3.27 oldX2 := nondet(); 9.84/3.27 assume(0 = 0); 9.84/3.27 x0 := oldX2; 9.84/3.27 x1 := oldX1; 9.84/3.27 TO: 2; 9.84/3.27 9.84/3.27 FROM: 3; 9.84/3.27 oldX0 := x0; 9.84/3.27 oldX1 := x1; 9.84/3.27 oldX2 := -(2 - oldX0); 9.84/3.27 assume(0 = 0 && oldX2 = oldX0 - 2); 9.84/3.27 x0 := -(2 - oldX0); 9.84/3.27 x1 := oldX1; 9.84/3.27 TO: 4; 9.84/3.27 9.84/3.27 FROM: 2; 9.84/3.27 oldX0 := x0; 9.84/3.27 oldX1 := x1; 9.84/3.27 assume(oldX0 < 1 && oldX0 < 0); 9.84/3.27 x0 := oldX0; 9.84/3.27 x1 := oldX1; 9.84/3.27 TO: 3; 9.84/3.27 9.84/3.27 FROM: 2; 9.84/3.27 oldX0 := x0; 9.84/3.27 oldX1 := x1; 9.84/3.27 assume(oldX0 < 1 && oldX0 > 0); 9.84/3.27 x0 := oldX0; 9.84/3.27 x1 := oldX1; 9.84/3.27 TO: 3; 9.84/3.27 9.84/3.27 FROM: 2; 9.84/3.27 oldX0 := x0; 9.84/3.27 oldX1 := x1; 9.84/3.27 assume(oldX0 > 1 && oldX0 < 0); 9.84/3.27 x0 := oldX0; 9.84/3.27 x1 := oldX1; 9.84/3.27 TO: 3; 9.84/3.27 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