details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	1.77663183212 seconds
cpu usage	4.404693286
max memory	3.83389696E8

stage attributes

key	value
output-size	2190
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) TerminationGraphProcessor [SOUND, 20 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 30 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (8) 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, x3) :|: TRUE f4(x4, x5) -> f5(x4, arith) :|: TRUE && arith = x5 + 1 f3(x6, x7) -> f4(x6, x7) :|: x6 >= x7 + 1 f5(x8, x9) -> f3(x8, x9) :|: TRUE f3(x10, x11) -> f6(x10, x11) :|: x10 < x11 + 1 Start term: f1(x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x6, x7) -> f4(x6, x7) :|: x6 >= x7 + 1 f5(x8, x9) -> f3(x8, x9) :|: TRUE f4(x4, x5) -> f5(x4, arith) :|: TRUE && arith = x5 + 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x8:0, x9:0) -> f5(x8:0, x9:0 + 1) :|: x9:0 + 1 <= x8:0 ---------------------------------------- (7) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f5(x, x1)] = x - x1 The following rules are decreasing: f5(x8:0, x9:0) -> f5(x8:0, x9:0 + 1) :|: x9:0 + 1 <= x8:0 The following rules are bounded: f5(x8:0, x9:0) -> f5(x8:0, x9:0 + 1) :|: x9:0 + 1 <= x8:0 ---------------------------------------- (8) YES popout

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

job log

popout

actions

all output return to C Integ Progr 58257