details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.29327583313 seconds
cpu usage	6.146142303
max memory	4.86866944E8

stage attributes

key	value
output-size	4221
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) TerminationGraphProcessor [SOUND, 59 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 3 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(c, x, y) -> f2(c, x_1, y) :|: TRUE f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE f3(x5, x6, x7) -> f4(0, x6, x7) :|: TRUE f5(x8, x9, x10) -> f6(x8, x9, 0) :|: TRUE f7(x11, x12, x13) -> f8(x11, x12, arith) :|: TRUE && arith = x13 + 1 f8(x38, x39, x40) -> f9(x41, x39, x40) :|: TRUE && x41 = x38 + 1 f6(x17, x18, x19) -> f7(x17, x18, x19) :|: x19 < x18 f9(x20, x21, x22) -> f6(x20, x21, x22) :|: TRUE f6(x23, x24, x25) -> f10(x23, x24, x25) :|: x25 >= x24 f10(x42, x43, x44) -> f11(x42, x45, x44) :|: TRUE && x45 = x43 - 1 f4(x29, x30, x31) -> f5(x29, x30, x31) :|: x30 > 0 f11(x32, x33, x34) -> f4(x32, x33, x34) :|: TRUE f4(x35, x36, x37) -> f12(x35, x36, x37) :|: x36 <= 0 Start term: f1(c, x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x29, x30, x31) -> f5(x29, x30, x31) :|: x30 > 0 f11(x32, x33, x34) -> f4(x32, x33, x34) :|: TRUE f10(x42, x43, x44) -> f11(x42, x45, x44) :|: TRUE && x45 = x43 - 1 f6(x23, x24, x25) -> f10(x23, x24, x25) :|: x25 >= x24 f5(x8, x9, x10) -> f6(x8, x9, 0) :|: TRUE f9(x20, x21, x22) -> f6(x20, x21, x22) :|: TRUE f8(x38, x39, x40) -> f9(x41, x39, x40) :|: TRUE && x41 = x38 + 1 f7(x11, x12, x13) -> f8(x11, x12, arith) :|: TRUE && arith = x13 + 1 f6(x17, x18, x19) -> f7(x17, x18, x19) :|: x19 < x18 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f6(x23:0, x24:0, x25:0) -> f6(x23:0, x24:0 - 1, 0) :|: x25:0 >= x24:0 && x24:0 > 1 f6(x17:0, x18:0, x19:0) -> f6(x17:0 + 1, x18:0, x19:0 + 1) :|: x19:0 < x18:0 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f6(x1, x2, x3) -> f6(x2, x3) ---------------------------------------- (8) Obligation: popout

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

job log

popout

actions

all output return to C Integ Progr 58257