details

property	value
status	complete
benchmark	ChenFlurMukhopadhyay-SAS2012-Ex3.02_false-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n056.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.21416 seconds
cpu usage	9.69462
user time	9.26694
system time	0.427686
max virtual memory	3.88426E7
max residence set size	737936.0

stage attributes

key	value
starexec-result	NO

output

9.39/3.14 NO 9.50/3.18 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 9.50/3.18 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.50/3.18 9.50/3.18 9.50/3.18 Termination of the given C Problem could be disproven: 9.50/3.18 9.50/3.18 (0) C Problem 9.50/3.18 (1) CToIRSProof [EQUIVALENT, 0 ms] 9.50/3.18 (2) IntTRS 9.50/3.18 (3) IRS2T2 [EQUIVALENT, 0 ms] 9.50/3.18 (4) T2IntSys 9.50/3.18 (5) T2 [COMPLETE, 1317 ms] 9.50/3.18 (6) NO 9.50/3.18 9.50/3.18 9.50/3.18 ---------------------------------------- 9.50/3.18 9.50/3.18 (0) 9.50/3.18 Obligation: 9.50/3.18 c file /export/starexec/sandbox/benchmark/theBenchmark.c 9.50/3.18 ---------------------------------------- 9.50/3.18 9.50/3.18 (1) CToIRSProof (EQUIVALENT) 9.50/3.18 Parsed C Integer Program as IRS. 9.50/3.18 ---------------------------------------- 9.50/3.18 9.50/3.18 (2) 9.50/3.18 Obligation: 9.50/3.18 Rules: 9.50/3.18 f1(x, y, z) -> f2(x_1, y, z) :|: TRUE 9.50/3.18 f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE 9.50/3.18 f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE 9.50/3.18 f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = x9 + x10 9.50/3.18 f6(x24, x25, x26) -> f7(x24, x27, x26) :|: TRUE && x27 = x25 + x26 9.50/3.18 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 > 0 9.50/3.18 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 9.50/3.18 f4(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 <= 0 9.50/3.19 Start term: f1(x, y, z) 9.50/3.19 9.50/3.19 ---------------------------------------- 9.50/3.19 9.50/3.19 (3) IRS2T2 (EQUIVALENT) 9.50/3.19 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 9.50/3.19 9.50/3.19 (f1_3,1) 9.50/3.19 (f2_3,2) 9.50/3.19 (f3_3,3) 9.50/3.19 (f4_3,4) 9.50/3.19 (f5_3,5) 9.50/3.19 (f6_3,6) 9.50/3.19 (f7_3,7) 9.50/3.19 (f8_3,8) 9.50/3.19 9.50/3.19 ---------------------------------------- 9.50/3.19 9.50/3.19 (4) 9.50/3.19 Obligation: 9.50/3.19 START: 1; 9.50/3.19 9.50/3.19 FROM: 1; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 oldX2 := x2; 9.50/3.19 oldX3 := nondet(); 9.50/3.19 assume(0 = 0); 9.50/3.19 x0 := oldX3; 9.50/3.19 x1 := oldX1; 9.50/3.19 x2 := oldX2; 9.50/3.19 TO: 2; 9.50/3.19 9.50/3.19 FROM: 2; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 oldX2 := x2; 9.50/3.19 oldX3 := nondet(); 9.50/3.19 assume(0 = 0); 9.50/3.19 x0 := oldX0; 9.50/3.19 x1 := oldX3; 9.50/3.19 x2 := oldX2; 9.50/3.19 TO: 3; 9.50/3.19 9.50/3.19 FROM: 3; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 oldX2 := x2; 9.50/3.19 oldX3 := nondet(); 9.50/3.19 assume(0 = 0); 9.50/3.19 x0 := oldX0; 9.50/3.19 x1 := oldX1; 9.50/3.19 x2 := oldX3; 9.50/3.19 TO: 4; 9.50/3.19 9.50/3.19 FROM: 5; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 oldX2 := x2; 9.50/3.19 oldX3 := -(-(oldX0 + oldX1)); 9.50/3.19 assume(0 = 0 && oldX3 = oldX0 + oldX1); 9.50/3.19 x0 := -(-(oldX0 + 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