details

property	value
status	complete
benchmark	CookSeeZuleger-TACAS2013-Fig8a-modified_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n139.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.58625 seconds
cpu usage	10.7892
user time	10.1791
system time	0.610155
max virtual memory	3.8174644E7
max residence set size	983224.0

stage attributes

key	value
starexec-result	YES

output

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, 55 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 42 ms] (6) IntTRS (7) CaseAnalysis [EQUIVALENT, 18 ms] (8) AND (9) IntTRS (10) TerminationGraphProcessor [EQUIVALENT, 15 ms] (11) IntTRS (12) IntTRSCompressionProof [EQUIVALENT, 0 ms] (13) IntTRS (14) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (15) YES (16) IntTRS (17) TerminationGraphProcessor [EQUIVALENT, 17 ms] (18) IntTRS (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IntTRS (21) RankingReductionPairProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(K, x) -> f2(x_1, x) :|: TRUE f2(x1, x2) -> f3(x1, x3) :|: TRUE f5(x4, x5) -> f8(x4, arith) :|: TRUE && arith = x5 - 1 f6(x22, x23) -> f9(x22, x24) :|: TRUE && x24 = x23 + 1 f4(x8, x9) -> f5(x8, x9) :|: x9 > x8 f4(x10, x11) -> f6(x10, x11) :|: x11 <= x10 f8(x12, x13) -> f7(x12, x13) :|: TRUE f9(x14, x15) -> f7(x14, x15) :|: TRUE f3(x16, x17) -> f4(x16, x17) :|: x17 < x16 f3(x25, x26) -> f4(x25, x26) :|: x26 > x25 f7(x18, x19) -> f3(x18, x19) :|: TRUE f3(x20, x21) -> f10(x20, x21) :|: x21 = x20 Start term: f1(K, x) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x16, x17) -> f4(x16, x17) :|: x17 < x16 f7(x18, x19) -> f3(x18, x19) :|: TRUE f8(x12, x13) -> f7(x12, x13) :|: TRUE f5(x4, x5) -> f8(x4, arith) :|: TRUE && arith = x5 - 1 f4(x8, x9) -> f5(x8, x9) :|: x9 > x8 f3(x25, x26) -> f4(x25, x26) :|: x26 > x25 f9(x14, x15) -> f7(x14, x15) :|: TRUE f6(x22, x23) -> f9(x22, x24) :|: TRUE && x24 = x23 + 1 f4(x10, x11) -> f6(x10, x11) :|: x11 <= x10 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f7(x18:0, x19:0) -> f4(x18:0, x19:0) :|: x19:0 > x18:0 f4(x10:0, x11:0) -> f7(x10:0, x11:0 + 1) :|: x11:0 <= x10:0 f4(x8:0, x9:0) -> f7(x8:0, x9:0 - 1) :|: x9:0 > x8:0 f7(x, x1) -> f4(x, x1) :|: x1 < x ---------------------------------------- (7) CaseAnalysis (EQUIVALENT) Found the following inductive condition: f7(x, x1): -3*x + 3*x1>=0 f4(x2, x3): -3*x2 + 3*x3>=0 popout

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

job log

popout

actions

all output return to C_Integer