details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	5.63974499702 seconds
cpu usage	19.533286479
max memory	1.47038208E9

stage attributes

key	value
output-size	10874
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, 103 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 20 ms] (8) AND (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) PolynomialOrderProcessor [EQUIVALENT, 10 ms] (13) IntTRS (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IntTRS (16) RankingReductionPairProof [EQUIVALENT, 13 ms] (17) YES (18) IntTRS (19) TerminationGraphProcessor [EQUIVALENT, 8 ms] (20) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(MAX, a, b, c) -> f2(1000, a, b, c) :|: TRUE f2(x, x1, x2, x3) -> f3(x, 1, x2, x3) :|: TRUE f3(x4, x5, x6, x7) -> f4(x4, x5, 1, x7) :|: TRUE f4(x8, x9, x10, x11) -> f5(x8, x9, x10, 1) :|: TRUE f6(x12, x13, x14, x15) -> f7(x12, arith, x14, x15) :|: TRUE && arith = x13 + 1 f8(x16, x17, x18, x19) -> f11(x16, 1, x18, x19) :|: TRUE f11(x76, x77, x78, x79) -> f12(x76, x77, x80, x79) :|: TRUE && x80 = x78 + 1 f7(x24, x25, x26, x27) -> f8(x24, x25, x26, x27) :|: x25 > x24 f7(x28, x29, x30, x31) -> f9(x28, x29, x30, x31) :|: x29 <= x28 f12(x32, x33, x34, x35) -> f10(x32, x33, x34, x35) :|: TRUE f9(x36, x37, x38, x39) -> f10(x36, x37, x38, x39) :|: TRUE f13(x40, x41, x42, x43) -> f16(x40, x41, 1, x43) :|: TRUE f16(x81, x82, x83, x84) -> f17(x81, x82, x83, x85) :|: TRUE && x85 = x84 + 1 f10(x48, x49, x50, x51) -> f13(x48, x49, x50, x51) :|: x50 > x48 f10(x52, x53, x54, x55) -> f14(x52, x53, x54, x55) :|: x54 <= x52 f17(x56, x57, x58, x59) -> f15(x56, x57, x58, x59) :|: TRUE f14(x60, x61, x62, x63) -> f15(x60, x61, x62, x63) :|: TRUE f5(x64, x65, x66, x67) -> f6(x64, x65, x66, x67) :|: x65 * x65 * x65 < x66 * x66 * x66 + x67 * x67 * x67 && x67 <= x64 f5(x86, x87, x88, x89) -> f6(x86, x87, x88, x89) :|: x87 * x87 * x87 > x88 * x88 * x88 + x89 * x89 * x89 && x89 <= x86 f15(x68, x69, x70, x71) -> f5(x68, x69, x70, x71) :|: TRUE f5(x72, x73, x74, x75) -> f18(x72, x73, x74, x75) :|: x73 * x73 * x73 = x74 * x74 * x74 + x75 * x75 * x75 f5(x90, x91, x92, x93) -> f18(x90, x91, x92, x93) :|: x93 > x90 Start term: f1(MAX, a, b, c) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f5(x64, x65, x66, x67) -> f6(x64, x65, x66, x67) :|: x65 * x65 * x65 < x66 * x66 * x66 + x67 * x67 * x67 && x67 <= x64 f15(x68, x69, x70, x71) -> f5(x68, x69, x70, x71) :|: TRUE f17(x56, x57, x58, x59) -> f15(x56, x57, x58, x59) :|: TRUE f16(x81, x82, x83, x84) -> f17(x81, x82, x83, x85) :|: TRUE && x85 = x84 + 1 f13(x40, x41, x42, x43) -> f16(x40, x41, 1, x43) :|: TRUE f10(x48, x49, x50, x51) -> f13(x48, x49, x50, x51) :|: x50 > x48 f12(x32, x33, x34, x35) -> f10(x32, x33, x34, x35) :|: TRUE f11(x76, x77, x78, x79) -> f12(x76, x77, x80, x79) :|: TRUE && x80 = x78 + 1 f8(x16, x17, x18, x19) -> f11(x16, 1, x18, x19) :|: TRUE f7(x24, x25, x26, x27) -> f8(x24, x25, x26, x27) :|: x25 > x24 f6(x12, x13, x14, x15) -> f7(x12, arith, x14, x15) :|: TRUE && arith = x13 + 1 f5(x86, x87, x88, x89) -> f6(x86, x87, x88, x89) :|: x87 * x87 * x87 > x88 * x88 * x88 + x89 * x89 * x89 && x89 <= x86 f9(x36, x37, x38, x39) -> f10(x36, x37, x38, x39) :|: TRUE f7(x28, x29, x30, x31) -> f9(x28, x29, x30, x31) :|: x29 <= x28 f14(x60, x61, x62, x63) -> f15(x60, x61, x62, x63) :|: TRUE f10(x52, x53, x54, x55) -> f14(x52, x53, x54, x55) :|: x54 <= x52 popout

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

job log

popout

actions

all output return to C Integ Progr 58257