details

property	value
status	complete
benchmark	PodelskiRybalchenko-LICS2004-Fig1_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n143.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.48101 seconds
cpu usage	10.0525
user time	9.59968
system time	0.452791
max virtual memory	1.9220792E7
max residence set size	740480.0

stage attributes

key	value
starexec-result	YES

output

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