details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.1455488205 seconds
cpu usage	5.358508546
max memory	4.58375168E8

stage attributes

key	value
output-size	4781
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, 68 ms] (4) AND (5) IntTRS (6) IntTRSCompressionProof [EQUIVALENT, 0 ms] (7) IntTRS (8) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (9) IntTRS (10) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (11) YES (12) IntTRS (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IntTRS (15) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (16) IntTRS (17) RankingReductionPairProof [EQUIVALENT, 4 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(i, j, c) -> f2(i, j, 0) :|: TRUE f2(x, x1, x2) -> f3(0, x1, x2) :|: TRUE f4(x3, x4, x5) -> f5(x3, x4, arith) :|: TRUE && arith = x5 + 1 f5(x36, x37, x38) -> f6(x39, x37, x38) :|: TRUE && x39 = x36 + 1 f3(x9, x10, x11) -> f4(x9, x10, x11) :|: x9 < 100 f6(x12, x13, x14) -> f3(x12, x13, x14) :|: TRUE f3(x15, x16, x17) -> f7(x15, x16, x17) :|: x15 >= 100 f7(x18, x19, x20) -> f8(x18, 5, x20) :|: TRUE f9(x40, x41, x42) -> f10(x40, x41, x43) :|: TRUE && x43 = x42 + 1 f10(x44, x45, x46) -> f11(x44, x47, x46) :|: TRUE && x47 = x45 + 3 f8(x27, x28, x29) -> f9(x27, x28, x29) :|: x28 < 21 f11(x30, x31, x32) -> f8(x30, x31, x32) :|: TRUE f8(x33, x34, x35) -> f12(x33, x34, x35) :|: x34 >= 21 Start term: f1(i, j, c) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained 2 non-trivial SCCs. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Rules: f3(x9, x10, x11) -> f4(x9, x10, x11) :|: x9 < 100 f6(x12, x13, x14) -> f3(x12, x13, x14) :|: TRUE f5(x36, x37, x38) -> f6(x39, x37, x38) :|: TRUE && x39 = x36 + 1 f4(x3, x4, x5) -> f5(x3, x4, arith) :|: TRUE && arith = x5 + 1 ---------------------------------------- (6) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (7) Obligation: Rules: f5(x36:0, x37:0, x38:0) -> f5(x36:0 + 1, x37:0, x38:0 + 1) :|: x36:0 < 99 ---------------------------------------- (8) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f5(x1, x2, x3) -> f5(x1) popout

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

job log

popout

actions

all output return to C Integer