details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	13.3866438866 seconds
cpu usage	50.022170669
max memory	4.187410432E9

stage attributes

key	value
output-size	10226
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, 91 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 50 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) TerminationGraphProcessor [EQUIVALENT, 23 ms] (10) IntTRS (11) IntTRSCompressionProof [EQUIVALENT, 3 ms] (12) IntTRS (13) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (14) IntTRS (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IntTRS (17) PolynomialOrderProcessor [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 f5(x5, x6, x7) -> f8(x5, x6, x6) :|: TRUE f6(x8, x9, x10) -> f9(x8, x9, x8) :|: TRUE f4(x11, x12, x13) -> f5(x11, x12, x13) :|: x11 > x12 f4(x14, x15, x16) -> f6(x14, x15, x16) :|: x14 <= x15 f8(x17, x18, x19) -> f7(x17, x18, x19) :|: TRUE f9(x20, x21, x22) -> f7(x20, x21, x22) :|: TRUE f10(x23, x24, x25) -> f13(x23, arith, x25) :|: TRUE && arith = x24 + x23 f13(x64, x65, x66) -> f14(x67, x65, x66) :|: TRUE && x67 = x66 - 1 f14(x68, x69, x70) -> f15(x68, x69, x71) :|: TRUE && x71 = x69 + x70 f11(x72, x73, x74) -> f16(x75, x73, x74) :|: TRUE && x75 = x73 + x72 f16(x76, x77, x78) -> f17(x76, x79, x78) :|: TRUE && x79 = x78 - 1 f17(x80, x81, x82) -> f18(x80, x81, x83) :|: TRUE && x83 = x80 + x82 f7(x41, x42, x43) -> f10(x41, x42, x43) :|: x44 < 0 f7(x84, x85, x86) -> f10(x84, x85, x86) :|: x87 > 0 f7(x45, x46, x47) -> f11(x45, x46, x47) :|: x48 = 0 f15(x49, x50, x51) -> f12(x49, x50, x51) :|: TRUE f18(x52, x53, x54) -> f12(x52, x53, x54) :|: TRUE f3(x55, x56, x57) -> f4(x55, x56, x57) :|: x56 > 0 && x55 > 0 f12(x58, x59, x60) -> f3(x58, x59, x60) :|: TRUE f3(x61, x62, x63) -> f19(x61, x62, x63) :|: x62 <= 0 f3(x88, x89, x90) -> f19(x88, x89, x90) :|: x88 <= 0 Start term: f1(x, y, z) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x55, x56, x57) -> f4(x55, x56, x57) :|: x56 > 0 && x55 > 0 f12(x58, x59, x60) -> f3(x58, x59, x60) :|: TRUE f15(x49, x50, x51) -> f12(x49, x50, x51) :|: TRUE f14(x68, x69, x70) -> f15(x68, x69, x71) :|: TRUE && x71 = x69 + x70 f13(x64, x65, x66) -> f14(x67, x65, x66) :|: TRUE && x67 = x66 - 1 f10(x23, x24, x25) -> f13(x23, arith, x25) :|: TRUE && arith = x24 + x23 f7(x41, x42, x43) -> f10(x41, x42, x43) :|: x44 < 0 f8(x17, x18, x19) -> f7(x17, x18, x19) :|: TRUE f5(x5, x6, x7) -> f8(x5, x6, x6) :|: TRUE f4(x11, x12, x13) -> f5(x11, x12, x13) :|: x11 > x12 f9(x20, x21, x22) -> f7(x20, x21, x22) :|: TRUE f6(x8, x9, x10) -> f9(x8, x9, x8) :|: TRUE f4(x14, x15, x16) -> f6(x14, x15, x16) :|: x14 <= x15 f7(x84, x85, x86) -> f10(x84, x85, x86) :|: x87 > 0 f18(x52, x53, x54) -> f12(x52, x53, x54) :|: TRUE f17(x80, x81, x82) -> f18(x80, x81, x83) :|: TRUE && x83 = x80 + x82 f16(x76, x77, x78) -> f17(x76, x79, x78) :|: TRUE && x79 = x78 - 1 popout

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

job log

popout

actions

all output return to C Integer