details

property	value
status	complete
benchmark	BrockschmidtCookFuhs-CAV2013-Introduction_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n149.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.91425 seconds
cpu usage	8.77547
user time	8.2911
system time	0.484374
max virtual memory	1.9873364E7
max residence set size	803496.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, 45 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) CaseAnalysis [EQUIVALENT, 14 ms] (8) AND (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (13) YES (14) IntTRS (15) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (16) 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) -> f2(x_1, y) :|: TRUE f2(x1, x2) -> f3(x1, 1) :|: 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 > 0 ---------------------------------------- (7) CaseAnalysis (EQUIVALENT) Found the following inductive condition: f5(x0, x1): x1>=0 ---------------------------------------- (8) Complex Obligation (AND) ---------------------------------------- (9) Obligation: Rules: f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > 0 && x14:0 >= 0 ---------------------------------------- (10) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (11) popout

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

job log

popout

actions

all output return to C_Integer