details

property	value
status	complete
benchmark	Ben-Amram-LMCS2010-Ex2.3_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n137.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	5.70259 seconds
cpu usage	19.158
user time	18.1363
system time	1.02166
max virtual memory	3.8198128E7
max residence set size	2419496.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, 80 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 53 ms] (6) IntTRS (7) TerminationGraphProcessor [EQUIVALENT, 9 ms] (8) AND (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (13) YES (14) IntTRS (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IntTRS (17) RankingReductionPairProof [EQUIVALENT, 0 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, z) -> f2(x_1, y, z) :|: TRUE f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE f6(x9, x10, x11) -> f9(x9, x11, x11) :|: TRUE f9(x12, x13, x14) -> f10(x15, x13, x14) :|: TRUE f10(x16, x17, x18) -> f11(x16, x17, arith) :|: TRUE && arith = x16 - 1 f7(x50, x51, x52) -> f12(x50, x51, x53) :|: TRUE && x53 = x52 - 1 f12(x22, x23, x24) -> f13(x25, x23, x24) :|: TRUE f13(x54, x55, x56) -> f14(x54, x57, x56) :|: TRUE && x57 = x54 - 1 f5(x29, x30, x31) -> f6(x29, x30, x31) :|: x30 > x29 f5(x32, x33, x34) -> f7(x32, x33, x34) :|: x33 <= x32 f11(x35, x36, x37) -> f8(x35, x36, x37) :|: TRUE f14(x38, x39, x40) -> f8(x38, x39, x40) :|: TRUE f4(x41, x42, x43) -> f5(x41, x42, x43) :|: x41 > 0 && x42 > 0 && x43 > 0 f8(x44, x45, x46) -> f4(x44, x45, x46) :|: TRUE f4(x47, x48, x49) -> f15(x47, x48, x49) :|: x49 <= 0 f4(x58, x59, x60) -> f15(x58, x59, x60) :|: x58 <= 0 f4(x61, x62, x63) -> f15(x61, x62, x63) :|: x62 <= 0 Start term: f1(x, y, z) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x41, x42, x43) -> f5(x41, x42, x43) :|: x41 > 0 && x42 > 0 && x43 > 0 f8(x44, x45, x46) -> f4(x44, x45, x46) :|: TRUE f11(x35, x36, x37) -> f8(x35, x36, x37) :|: TRUE f10(x16, x17, x18) -> f11(x16, x17, arith) :|: TRUE && arith = x16 - 1 f9(x12, x13, x14) -> f10(x15, x13, x14) :|: TRUE f6(x9, x10, x11) -> f9(x9, x11, x11) :|: TRUE f5(x29, x30, x31) -> f6(x29, x30, x31) :|: x30 > x29 f14(x38, x39, x40) -> f8(x38, x39, x40) :|: TRUE f13(x54, x55, x56) -> f14(x54, x57, x56) :|: TRUE && x57 = x54 - 1 f12(x22, x23, x24) -> f13(x25, x23, x24) :|: TRUE f7(x50, x51, x52) -> f12(x50, x51, x53) :|: TRUE && x53 = x52 - 1 f5(x32, x33, x34) -> f7(x32, x33, x34) :|: x33 <= x32 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f8(x44:0, x45:0, x46:0) -> f8(x25:0, x25:0 - 1, x46:0 - 1) :|: x46:0 > 0 && x45:0 <= x44:0 && x45:0 > 0 && x44:0 > 0 f8(x, x1, x2) -> f8(x3, x2, x3 - 1) :|: x2 > 0 && x1 > x && x1 > 0 && x > 0 ---------------------------------------- (7) TerminationGraphProcessor (EQUIVALENT) popout

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

job log

popout

actions

all output return to C_Integer