details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.09897 seconds
cpu usage	5.35478
user time	5.09521
system time	0.259562
max virtual memory	1.920874E7
max residence set size	426436.0

stage attributes

key	value
starexec-result	YES

output

4.97/2.05 YES 4.97/2.07 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 4.97/2.07 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.97/2.07 4.97/2.07 4.97/2.07 Termination of the given C Problem could be proven: 4.97/2.07 4.97/2.07 (0) C Problem 4.97/2.07 (1) CToIRSProof [EQUIVALENT, 0 ms] 4.97/2.07 (2) IntTRS 4.97/2.07 (3) TerminationGraphProcessor [SOUND, 45 ms] 4.97/2.07 (4) IntTRS 4.97/2.07 (5) IntTRSCompressionProof [EQUIVALENT, 23 ms] 4.97/2.07 (6) IntTRS 4.97/2.07 (7) RankingReductionPairProof [EQUIVALENT, 0 ms] 4.97/2.07 (8) YES 4.97/2.07 4.97/2.07 4.97/2.07 ---------------------------------------- 4.97/2.07 4.97/2.07 (0) 4.97/2.07 Obligation: 4.97/2.07 c file /export/starexec/sandbox/benchmark/theBenchmark.c 4.97/2.07 ---------------------------------------- 4.97/2.07 4.97/2.07 (1) CToIRSProof (EQUIVALENT) 4.97/2.07 Parsed C Integer Program as IRS. 4.97/2.07 ---------------------------------------- 4.97/2.07 4.97/2.07 (2) 4.97/2.07 Obligation: 4.97/2.07 Rules: 4.97/2.07 f1(x, y, z) -> f2(x_1, y, z) :|: TRUE 4.97/2.07 f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE 4.97/2.07 f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE 4.97/2.07 f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = x9 - 1 4.97/2.07 f6(x24, x25, x26) -> f7(x24, x27, x26) :|: TRUE && x27 = x25 - 1 4.97/2.07 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 > x17 && x16 > x17 5.31/2.07 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 5.31/2.07 f4(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 <= x23 5.31/2.07 f4(x28, x29, x30) -> f8(x28, x29, x30) :|: x29 <= x30 5.31/2.07 Start term: f1(x, y, z) 5.31/2.07 5.31/2.07 ---------------------------------------- 5.31/2.07 5.31/2.07 (3) TerminationGraphProcessor (SOUND) 5.31/2.07 Constructed the termination graph and obtained one non-trivial SCC. 5.31/2.07 5.31/2.07 ---------------------------------------- 5.31/2.07 5.31/2.07 (4) 5.31/2.07 Obligation: 5.31/2.07 Rules: 5.31/2.07 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 > x17 && x16 > x17 5.31/2.07 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 5.31/2.07 f6(x24, x25, x26) -> f7(x24, x27, x26) :|: TRUE && x27 = x25 - 1 5.31/2.07 f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = x9 - 1 5.31/2.07 5.31/2.07 ---------------------------------------- 5.31/2.07 5.31/2.07 (5) IntTRSCompressionProof (EQUIVALENT) 5.31/2.07 Compressed rules. 5.31/2.07 ---------------------------------------- 5.31/2.07 5.31/2.07 (6) 5.31/2.07 Obligation: 5.31/2.07 Rules: 5.31/2.07 f6(x24:0, x25:0, x26:0) -> f6(x24:0 - 1, x25:0 - 1, x26:0) :|: x26:0 < x24:0 && x26:0 < x25:0 - 1 5.31/2.07 5.31/2.07 ---------------------------------------- 5.31/2.07 5.31/2.07 (7) RankingReductionPairProof (EQUIVALENT) 5.31/2.07 Interpretation: 5.31/2.07 [ f6 ] = -1*f6_3 + f6_2 5.31/2.07 5.31/2.07 The following rules are decreasing: 5.31/2.07 f6(x24:0, x25:0, x26:0) -> f6(x24:0 - 1, x25:0 - 1, x26:0) :|: x26:0 < x24:0 && x26:0 < x25:0 - 1 5.31/2.07 5.31/2.07 The following rules are bounded: 5.31/2.07 f6(x24:0, x25:0, x26:0) -> f6(x24:0 - 1, x25:0 - 1, x26:0) :|: x26:0 < x24:0 && x26:0 < x25:0 - 1 5.31/2.07 5.31/2.07 5.31/2.07 ---------------------------------------- 5.31/2.07 5.31/2.07 (8) 5.31/2.07 YES 5.32/2.09 EOF 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