details

property	value
status	complete
benchmark	svcomp_ex2.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)	3.81613302231 seconds
cpu usage	11.985065075
max memory	9.76183296E8

stage attributes

key	value
output-size	8245
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, 104 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 16 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 15 ms] (10) AND (11) IntTRS (12) TerminationGraphProcessor [EQUIVALENT, 13 ms] (13) YES (14) IntTRS (15) TerminationGraphProcessor [EQUIVALENT, 0 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(c, flag, x, y, z) -> f2(0, flag, x, y, z) :|: TRUE f2(x1, x2, x3, x4, x5) -> f3(x1, 1, x3, x4, x5) :|: TRUE f3(x6, x7, x8, x9, x10) -> f4(x6, x7, x11, x9, x10) :|: TRUE f4(x12, x13, x14, x15, x16) -> f5(x12, x13, x14, x17, x16) :|: TRUE f5(x18, x19, x20, x21, x22) -> f6(x18, x19, x20, x21, x23) :|: TRUE f8(x24, x25, x26, x27, x28) -> f11(x24, x25, x26, arith, x28) :|: TRUE && arith = x26 * x27 f12(x99, x100, x101, x102, x103) -> f15(x99, x100, x101, x104, x103) :|: TRUE && x104 = 0 - x101 * x102 f13(x34, x35, x36, x37, x38) -> f16(x34, 0, x36, x37, x38) :|: TRUE f9(x39, x40, x41, x42, x43) -> f12(x39, x40, x41, x42, x43) :|: x42 > 0 && x41 < 0 - 1 f9(x44, x45, x46, x47, x48) -> f13(x44, x45, x46, x47, x48) :|: x47 <= 0 f9(x105, x106, x107, x108, x109) -> f13(x105, x106, x107, x108, x109) :|: x107 >= 0 - 1 f15(x49, x50, x51, x52, x53) -> f14(x49, x50, x51, x52, x53) :|: TRUE f16(x54, x55, x56, x57, x58) -> f14(x54, x55, x56, x57, x58) :|: TRUE f7(x59, x60, x61, x62, x63) -> f8(x59, x60, x61, x62, x63) :|: x62 > 0 && x61 > 1 f7(x64, x65, x66, x67, x68) -> f9(x64, x65, x66, x67, x68) :|: x67 <= 0 f7(x110, x111, x112, x113, x114) -> f9(x110, x111, x112, x113, x114) :|: x112 <= 1 f11(x69, x70, x71, x72, x73) -> f10(x69, x70, x71, x72, x73) :|: TRUE f14(x74, x75, x76, x77, x78) -> f10(x74, x75, x76, x77, x78) :|: TRUE f10(x115, x116, x117, x118, x119) -> f17(x120, x116, x117, x118, x119) :|: TRUE && x120 = x115 + 1 f6(x84, x85, x86, x87, x88) -> f7(x84, x85, x86, x87, x88) :|: x87 < x88 && x85 > 0 f17(x89, x90, x91, x92, x93) -> f6(x89, x90, x91, x92, x93) :|: TRUE f6(x94, x95, x96, x97, x98) -> f18(x94, x95, x96, x97, x98) :|: x97 >= x98 f6(x121, x122, x123, x124, x125) -> f18(x121, x122, x123, x124, x125) :|: x122 <= 0 Start term: f1(c, flag, x, y, z) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f6(x84, x85, x86, x87, x88) -> f7(x84, x85, x86, x87, x88) :|: x87 < x88 && x85 > 0 f17(x89, x90, x91, x92, x93) -> f6(x89, x90, x91, x92, x93) :|: TRUE f10(x115, x116, x117, x118, x119) -> f17(x120, x116, x117, x118, x119) :|: TRUE && x120 = x115 + 1 f11(x69, x70, x71, x72, x73) -> f10(x69, x70, x71, x72, x73) :|: TRUE f8(x24, x25, x26, x27, x28) -> f11(x24, x25, x26, arith, x28) :|: TRUE && arith = x26 * x27 f7(x59, x60, x61, x62, x63) -> f8(x59, x60, x61, x62, x63) :|: x62 > 0 && x61 > 1 f14(x74, x75, x76, x77, x78) -> f10(x74, x75, x76, x77, x78) :|: TRUE f15(x49, x50, x51, x52, x53) -> f14(x49, x50, x51, x52, x53) :|: TRUE f12(x99, x100, x101, x102, x103) -> f15(x99, x100, x101, x104, x103) :|: TRUE && x104 = 0 - x101 * x102 f9(x39, x40, x41, x42, x43) -> f12(x39, x40, x41, x42, x43) :|: x42 > 0 && x41 < 0 - 1 f7(x64, x65, x66, x67, x68) -> f9(x64, x65, x66, x67, x68) :|: x67 <= 0 f7(x110, x111, x112, x113, x114) -> f9(x110, x111, x112, x113, x114) :|: x112 <= 1 f16(x54, x55, x56, x57, x58) -> f14(x54, x55, x56, x57, x58) :|: TRUE f13(x34, x35, x36, x37, x38) -> f16(x34, 0, x36, x37, x38) :|: TRUE f9(x44, x45, x46, x47, x48) -> f13(x44, x45, x46, x47, x48) :|: x47 <= 0 f9(x105, x106, x107, x108, x109) -> f13(x105, x106, x107, x108, x109) :|: x107 >= 0 - 1 ---------------------------------------- popout

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

job log

popout

actions

all output return to C Integ Progr 58257