details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.41976 seconds
cpu usage	10.1347
user time	9.69077
system time	0.443954
max virtual memory	1.9354356E7
max residence set size	883284.0

stage attributes

key	value
starexec-result	NO

output

9.91/3.35 NO 9.91/3.36 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 9.91/3.36 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.91/3.36 9.91/3.36 9.91/3.36 Termination of the given C Problem could be disproven: 9.91/3.36 9.91/3.36 (0) C Problem 9.91/3.36 (1) CToIRSProof [EQUIVALENT, 0 ms] 9.91/3.36 (2) IntTRS 9.91/3.36 (3) IRS2T2 [EQUIVALENT, 0 ms] 9.91/3.36 (4) T2IntSys 9.91/3.36 (5) T2 [COMPLETE, 1596 ms] 9.91/3.36 (6) NO 9.91/3.36 9.91/3.36 9.91/3.36 ---------------------------------------- 9.91/3.36 9.91/3.36 (0) 9.91/3.36 Obligation: 9.91/3.36 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 9.91/3.36 ---------------------------------------- 9.91/3.36 9.91/3.36 (1) CToIRSProof (EQUIVALENT) 9.91/3.36 Parsed C Integer Program as IRS. 9.91/3.36 ---------------------------------------- 9.91/3.36 9.91/3.36 (2) 9.91/3.36 Obligation: 9.91/3.36 Rules: 9.91/3.36 f1(i, j) -> f2(i, 100) :|: TRUE 9.91/3.36 f2(x, x1) -> f3(0, x1) :|: TRUE 9.91/3.36 f5(x2, x3) -> f8(arith, x3) :|: TRUE && arith = x2 + 1 9.91/3.36 f8(x24, x25) -> f9(x24, x26) :|: TRUE && x26 = x25 - 1 9.91/3.36 f6(x27, x28) -> f10(x29, x28) :|: TRUE && x29 = x27 - 1 9.91/3.36 f10(x30, x31) -> f11(x30, x32) :|: TRUE && x32 = x31 + 1 9.91/3.36 f4(x10, x11) -> f5(x10, x11) :|: 51 < x11 9.91/3.36 f4(x12, x13) -> f6(x12, x13) :|: 51 >= x13 9.91/3.36 f9(x14, x15) -> f7(x14, x15) :|: TRUE 9.91/3.36 f11(x16, x17) -> f7(x16, x17) :|: TRUE 9.91/3.36 f3(x18, x19) -> f4(x18, x19) :|: x18 < x19 9.91/3.36 f7(x20, x21) -> f3(x20, x21) :|: TRUE 9.91/3.36 f3(x22, x23) -> f12(x22, x23) :|: x22 >= x23 9.91/3.36 Start term: f1(i, j) 9.91/3.36 9.91/3.36 ---------------------------------------- 9.91/3.36 9.91/3.36 (3) IRS2T2 (EQUIVALENT) 9.91/3.36 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 9.91/3.36 9.91/3.36 (f1_2,1) 9.91/3.36 (f2_2,2) 9.91/3.36 (f3_2,3) 9.91/3.36 (f5_2,4) 9.91/3.36 (f8_2,5) 9.91/3.36 (f9_2,6) 9.91/3.36 (f6_2,7) 9.91/3.36 (f10_2,8) 9.91/3.36 (f11_2,9) 9.91/3.36 (f4_2,10) 9.91/3.36 (f7_2,11) 9.91/3.36 (f12_2,12) 9.91/3.36 9.91/3.36 ---------------------------------------- 9.91/3.36 9.91/3.36 (4) 9.91/3.36 Obligation: 9.91/3.36 START: 1; 9.91/3.36 9.91/3.36 FROM: 1; 9.91/3.36 oldX0 := x0; 9.91/3.36 oldX1 := x1; 9.91/3.36 assume(0 = 0); 9.91/3.36 x0 := oldX0; 9.91/3.36 x1 := 100; 9.91/3.36 TO: 2; 9.91/3.36 9.91/3.36 FROM: 2; 9.91/3.36 oldX0 := x0; 9.91/3.36 oldX1 := x1; 9.91/3.36 assume(0 = 0); 9.91/3.36 x0 := 0; 9.91/3.36 x1 := oldX1; 9.91/3.36 TO: 3; 9.91/3.36 9.91/3.36 FROM: 4; 9.91/3.36 oldX0 := x0; 9.91/3.36 oldX1 := x1; 9.91/3.36 oldX2 := -(-(oldX0 + 1)); 9.91/3.36 assume(0 = 0 && oldX2 = oldX0 + 1); 9.91/3.36 x0 := -(-(oldX0 + 1)); 9.91/3.36 x1 := oldX1; 9.91/3.36 TO: 5; 9.91/3.36 9.91/3.36 FROM: 5; 9.91/3.36 oldX0 := x0; 9.91/3.36 oldX1 := x1; 9.91/3.36 oldX2 := -(1 - oldX1); 9.91/3.36 assume(0 = 0 && oldX2 = oldX1 - 1); 9.91/3.36 x0 := oldX0; 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