details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.99925518036 seconds
cpu usage	8.263821413
max memory	8.62490624E8

stage attributes

key	value
output-size	5549
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, 76 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 11 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 10 ms] (8) AND (9) IntTRS (10) TerminationGraphProcessor [EQUIVALENT, 2 ms] (11) IntTRS (12) RankingReductionPairProof [EQUIVALENT, 4 ms] (13) YES (14) IntTRS (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IntTRS (17) RankingReductionPairProof [EQUIVALENT, 7 ms] (18) 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 f5(x4, x5) -> f8(arith, x5) :|: TRUE && arith = x4 - 1 f9(x32, x33) -> f12(x34, x33) :|: TRUE && x34 = x32 - 1 f10(x35, x36) -> f13(x35, x37) :|: TRUE && x37 = x36 - 1 f6(x10, x11) -> f9(x10, x11) :|: x10 = x11 f6(x12, x13) -> f10(x12, x13) :|: x12 < x13 f6(x38, x39) -> f10(x38, x39) :|: x38 > x39 f12(x14, x15) -> f11(x14, x15) :|: TRUE f13(x16, x17) -> f11(x16, x17) :|: TRUE f4(x18, x19) -> f5(x18, x19) :|: x18 > x19 f4(x20, x21) -> f6(x20, x21) :|: x20 <= x21 f8(x22, x23) -> f7(x22, x23) :|: TRUE f11(x24, x25) -> f7(x24, x25) :|: TRUE f3(x26, x27) -> f4(x26, x27) :|: x26 + x27 > 0 f7(x28, x29) -> f3(x28, x29) :|: TRUE f3(x30, x31) -> f14(x30, x31) :|: x30 + x31 <= 0 Start term: f1(x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x26, x27) -> f4(x26, x27) :|: x26 + x27 > 0 f7(x28, x29) -> f3(x28, x29) :|: TRUE f8(x22, x23) -> f7(x22, x23) :|: TRUE f5(x4, x5) -> f8(arith, x5) :|: TRUE && arith = x4 - 1 f4(x18, x19) -> f5(x18, x19) :|: x18 > x19 f11(x24, x25) -> f7(x24, x25) :|: TRUE f12(x14, x15) -> f11(x14, x15) :|: TRUE f9(x32, x33) -> f12(x34, x33) :|: TRUE && x34 = x32 - 1 f6(x10, x11) -> f9(x10, x11) :|: x10 = x11 f4(x20, x21) -> f6(x20, x21) :|: x20 <= x21 f13(x16, x17) -> f11(x16, x17) :|: TRUE f10(x35, x36) -> f13(x35, x37) :|: TRUE && x37 = x36 - 1 f6(x12, x13) -> f10(x12, x13) :|: x12 < x13 f6(x38, x39) -> f10(x38, x39) :|: x38 > x39 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: popout

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

job log

popout

actions

all output return to C Integer