details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.52059 seconds
cpu usage	11.1247
user time	10.5843
system time	0.540368
max virtual memory	2.0109596E7
max residence set size	903372.0

stage attributes

key	value
starexec-result	NO

output

NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.c # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given C Problem could be disproven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) IRS2T2 [EQUIVALENT, 0 ms] (4) T2IntSys (5) T2 [COMPLETE, 1474 ms] (6) NO ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(a, b) -> f2(1, b) :|: TRUE f2(x, x1) -> f3(x, 2) :|: TRUE f4(x2, x3) -> f5(arith, x3) :|: TRUE && arith = x2 - x3 f5(x14, x15) -> f6(x14, x16) :|: TRUE && x16 = x14 + x15 f6(x17, x18) -> f7(x19, x18) :|: TRUE && x19 = x18 - x17 f3(x8, x9) -> f4(x8, x9) :|: x8 + x9 < 5 f7(x10, x11) -> f3(x10, x11) :|: TRUE f3(x12, x13) -> f8(x12, x13) :|: x12 + x13 >= 5 Start term: f1(a, b) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_2,1) (f2_2,2) (f3_2,3) (f4_2,4) (f5_2,5) (f6_2,6) (f7_2,7) (f8_2,8) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; assume(0 = 0); x0 := 1; x1 := oldX1; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; assume(0 = 0); x0 := oldX0; x1 := 2; TO: 3; FROM: 4; oldX0 := x0; oldX1 := x1; oldX2 := -(oldX1 - oldX0); assume(0 = 0 && oldX2 = oldX0 - oldX1); x0 := -(oldX1 - oldX0); x1 := oldX1; TO: 5; FROM: 5; oldX0 := x0; oldX1 := x1; oldX2 := -(-(oldX0 + oldX1)); assume(0 = 0 && oldX2 = oldX0 + oldX1); x0 := oldX0; x1 := -(-(oldX0 + oldX1)); TO: 6; FROM: 6; oldX0 := x0; oldX1 := x1; oldX2 := -(oldX0 - oldX1); assume(0 = 0 && oldX2 = oldX1 - oldX0); x0 := -(oldX0 - oldX1); popout

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

job log

popout

actions

all output return to C_Integer