details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	8.21841 seconds
cpu usage	16.4188
user time	15.5596
system time	0.859224
max virtual memory	3.7110856E7
max residence set size	1026764.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.c # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given C Problem could not be shown: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) IRS2T2 [EQUIVALENT, 0 ms] (4) T2IntSys (5) T2 Underapproximation [COMPLETE, 3021 ms] (6) T2IntSys (7) T2 Underapproximation [COMPLETE, 3213 ms] (8) T2IntSys (9) TerminationGraphProcessor [SOUND, 138 ms] (10) IntTRS (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IntTRS (13) PolynomialOrderProcessor [EQUIVALENT, 25 ms] (14) IntTRS (15) TerminationGraphProcessor [EQUIVALENT, 82 ms] (16) IntTRS (17) IntTRSCompressionProof [EQUIVALENT, 0 ms] (18) IntTRS (19) IntTRSNonPeriodicNontermProof [COMPLETE, 6 ms] (20) NO (21) CToLLVMProof [EQUIVALENT, 133 ms] (22) LLVM problem ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(i, j) -> f2(x_1, j) :|: TRUE f2(x, x1) -> f3(x, x) :|: TRUE f5(x2, x3) -> f8(arith, x3) :|: TRUE && arith = x2 + 1 f9(x78, x79) -> f12(x78, x80) :|: TRUE && x80 = x79 + 1 f13(x81, x82) -> f16(x83, x82) :|: TRUE && x83 = x81 + 1 f14(x84, x85) -> f17(x84, x86) :|: TRUE && x86 = x85 + 1 f12(x10, x11) -> f13(x10, x11) :|: x10 - x11 > 2 f12(x12, x13) -> f14(x12, x13) :|: x12 - x13 <= 2 f16(x14, x15) -> f15(x14, x15) :|: TRUE f17(x16, x17) -> f15(x16, x17) :|: TRUE f10(x87, x88) -> f18(x87, x89) :|: TRUE && x89 = x88 - 1 f8(x20, x21) -> f9(x20, x21) :|: x21 < 5 f8(x22, x23) -> f10(x22, x23) :|: x23 >= 5 f15(x24, x25) -> f11(x24, x25) :|: TRUE f18(x26, x27) -> f11(x26, x27) :|: TRUE f19(x90, x91) -> f22(x92, x91) :|: TRUE && x92 = x90 - 1 f23(x93, x94) -> f26(x93, x95) :|: TRUE && x95 = x94 + 1 f24(x96, x97) -> f27(x98, x97) :|: TRUE && x98 = x96 + 1 f22(x34, x35) -> f23(x34, x35) :|: x35 < 0 - 1 f22(x36, x37) -> f24(x36, x37) :|: x37 >= 0 - 1 f26(x38, x39) -> f25(x38, x39) :|: TRUE f27(x40, x41) -> f25(x40, x41) :|: TRUE f20(x99, x100) -> f28(x101, x100) :|: TRUE && x101 = x99 + 1 f29(x102, x103) -> f32(x102, x104) :|: TRUE && x104 = x103 - 1 f30(x105, x106) -> f33(x105, x107) :|: TRUE && x107 = x106 + 1 f28(x48, x49) -> f29(x48, x49) :|: x49 * 2 > x48 f28(x50, x51) -> f30(x50, x51) :|: x51 * 2 <= x50 f32(x52, x53) -> f31(x52, x53) :|: TRUE f33(x54, x55) -> f31(x54, x55) :|: TRUE f6(x56, x57) -> f19(x56, x57) :|: x56 > 0 && x57 < 0 f6(x58, x59) -> f20(x58, x59) :|: x58 <= 0 f6(x108, x109) -> f20(x108, x109) :|: x109 >= 0 f25(x60, x61) -> f21(x60, x61) :|: TRUE f31(x62, x63) -> f21(x62, x63) :|: TRUE f4(x64, x65) -> f5(x64, x65) :|: x64 >= x65 f4(x66, x67) -> f6(x66, x67) :|: x66 < x67 f11(x68, x69) -> f7(x68, x69) :|: TRUE f21(x70, x71) -> f7(x70, x71) :|: TRUE f3(x72, x73) -> f4(x72, x73) :|: x72 > 0 f7(x74, x75) -> f3(x74, x75) :|: TRUE f3(x76, x77) -> f34(x76, x77) :|: x76 <= 0 Start term: f1(i, j) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_2,1) (f2_2,2) (f3_2,3) (f5_2,4) (f8_2,5) (f9_2,6) popout

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

job log

popout

actions

all output return to C_Integer