details

property	value
status	complete
benchmark	Lobnya-Boolean-Reordered_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n058.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.46849799156 seconds
cpu usage	6.559430007
max memory	3.19545344E8

stage attributes

key	value
output-size	4400
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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, 57 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 14 ms] (10) AND (11) IntTRS (12) TerminationGraphProcessor [EQUIVALENT, 0 ms] (13) YES (14) IntTRS (15) TerminationGraphProcessor [EQUIVALENT, 8 ms] (16) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, b) -> f2(x_1, b) :|: TRUE f2(x1, x2) -> f3(x1, x3) :|: TRUE f4(x4, x5) -> f5(x4, x6) :|: TRUE f5(x7, x8) -> f6(arith, x8) :|: TRUE && arith = x7 - 1 f7(x9, x10) -> f10(x9, 1) :|: TRUE f8(x11, x12) -> f11(x11, 0) :|: TRUE f6(x13, x14) -> f7(x13, x14) :|: x13 >= 0 f6(x15, x16) -> f8(x15, x16) :|: x15 < 0 f10(x17, x18) -> f9(x17, x18) :|: TRUE f11(x19, x20) -> f9(x19, x20) :|: TRUE f3(x21, x22) -> f4(x21, x22) :|: x22 < 0 f3(x27, x28) -> f4(x27, x28) :|: x28 > 0 f9(x23, x24) -> f3(x23, x24) :|: TRUE f3(x25, x26) -> f12(x25, x26) :|: x26 = 0 Start term: f1(x, b) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x21, x22) -> f4(x21, x22) :|: x22 < 0 f9(x23, x24) -> f3(x23, x24) :|: TRUE f10(x17, x18) -> f9(x17, x18) :|: TRUE f7(x9, x10) -> f10(x9, 1) :|: TRUE f6(x13, x14) -> f7(x13, x14) :|: x13 >= 0 f5(x7, x8) -> f6(arith, x8) :|: TRUE && arith = x7 - 1 f4(x4, x5) -> f5(x4, x6) :|: TRUE f3(x27, x28) -> f4(x27, x28) :|: x28 > 0 f11(x19, x20) -> f9(x19, x20) :|: TRUE f8(x11, x12) -> f11(x11, 0) :|: TRUE f6(x15, x16) -> f8(x15, x16) :|: x15 < 0 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f9(x23:0, x24:0) -> f5(x23:0, x6:0) :|: x24:0 < 0 f5(x7:0, x8:0) -> f9(x7:0 - 1, 1) :|: x7:0 > 0 f5(x, x1) -> f9(x - 1, 0) :|: x < 1 f9(x2, x3) -> f5(x2, x4) :|: x3 > 0 ---------------------------------------- popout

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

job log

popout

actions

all output return to C Integ Progr 58257