details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.32902 seconds
cpu usage	6.00584
user time	5.68095
system time	0.324888
max virtual memory	1.90757E7
max residence set size	485980.0

stage attributes

key	value
starexec-result	YES

output

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