details

property	value
status	complete
benchmark	ChenFlurMukhopadhyay-SAS2012-Ex3.07_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n137.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.1629 seconds
cpu usage	6.29912
user time	5.92904
system time	0.37008
max virtual memory	3.8275796E7
max residence set size	493440.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.c # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) TerminationGraphProcessor [SOUND, 50 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) TerminationGraphProcessor [EQUIVALENT, 0 ms] (10) IntTRS (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IntTRS (13) PolynomialOrderProcessor [EQUIVALENT, 1 ms] (14) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, y, z) -> f2(x_1, y, z) :|: TRUE f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = x9 + x10 f6(x12, x13, x14) -> f7(x12, x14, x14) :|: TRUE f7(x27, x28, x29) -> f8(x27, x28, x30) :|: TRUE && x30 = 0 - x29 - 1 f4(x18, x19, x20) -> f5(x18, x19, x20) :|: x18 >= 0 f8(x21, x22, x23) -> f4(x21, x22, x23) :|: TRUE f4(x24, x25, x26) -> f9(x24, x25, x26) :|: x24 < 0 Start term: f1(x, y, z) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x18, x19, x20) -> f5(x18, x19, x20) :|: x18 >= 0 f8(x21, x22, x23) -> f4(x21, x22, x23) :|: TRUE f7(x27, x28, x29) -> f8(x27, x28, x30) :|: TRUE && x30 = 0 - x29 - 1 f6(x12, x13, x14) -> f7(x12, x14, x14) :|: TRUE f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = x9 + x10 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f6(x12:0, x13:0, x14:0) -> f6(x12:0 + x14:0, x14:0, 0 - x14:0 - 1) :|: x12:0 > -1 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f6(x1, x2, x3) -> f6(x1, x3) ---------------------------------------- (8) Obligation: Rules: f6(x12:0, x14:0) -> f6(x12:0 + x14:0, 0 - x14:0 - 1) :|: x12:0 > -1 ---------------------------------------- (9) TerminationGraphProcessor (EQUIVALENT) Constructed the termination graph and obtained one non-trivial SCC. f6(x12:0, x14:0) -> f6(x12:0 + x14:0, 0 - x14:0 - 1) :|: x12:0 > -1 has been transformed into f6(x12:0, x14:0) -> f6(x12:0 + x14:0, 0 - x14:0 - 1) :|: x12:0 > -1 && x4 > -1. popout

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

job log

popout

actions

all output return to C_Integer