details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.2646381855 seconds
cpu usage	6.049977564
max memory	5.05790464E8

stage attributes

key	value
output-size	3717
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 18 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 12 ms] (6) IntTRS (7) TerminationGraphProcessor [EQUIVALENT, 5 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, y) -> f2(x_1, y) :|: TRUE f2(x1, x2) -> f3(x1, 23) :|: TRUE f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - x4 f5(x13, x14) -> f6(x13, x15) :|: TRUE && x15 = x14 + 1 f3(x7, x8) -> f4(x7, x8) :|: x7 >= 0 f6(x9, x10) -> f3(x9, x10) :|: TRUE f3(x11, x12) -> f7(x11, x12) :|: x11 < 0 Start term: f1(x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x7, x8) -> f4(x7, x8) :|: x7 >= 0 f6(x9, x10) -> f3(x9, x10) :|: TRUE f5(x13, x14) -> f6(x13, x15) :|: TRUE && x15 = x14 + 1 f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - x4 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1 ---------------------------------------- (7) TerminationGraphProcessor (EQUIVALENT) Constructed the termination graph and obtained one non-trivial SCC. f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1 has been transformed into f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1 && x4 > -1. f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1 && x4 > -1 and f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1 && x4 > -1 have been merged into the new rule f5(x12, x13) -> f5(x12 - (x13 + 1) - (x13 + 1 + 1), x13 + 1 + 1) :|: x12 > -1 && x14 > -1 && (x12 - (x13 + 1) > -1 && x15 > -1) ---------------------------------------- (8) Obligation: Rules: f5(x16, x17) -> f5(x16 + -2 * x17 + -3, x17 + 2) :|: TRUE && x16 >= 0 && x18 >= 0 && x16 + -1 * x17 >= 1 && x19 >= 0 popout

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

job log

popout

actions

all output return to C Integer