details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.30404 seconds
cpu usage	5.83089
user time	5.50939
system time	0.321498
max virtual memory	1.9241344E7
max residence set size	459108.0

stage attributes

key	value
starexec-result	YES

output

5.72/2.26 YES 5.72/2.27 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 5.72/2.27 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.72/2.27 5.72/2.27 5.72/2.27 Termination of the given C Problem could be proven: 5.72/2.27 5.72/2.27 (0) C Problem 5.72/2.27 (1) CToIRSProof [EQUIVALENT, 0 ms] 5.72/2.27 (2) IntTRS 5.72/2.27 (3) TerminationGraphProcessor [SOUND, 52 ms] 5.72/2.27 (4) IntTRS 5.72/2.27 (5) IntTRSCompressionProof [EQUIVALENT, 26 ms] 5.72/2.27 (6) IntTRS 5.72/2.27 (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] 5.72/2.27 (8) IntTRS 5.72/2.27 (9) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 5.72/2.27 (10) YES 5.72/2.27 5.72/2.27 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (0) 5.72/2.27 Obligation: 5.72/2.27 c file /export/starexec/sandbox/benchmark/theBenchmark.c 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (1) CToIRSProof (EQUIVALENT) 5.72/2.27 Parsed C Integer Program as IRS. 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (2) 5.72/2.27 Obligation: 5.72/2.27 Rules: 5.72/2.27 f1(x, y, z) -> f2(x_1, y, z) :|: TRUE 5.72/2.27 f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE 5.72/2.27 f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE 5.72/2.27 f6(x9, x10, x11) -> f7(arith, x10, x11) :|: TRUE && arith = x9 - 1 5.72/2.27 f7(x33, x34, x35) -> f8(x33, x36, x35) :|: TRUE && x36 = x34 - 1 5.72/2.27 f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x16 > x17 5.72/2.27 f8(x18, x19, x20) -> f5(x18, x19, x20) :|: TRUE 5.72/2.27 f5(x21, x22, x23) -> f9(x21, x22, x23) :|: x22 <= x23 5.72/2.27 f4(x24, x25, x26) -> f5(x24, x25, x26) :|: x24 = x25 && x24 > x26 5.72/2.27 f9(x27, x28, x29) -> f4(x27, x28, x29) :|: TRUE 5.72/2.27 f4(x30, x31, x32) -> f10(x30, x31, x32) :|: x30 <= x32 5.72/2.27 f4(x37, x38, x39) -> f10(x37, x38, x39) :|: x37 < x38 5.72/2.27 f4(x40, x41, x42) -> f10(x40, x41, x42) :|: x40 > x41 5.72/2.27 Start term: f1(x, y, z) 5.72/2.27 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (3) TerminationGraphProcessor (SOUND) 5.72/2.27 Constructed the termination graph and obtained one non-trivial SCC. 5.72/2.27 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (4) 5.72/2.27 Obligation: 5.72/2.27 Rules: 5.72/2.27 f4(x24, x25, x26) -> f5(x24, x25, x26) :|: x24 = x25 && x24 > x26 5.72/2.27 f9(x27, x28, x29) -> f4(x27, x28, x29) :|: TRUE 5.72/2.27 f5(x21, x22, x23) -> f9(x21, x22, x23) :|: x22 <= x23 5.72/2.27 f8(x18, x19, x20) -> f5(x18, x19, x20) :|: TRUE 5.72/2.27 f7(x33, x34, x35) -> f8(x33, x36, x35) :|: TRUE && x36 = x34 - 1 5.72/2.27 f6(x9, x10, x11) -> f7(arith, x10, x11) :|: TRUE && arith = x9 - 1 5.72/2.27 f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x16 > x17 5.72/2.27 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (5) IntTRSCompressionProof (EQUIVALENT) 5.72/2.27 Compressed rules. 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (6) 5.72/2.27 Obligation: 5.72/2.27 Rules: 5.72/2.27 f5(x15:0, x16:0, x17:0) -> f5(x15:0 - 1, x16:0 - 1, x17:0) :|: x17:0 < x16:0 5.72/2.27 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) 5.72/2.27 Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: 5.72/2.27 5.72/2.27 f5(x1, x2, x3) -> f5(x2, x3) 5.72/2.27 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (8) 5.72/2.27 Obligation: 5.72/2.27 Rules: 5.72/2.27 f5(x16:0, x17:0) -> f5(x16:0 - 1, x17:0) :|: x17:0 < x16:0 5.72/2.27 5.72/2.27 ---------------------------------------- 5.72/2.27 5.72/2.27 (9) PolynomialOrderProcessor (EQUIVALENT) 5.72/2.27 Found the following polynomial interpretation: 5.72/2.27 [f5(x, x1)] = x - x1 5.72/2.27 5.72/2.27 The following rules are decreasing: 5.72/2.27 f5(x16:0, x17:0) -> f5(x16:0 - 1, x17:0) :|: x17:0 < x16:0 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