NO
proof of prog.inttrs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given IRSwT could be disproven:

(0) IRSwT
(1) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(2) IRSwT
(3) IRSwTTerminationDigraphProof [EQUIVALENT, 9172 ms]
(4) AND
    (5) IRSwT
        (6) IntTRSCompressionProof [EQUIVALENT, 7 ms]
        (7) IRSwT
        (8) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (9) IRSwT
        (10) TempFilterProof [SOUND, 88 ms]
        (11) IntTRS
        (12) RankingReductionPairProof [EQUIVALENT, 29 ms]
        (13) IntTRS
        (14) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (15) IntTRS
        (16) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (17) YES
    (18) IRSwT
        (19) IntTRSCompressionProof [EQUIVALENT, 5 ms]
        (20) IRSwT
        (21) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) TempFilterProof [SOUND, 40 ms]
        (24) IntTRS
        (25) PolynomialOrderProcessor [EQUIVALENT, 16 ms]
        (26) YES
    (27) IRSwT
        (28) IntTRSCompressionProof [EQUIVALENT, 15 ms]
        (29) IRSwT
        (30) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (31) IRSwT
        (32) FilterProof [EQUIVALENT, 0 ms]
        (33) IntTRS
        (34) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (35) IntTRS
        (36) IntTRSPeriodicNontermProof [COMPLETE, 0 ms]
        (37) NO
    (38) IRSwT
        (39) IntTRSCompressionProof [EQUIVALENT, 4 ms]
        (40) IRSwT
        (41) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (42) IRSwT
        (43) FilterProof [EQUIVALENT, 0 ms]
        (44) IntTRS
        (45) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (46) IntTRS
        (47) IntTRSPeriodicNontermProof [COMPLETE, 5 ms]
        (48) NO


----------------------------------------

(0)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2, arg3, arg4, arg5, arg6, arg7) -> f988_0_random_GT(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P, arg7P) :|: -1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && -1 <= arg2 - 1 && arg1P <= arg1
f121_0_createList_Return(x, x1, x2, x3, x4, x6, x7) -> f988_0_random_GT(x8, x9, x11, x12, x13, x14, x15) :|: x8 <= x && -1 <= x18 - 1 && x9 + 1 <= x && 0 <= x - 1 && 0 <= x8 - 1 && -1 <= x9 - 1
f988_0_random_GT(x19, x20, x21, x23, x24, x25, x26) -> f1007_0_main_InvokeMethod(x27, x28, x29, x30, x31, x32, x33) :|: x27 <= x19 && x34 <= x29 && x27 - 1 <= x20 && x28 <= x20 && 0 <= x19 - 1 && -1 <= x20 - 1 && 0 <= x27 - 1 && -1 <= x28 - 1
f988_0_random_GT(x35, x36, x37, x38, x39, x40, x41) -> f1007_0_main_InvokeMethod(x42, x43, x44, x45, x46, x47, x48) :|: x49 <= x50 - 1 && -1 <= x49 - 1 && x42 <= x35 && x42 - 1 <= x36 && x43 <= x36 && 0 <= x35 - 1 && -1 <= x36 - 1 && 0 <= x42 - 1 && -1 <= x43 - 1 && x49 + 1 = x44
f1007_0_main_InvokeMethod(x51, x52, x53, x54, x55, x56, x57) -> f1127_0_find_InvokeMethod(x58, x59, x60, x61, x62, x63, x64) :|: x58 <= x51 && x65 <= x53 && x58 <= x52 && 0 <= x51 - 1 && 0 <= x52 - 1 && 0 <= x58 - 1 && 1 <= x59 - 1
f1_0_main_Load(x66, x67, x68, x69, x70, x71, x72) -> f1273_0_createList_GE(x73, x74, x75, x76, x77, x78, x79) :|: 0 = x77 && 0 = x76 && 0 = x75 && 0 = x74 && 0 = x67 && -1 <= x73 - 1 && 0 <= x66 - 1 && x73 + 1 <= x66
f1_0_main_Load(x80, x81, x83, x84, x85, x86, x87) -> f1273_0_createList_GE(x88, x89, x92, x93, x94, x95, x96) :|: 1 = x94 && x81 = x93 && 0 = x92 && 0 = x89 && -1 <= x88 - 1 && 0 <= x80 - 1 && 0 <= x81 - 1 && x88 + 1 <= x80
f1_0_main_Load(x97, x99, x100, x101, x102, x103, x104) -> f1273_0_createList_GE(x105, x106, x107, x108, x109, x110, x111) :|: 1 = x109 && x99 = x108 && 0 = x106 && -1 <= x105 - 1 && 0 <= x97 - 1 && x105 + 1 <= x97 && 0 <= x99 - 1 && -1 <= x107 - 1
f1273_0_createList_GE(x112, x113, x116, x117, x118, x119, x120) -> f1273_0_createList_GE(x121, x122, x123, x124, x125, x126, x127) :|: x118 = x125 && x117 = x124 && x116 = x123 && x113 + 1 = x122 && 1 <= x121 - 1 && -1 <= x112 - 1 && x121 - 2 <= x112 && -1 <= x117 - 1 && x113 <= x116 - 1 && x117 <= x118
f1273_0_createList_GE(x128, x129, x130, x131, x132, x133, x134) -> f1273_0_createList_GE(x135, x136, x137, x138, x139, x140, x141) :|: x132 = x139 && x131 = x138 && x130 = x137 && x129 + 1 = x136 && 4 <= x135 - 1 && 0 <= x128 - 1 && -1 <= x131 - 1 && x129 <= x130 - 1 && x131 <= x132
f1273_0_createList_GE(x142, x143, x144, x145, x146, x147, x148) -> f1409_0_createList_NULL(x149, x150, x151, x152, x153, x154, x155) :|: 0 = x155 && x146 + 1 = x154 && x145 = x153 && x143 = x151 && x144 = x149 && -1 <= x152 - 1 && 1 <= x150 - 1 && -1 <= x142 - 1 && x152 <= x142 && -1 <= x146 - 1 && x146 <= x145 - 1 && x143 <= x144 - 1 && -1 <= x145 - 1
f1273_0_createList_GE(x156, x157, x158, x159, x160, x161, x162) -> f1409_0_createList_NULL(x163, x164, x165, x166, x167, x168, x169) :|: x160 + 1 = x168 && x159 = x167 && x157 = x165 && x158 = x163 && -1 <= x166 - 1 && 1 <= x164 - 1 && -1 <= x156 - 1 && x166 <= x156 && -1 <= x160 - 1 && -1 <= x169 - 1 && x160 <= x159 - 1 && x157 <= x158 - 1 && -1 <= x159 - 1
f1409_0_createList_NULL(x170, x171, x172, x173, x174, x175, x176) -> f1273_0_createList_GE(x177, x178, x179, x180, x181, x182, x183) :|: x175 = x181 && x174 = x180 && x170 = x179 && x172 + 1 = x178 && x176 + 2 <= x171 && 1 <= x177 - 1 && -1 <= x173 - 1 && 1 <= x171 - 1 && x177 <= x171
f1409_0_createList_NULL(x184, x185, x186, x187, x188, x189, x190) -> f1273_0_createList_GE(x191, x192, x193, x194, x195, x196, x197) :|: x189 = x195 && x188 = x194 && x184 = x193 && x186 + 1 = x192 && x190 + 2 <= x185 && 4 <= x191 - 1 && 0 <= x187 - 1 && 2 <= x185 - 1
f1007_0_main_InvokeMethod(x198, x199, x200, x201, x202, x203, x204) -> f752_0_getFirst_NONNULL(x205, x206, x207, x208, x209, x210, x211) :|: x205 <= x199 && x212 <= x200 && 0 <= x198 - 1 && 0 <= x199 - 1 && 0 <= x205 - 1 && -1 <= x206 - 1 && x208 + 2 <= x199 && x207 + 2 <= x199
f988_0_random_GT(x213, x214, x215, x216, x217, x218, x219) -> f752_0_getFirst_NONNULL(x220, x221, x222, x223, x224, x225, x226) :|: x227 <= x228 - 1 && -1 <= x227 - 1 && 0 <= x228 - 1 && -1 <= x229 - 1 && x227 + 1 <= x228 && x220 <= x214 && 0 <= x213 - 1 && 0 <= x214 - 1 && 0 <= x220 - 1 && -1 <= x221 - 1 && x223 + 2 <= x214 && x222 + 2 <= x214
f752_0_getFirst_NONNULL(x230, x231, x232, x233, x234, x235, x236) -> f752_0_getFirst_NONNULL(x237, x238, x239, x240, x241, x242, x243) :|: x233 + 2 <= x230 && x232 + 2 <= x230 && -1 <= x238 - 1 && 0 <= x237 - 1 && 0 <= x231 - 1 && 2 <= x230 - 1
f1127_0_find_InvokeMethod(x244, x245, x246, x247, x248, x249, x250) -> f1026_0_findR_NE(x251, x252, x253, x254, x255, x256, x257) :|: x246 = x253 && 0 = x252 && x246 + 2 <= x245 && x247 + 2 <= x245 && 1 <= x251 - 1 && 1 <= x245 - 1 && 0 <= x244 - 1 && x251 <= x245
f988_0_random_GT(x258, x259, x260, x261, x262, x263, x264) -> f1026_0_findR_NE(x265, x266, x267, x268, x269, x270, x271) :|: x272 <= x273 - 1 && -1 <= x272 - 1 && 0 <= x273 - 1 && x272 + 1 <= x273 && -1 <= x266 - 1 && 0 <= x258 - 1 && 0 <= x259 - 1 && 1 <= x265 - 1
f1026_0_findR_NE(x274, x275, x276, x277, x278, x279, x280) -> f1026_0_findR_NE(x281, x282, x283, x284, x285, x286, x287) :|: x275 = x282 && x276 + 2 <= x274 && 0 <= x281 - 1 && x276 <= x275 - 1 && 2 <= x274 - 1
f1026_0_findR_NE(x288, x289, x290, x291, x292, x293, x294) -> f1026_0_findR_NE(x295, x296, x297, x298, x299, x300, x301) :|: x289 = x296 && x290 + 2 <= x288 && 0 <= x295 - 1 && x289 <= x290 - 1 && 2 <= x288 - 1
__init(x302, x303, x304, x305, x306, x307, x308) -> f1_0_main_Load(x309, x310, x311, x312, x313, x314, x315) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3, arg4, arg5, arg6, arg7)

----------------------------------------

(1) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(2)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2, arg3, arg4, arg5, arg6, arg7) -> f988_0_random_GT(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P, arg7P) :|: -1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && -1 <= arg2 - 1 && arg1P <= arg1
f121_0_createList_Return(x, x1, x2, x3, x4, x6, x7) -> f988_0_random_GT(x8, x9, x11, x12, x13, x14, x15) :|: x8 <= x && -1 <= x18 - 1 && x9 + 1 <= x && 0 <= x - 1 && 0 <= x8 - 1 && -1 <= x9 - 1
f988_0_random_GT(x19, x20, x21, x23, x24, x25, x26) -> f1007_0_main_InvokeMethod(x27, x28, x29, x30, x31, x32, x33) :|: x27 <= x19 && x34 <= x29 && x27 - 1 <= x20 && x28 <= x20 && 0 <= x19 - 1 && -1 <= x20 - 1 && 0 <= x27 - 1 && -1 <= x28 - 1
f988_0_random_GT(x35, x36, x37, x38, x39, x40, x41) -> f1007_0_main_InvokeMethod(x42, x43, x44, x45, x46, x47, x48) :|: x49 <= x50 - 1 && -1 <= x49 - 1 && x42 <= x35 && x42 - 1 <= x36 && x43 <= x36 && 0 <= x35 - 1 && -1 <= x36 - 1 && 0 <= x42 - 1 && -1 <= x43 - 1 && x49 + 1 = x44
f1007_0_main_InvokeMethod(x51, x52, x53, x54, x55, x56, x57) -> f1127_0_find_InvokeMethod(x58, x59, x60, x61, x62, x63, x64) :|: x58 <= x51 && x65 <= x53 && x58 <= x52 && 0 <= x51 - 1 && 0 <= x52 - 1 && 0 <= x58 - 1 && 1 <= x59 - 1
f1_0_main_Load(x66, x67, x68, x69, x70, x71, x72) -> f1273_0_createList_GE(x73, x74, x75, x76, x77, x78, x79) :|: 0 = x77 && 0 = x76 && 0 = x75 && 0 = x74 && 0 = x67 && -1 <= x73 - 1 && 0 <= x66 - 1 && x73 + 1 <= x66
f1_0_main_Load(x80, x81, x83, x84, x85, x86, x87) -> f1273_0_createList_GE(x88, x89, x92, x93, x94, x95, x96) :|: 1 = x94 && x81 = x93 && 0 = x92 && 0 = x89 && -1 <= x88 - 1 && 0 <= x80 - 1 && 0 <= x81 - 1 && x88 + 1 <= x80
f1_0_main_Load(x97, x99, x100, x101, x102, x103, x104) -> f1273_0_createList_GE(x105, x106, x107, x108, x109, x110, x111) :|: 1 = x109 && x99 = x108 && 0 = x106 && -1 <= x105 - 1 && 0 <= x97 - 1 && x105 + 1 <= x97 && 0 <= x99 - 1 && -1 <= x107 - 1
f1273_0_createList_GE(x112, x113, x116, x117, x118, x119, x120) -> f1273_0_createList_GE(x121, x122, x123, x124, x125, x126, x127) :|: x118 = x125 && x117 = x124 && x116 = x123 && x113 + 1 = x122 && 1 <= x121 - 1 && -1 <= x112 - 1 && x121 - 2 <= x112 && -1 <= x117 - 1 && x113 <= x116 - 1 && x117 <= x118
f1273_0_createList_GE(x128, x129, x130, x131, x132, x133, x134) -> f1273_0_createList_GE(x135, x136, x137, x138, x139, x140, x141) :|: x132 = x139 && x131 = x138 && x130 = x137 && x129 + 1 = x136 && 4 <= x135 - 1 && 0 <= x128 - 1 && -1 <= x131 - 1 && x129 <= x130 - 1 && x131 <= x132
f1273_0_createList_GE(x142, x143, x144, x145, x146, x147, x148) -> f1409_0_createList_NULL(x149, x150, x151, x152, x153, x154, x155) :|: 0 = x155 && x146 + 1 = x154 && x145 = x153 && x143 = x151 && x144 = x149 && -1 <= x152 - 1 && 1 <= x150 - 1 && -1 <= x142 - 1 && x152 <= x142 && -1 <= x146 - 1 && x146 <= x145 - 1 && x143 <= x144 - 1 && -1 <= x145 - 1
f1273_0_createList_GE(x156, x157, x158, x159, x160, x161, x162) -> f1409_0_createList_NULL(x163, x164, x165, x166, x167, x168, x169) :|: x160 + 1 = x168 && x159 = x167 && x157 = x165 && x158 = x163 && -1 <= x166 - 1 && 1 <= x164 - 1 && -1 <= x156 - 1 && x166 <= x156 && -1 <= x160 - 1 && -1 <= x169 - 1 && x160 <= x159 - 1 && x157 <= x158 - 1 && -1 <= x159 - 1
f1409_0_createList_NULL(x170, x171, x172, x173, x174, x175, x176) -> f1273_0_createList_GE(x177, x178, x179, x180, x181, x182, x183) :|: x175 = x181 && x174 = x180 && x170 = x179 && x172 + 1 = x178 && x176 + 2 <= x171 && 1 <= x177 - 1 && -1 <= x173 - 1 && 1 <= x171 - 1 && x177 <= x171
f1409_0_createList_NULL(x184, x185, x186, x187, x188, x189, x190) -> f1273_0_createList_GE(x191, x192, x193, x194, x195, x196, x197) :|: x189 = x195 && x188 = x194 && x184 = x193 && x186 + 1 = x192 && x190 + 2 <= x185 && 4 <= x191 - 1 && 0 <= x187 - 1 && 2 <= x185 - 1
f1007_0_main_InvokeMethod(x198, x199, x200, x201, x202, x203, x204) -> f752_0_getFirst_NONNULL(x205, x206, x207, x208, x209, x210, x211) :|: x205 <= x199 && x212 <= x200 && 0 <= x198 - 1 && 0 <= x199 - 1 && 0 <= x205 - 1 && -1 <= x206 - 1 && x208 + 2 <= x199 && x207 + 2 <= x199
f988_0_random_GT(x213, x214, x215, x216, x217, x218, x219) -> f752_0_getFirst_NONNULL(x220, x221, x222, x223, x224, x225, x226) :|: x227 <= x228 - 1 && -1 <= x227 - 1 && 0 <= x228 - 1 && -1 <= x229 - 1 && x227 + 1 <= x228 && x220 <= x214 && 0 <= x213 - 1 && 0 <= x214 - 1 && 0 <= x220 - 1 && -1 <= x221 - 1 && x223 + 2 <= x214 && x222 + 2 <= x214
f752_0_getFirst_NONNULL(x230, x231, x232, x233, x234, x235, x236) -> f752_0_getFirst_NONNULL(x237, x238, x239, x240, x241, x242, x243) :|: x233 + 2 <= x230 && x232 + 2 <= x230 && -1 <= x238 - 1 && 0 <= x237 - 1 && 0 <= x231 - 1 && 2 <= x230 - 1
f1127_0_find_InvokeMethod(x244, x245, x246, x247, x248, x249, x250) -> f1026_0_findR_NE(x251, x252, x253, x254, x255, x256, x257) :|: x246 = x253 && 0 = x252 && x246 + 2 <= x245 && x247 + 2 <= x245 && 1 <= x251 - 1 && 1 <= x245 - 1 && 0 <= x244 - 1 && x251 <= x245
f988_0_random_GT(x258, x259, x260, x261, x262, x263, x264) -> f1026_0_findR_NE(x265, x266, x267, x268, x269, x270, x271) :|: x272 <= x273 - 1 && -1 <= x272 - 1 && 0 <= x273 - 1 && x272 + 1 <= x273 && -1 <= x266 - 1 && 0 <= x258 - 1 && 0 <= x259 - 1 && 1 <= x265 - 1
f1026_0_findR_NE(x274, x275, x276, x277, x278, x279, x280) -> f1026_0_findR_NE(x281, x282, x283, x284, x285, x286, x287) :|: x275 = x282 && x276 + 2 <= x274 && 0 <= x281 - 1 && x276 <= x275 - 1 && 2 <= x274 - 1
f1026_0_findR_NE(x288, x289, x290, x291, x292, x293, x294) -> f1026_0_findR_NE(x295, x296, x297, x298, x299, x300, x301) :|: x289 = x296 && x290 + 2 <= x288 && 0 <= x295 - 1 && x289 <= x290 - 1 && 2 <= x288 - 1
__init(x302, x303, x304, x305, x306, x307, x308) -> f1_0_main_Load(x309, x310, x311, x312, x313, x314, x315) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3, arg4, arg5, arg6, arg7)

----------------------------------------

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1_0_main_Load(arg1, arg2, arg3, arg4, arg5, arg6, arg7) -> f988_0_random_GT(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P, arg7P) :|: -1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && -1 <= arg2 - 1 && arg1P <= arg1
(2) f121_0_createList_Return(x, x1, x2, x3, x4, x6, x7) -> f988_0_random_GT(x8, x9, x11, x12, x13, x14, x15) :|: x8 <= x && -1 <= x18 - 1 && x9 + 1 <= x && 0 <= x - 1 && 0 <= x8 - 1 && -1 <= x9 - 1
(3) f988_0_random_GT(x19, x20, x21, x23, x24, x25, x26) -> f1007_0_main_InvokeMethod(x27, x28, x29, x30, x31, x32, x33) :|: x27 <= x19 && x34 <= x29 && x27 - 1 <= x20 && x28 <= x20 && 0 <= x19 - 1 && -1 <= x20 - 1 && 0 <= x27 - 1 && -1 <= x28 - 1
(4) f988_0_random_GT(x35, x36, x37, x38, x39, x40, x41) -> f1007_0_main_InvokeMethod(x42, x43, x44, x45, x46, x47, x48) :|: x49 <= x50 - 1 && -1 <= x49 - 1 && x42 <= x35 && x42 - 1 <= x36 && x43 <= x36 && 0 <= x35 - 1 && -1 <= x36 - 1 && 0 <= x42 - 1 && -1 <= x43 - 1 && x49 + 1 = x44
(5) f1007_0_main_InvokeMethod(x51, x52, x53, x54, x55, x56, x57) -> f1127_0_find_InvokeMethod(x58, x59, x60, x61, x62, x63, x64) :|: x58 <= x51 && x65 <= x53 && x58 <= x52 && 0 <= x51 - 1 && 0 <= x52 - 1 && 0 <= x58 - 1 && 1 <= x59 - 1
(6) f1_0_main_Load(x66, x67, x68, x69, x70, x71, x72) -> f1273_0_createList_GE(x73, x74, x75, x76, x77, x78, x79) :|: 0 = x77 && 0 = x76 && 0 = x75 && 0 = x74 && 0 = x67 && -1 <= x73 - 1 && 0 <= x66 - 1 && x73 + 1 <= x66
(7) f1_0_main_Load(x80, x81, x83, x84, x85, x86, x87) -> f1273_0_createList_GE(x88, x89, x92, x93, x94, x95, x96) :|: 1 = x94 && x81 = x93 && 0 = x92 && 0 = x89 && -1 <= x88 - 1 && 0 <= x80 - 1 && 0 <= x81 - 1 && x88 + 1 <= x80
(8) f1_0_main_Load(x97, x99, x100, x101, x102, x103, x104) -> f1273_0_createList_GE(x105, x106, x107, x108, x109, x110, x111) :|: 1 = x109 && x99 = x108 && 0 = x106 && -1 <= x105 - 1 && 0 <= x97 - 1 && x105 + 1 <= x97 && 0 <= x99 - 1 && -1 <= x107 - 1
(9) f1273_0_createList_GE(x112, x113, x116, x117, x118, x119, x120) -> f1273_0_createList_GE(x121, x122, x123, x124, x125, x126, x127) :|: x118 = x125 && x117 = x124 && x116 = x123 && x113 + 1 = x122 && 1 <= x121 - 1 && -1 <= x112 - 1 && x121 - 2 <= x112 && -1 <= x117 - 1 && x113 <= x116 - 1 && x117 <= x118
(10) f1273_0_createList_GE(x128, x129, x130, x131, x132, x133, x134) -> f1273_0_createList_GE(x135, x136, x137, x138, x139, x140, x141) :|: x132 = x139 && x131 = x138 && x130 = x137 && x129 + 1 = x136 && 4 <= x135 - 1 && 0 <= x128 - 1 && -1 <= x131 - 1 && x129 <= x130 - 1 && x131 <= x132
(11) f1273_0_createList_GE(x142, x143, x144, x145, x146, x147, x148) -> f1409_0_createList_NULL(x149, x150, x151, x152, x153, x154, x155) :|: 0 = x155 && x146 + 1 = x154 && x145 = x153 && x143 = x151 && x144 = x149 && -1 <= x152 - 1 && 1 <= x150 - 1 && -1 <= x142 - 1 && x152 <= x142 && -1 <= x146 - 1 && x146 <= x145 - 1 && x143 <= x144 - 1 && -1 <= x145 - 1
(12) f1273_0_createList_GE(x156, x157, x158, x159, x160, x161, x162) -> f1409_0_createList_NULL(x163, x164, x165, x166, x167, x168, x169) :|: x160 + 1 = x168 && x159 = x167 && x157 = x165 && x158 = x163 && -1 <= x166 - 1 && 1 <= x164 - 1 && -1 <= x156 - 1 && x166 <= x156 && -1 <= x160 - 1 && -1 <= x169 - 1 && x160 <= x159 - 1 && x157 <= x158 - 1 && -1 <= x159 - 1
(13) f1409_0_createList_NULL(x170, x171, x172, x173, x174, x175, x176) -> f1273_0_createList_GE(x177, x178, x179, x180, x181, x182, x183) :|: x175 = x181 && x174 = x180 && x170 = x179 && x172 + 1 = x178 && x176 + 2 <= x171 && 1 <= x177 - 1 && -1 <= x173 - 1 && 1 <= x171 - 1 && x177 <= x171
(14) f1409_0_createList_NULL(x184, x185, x186, x187, x188, x189, x190) -> f1273_0_createList_GE(x191, x192, x193, x194, x195, x196, x197) :|: x189 = x195 && x188 = x194 && x184 = x193 && x186 + 1 = x192 && x190 + 2 <= x185 && 4 <= x191 - 1 && 0 <= x187 - 1 && 2 <= x185 - 1
(15) f1007_0_main_InvokeMethod(x198, x199, x200, x201, x202, x203, x204) -> f752_0_getFirst_NONNULL(x205, x206, x207, x208, x209, x210, x211) :|: x205 <= x199 && x212 <= x200 && 0 <= x198 - 1 && 0 <= x199 - 1 && 0 <= x205 - 1 && -1 <= x206 - 1 && x208 + 2 <= x199 && x207 + 2 <= x199
(16) f988_0_random_GT(x213, x214, x215, x216, x217, x218, x219) -> f752_0_getFirst_NONNULL(x220, x221, x222, x223, x224, x225, x226) :|: x227 <= x228 - 1 && -1 <= x227 - 1 && 0 <= x228 - 1 && -1 <= x229 - 1 && x227 + 1 <= x228 && x220 <= x214 && 0 <= x213 - 1 && 0 <= x214 - 1 && 0 <= x220 - 1 && -1 <= x221 - 1 && x223 + 2 <= x214 && x222 + 2 <= x214
(17) f752_0_getFirst_NONNULL(x230, x231, x232, x233, x234, x235, x236) -> f752_0_getFirst_NONNULL(x237, x238, x239, x240, x241, x242, x243) :|: x233 + 2 <= x230 && x232 + 2 <= x230 && -1 <= x238 - 1 && 0 <= x237 - 1 && 0 <= x231 - 1 && 2 <= x230 - 1
(18) f1127_0_find_InvokeMethod(x244, x245, x246, x247, x248, x249, x250) -> f1026_0_findR_NE(x251, x252, x253, x254, x255, x256, x257) :|: x246 = x253 && 0 = x252 && x246 + 2 <= x245 && x247 + 2 <= x245 && 1 <= x251 - 1 && 1 <= x245 - 1 && 0 <= x244 - 1 && x251 <= x245
(19) f988_0_random_GT(x258, x259, x260, x261, x262, x263, x264) -> f1026_0_findR_NE(x265, x266, x267, x268, x269, x270, x271) :|: x272 <= x273 - 1 && -1 <= x272 - 1 && 0 <= x273 - 1 && x272 + 1 <= x273 && -1 <= x266 - 1 && 0 <= x258 - 1 && 0 <= x259 - 1 && 1 <= x265 - 1
(20) f1026_0_findR_NE(x274, x275, x276, x277, x278, x279, x280) -> f1026_0_findR_NE(x281, x282, x283, x284, x285, x286, x287) :|: x275 = x282 && x276 + 2 <= x274 && 0 <= x281 - 1 && x276 <= x275 - 1 && 2 <= x274 - 1
(21) f1026_0_findR_NE(x288, x289, x290, x291, x292, x293, x294) -> f1026_0_findR_NE(x295, x296, x297, x298, x299, x300, x301) :|: x289 = x296 && x290 + 2 <= x288 && 0 <= x295 - 1 && x289 <= x290 - 1 && 2 <= x288 - 1
(22) __init(x302, x303, x304, x305, x306, x307, x308) -> f1_0_main_Load(x309, x310, x311, x312, x313, x314, x315) :|: 0 <= 0

Arcs:
(1) -> (3), (4), (16), (19)
(2) -> (3), (4), (16), (19)
(3) -> (5), (15)
(4) -> (5), (15)
(5) -> (18)
(8) -> (9), (10), (11), (12)
(9) -> (9), (10)
(10) -> (9), (10)
(11) -> (13), (14)
(12) -> (13), (14)
(13) -> (9), (10), (11), (12)
(14) -> (9), (10), (11), (12)
(15) -> (17)
(16) -> (17)
(17) -> (17)
(18) -> (20), (21)
(19) -> (20), (21)
(20) -> (20), (21)
(21) -> (20), (21)
(22) -> (1), (6), (7), (8)

This digraph is fully evaluated!
----------------------------------------

(4)
Complex Obligation (AND)

----------------------------------------

(5)
Obligation:

Termination digraph:
Nodes:
(1) f1273_0_createList_GE(x142, x143, x144, x145, x146, x147, x148) -> f1409_0_createList_NULL(x149, x150, x151, x152, x153, x154, x155) :|: 0 = x155 && x146 + 1 = x154 && x145 = x153 && x143 = x151 && x144 = x149 && -1 <= x152 - 1 && 1 <= x150 - 1 && -1 <= x142 - 1 && x152 <= x142 && -1 <= x146 - 1 && x146 <= x145 - 1 && x143 <= x144 - 1 && -1 <= x145 - 1
(2) f1409_0_createList_NULL(x170, x171, x172, x173, x174, x175, x176) -> f1273_0_createList_GE(x177, x178, x179, x180, x181, x182, x183) :|: x175 = x181 && x174 = x180 && x170 = x179 && x172 + 1 = x178 && x176 + 2 <= x171 && 1 <= x177 - 1 && -1 <= x173 - 1 && 1 <= x171 - 1 && x177 <= x171
(3) f1273_0_createList_GE(x156, x157, x158, x159, x160, x161, x162) -> f1409_0_createList_NULL(x163, x164, x165, x166, x167, x168, x169) :|: x160 + 1 = x168 && x159 = x167 && x157 = x165 && x158 = x163 && -1 <= x166 - 1 && 1 <= x164 - 1 && -1 <= x156 - 1 && x166 <= x156 && -1 <= x160 - 1 && -1 <= x169 - 1 && x160 <= x159 - 1 && x157 <= x158 - 1 && -1 <= x159 - 1
(4) f1409_0_createList_NULL(x184, x185, x186, x187, x188, x189, x190) -> f1273_0_createList_GE(x191, x192, x193, x194, x195, x196, x197) :|: x189 = x195 && x188 = x194 && x184 = x193 && x186 + 1 = x192 && x190 + 2 <= x185 && 4 <= x191 - 1 && 0 <= x187 - 1 && 2 <= x185 - 1

Arcs:
(1) -> (2), (4)
(2) -> (1), (3)
(3) -> (2), (4)
(4) -> (1), (3)

This digraph is fully evaluated!

----------------------------------------

(6) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(7)
Obligation:
Rules:
f1409_0_createList_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0, x176:0) -> f1273_0_createList_GE(x177:0, x172:0 + 1, x170:0, x174:0, x175:0, x182:0, x183:0) :|: x171:0 > 1 && x177:0 <= x171:0 && x173:0 > -1 && x176:0 + 2 <= x171:0 && x177:0 > 1
f1273_0_createList_GE(x156:0, x157:0, x158:0, x159:0, x160:0, x161:0, x162:0) -> f1409_0_createList_NULL(x158:0, x164:0, x157:0, x166:0, x159:0, x160:0 + 1, x169:0) :|: x158:0 - 1 >= x157:0 && x159:0 > -1 && x160:0 <= x159:0 - 1 && x169:0 > -1 && x160:0 > -1 && x166:0 <= x156:0 && x156:0 > -1 && x166:0 > -1 && x164:0 > 1
f1409_0_createList_NULL(x184:0, x185:0, x186:0, x187:0, x188:0, x189:0, x190:0) -> f1273_0_createList_GE(x191:0, x186:0 + 1, x184:0, x188:0, x189:0, x196:0, x197:0) :|: x187:0 > 0 && x185:0 > 2 && x190:0 + 2 <= x185:0 && x191:0 > 4
f1273_0_createList_GE(x142:0, x143:0, x144:0, x145:0, x146:0, x147:0, x148:0) -> f1409_0_createList_NULL(x144:0, x150:0, x143:0, x152:0, x145:0, x146:0 + 1, 0) :|: x144:0 - 1 >= x143:0 && x145:0 > -1 && x146:0 <= x145:0 - 1 && x146:0 > -1 && x152:0 <= x142:0 && x142:0 > -1 && x152:0 > -1 && x150:0 > 1

----------------------------------------

(8) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f1273_0_createList_GE(x1, x2, x3, x4, x5, x6, x7) -> f1273_0_createList_GE(x1, x2, x3, x4, x5)

----------------------------------------

(9)
Obligation:
Rules:
f1409_0_createList_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0, x176:0) -> f1273_0_createList_GE(x177:0, x172:0 + 1, x170:0, x174:0, x175:0) :|: x171:0 > 1 && x177:0 <= x171:0 && x173:0 > -1 && x176:0 + 2 <= x171:0 && x177:0 > 1
f1273_0_createList_GE(x156:0, x157:0, x158:0, x159:0, x160:0) -> f1409_0_createList_NULL(x158:0, x164:0, x157:0, x166:0, x159:0, x160:0 + 1, x169:0) :|: x158:0 - 1 >= x157:0 && x159:0 > -1 && x160:0 <= x159:0 - 1 && x169:0 > -1 && x160:0 > -1 && x166:0 <= x156:0 && x156:0 > -1 && x166:0 > -1 && x164:0 > 1
f1409_0_createList_NULL(x184:0, x185:0, x186:0, x187:0, x188:0, x189:0, x190:0) -> f1273_0_createList_GE(x191:0, x186:0 + 1, x184:0, x188:0, x189:0) :|: x187:0 > 0 && x185:0 > 2 && x190:0 + 2 <= x185:0 && x191:0 > 4
f1273_0_createList_GE(x142:0, x143:0, x144:0, x145:0, x146:0) -> f1409_0_createList_NULL(x144:0, x150:0, x143:0, x152:0, x145:0, x146:0 + 1, 0) :|: x144:0 - 1 >= x143:0 && x145:0 > -1 && x146:0 <= x145:0 - 1 && x146:0 > -1 && x152:0 <= x142:0 && x142:0 > -1 && x152:0 > -1 && x150:0 > 1

----------------------------------------

(10) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f1409_0_createList_NULL(VARIABLE, INTEGER, VARIABLE, INTEGER, VARIABLE, VARIABLE, VARIABLE)
f1273_0_createList_GE(INTEGER, INTEGER, VARIABLE, VARIABLE, VARIABLE)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(11)
Obligation:
Rules:
f1409_0_createList_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0, x176:0) -> f1273_0_createList_GE(x177:0, c, x170:0, x174:0, x175:0) :|: c = x172:0 + 1 && (x171:0 > 1 && x177:0 <= x171:0 && x173:0 > -1 && x176:0 + 2 <= x171:0 && x177:0 > 1)
f1273_0_createList_GE(x156:0, x157:0, x158:0, x159:0, x160:0) -> f1409_0_createList_NULL(x158:0, x164:0, x157:0, x166:0, x159:0, c1, x169:0) :|: c1 = x160:0 + 1 && (x158:0 - 1 >= x157:0 && x159:0 > -1 && x160:0 <= x159:0 - 1 && x169:0 > -1 && x160:0 > -1 && x166:0 <= x156:0 && x156:0 > -1 && x166:0 > -1 && x164:0 > 1)
f1409_0_createList_NULL(x184:0, x185:0, x186:0, x187:0, x188:0, x189:0, x190:0) -> f1273_0_createList_GE(x191:0, c2, x184:0, x188:0, x189:0) :|: c2 = x186:0 + 1 && (x187:0 > 0 && x185:0 > 2 && x190:0 + 2 <= x185:0 && x191:0 > 4)
f1273_0_createList_GE(x142:0, x143:0, x144:0, x145:0, x146:0) -> f1409_0_createList_NULL(x144:0, x150:0, x143:0, x152:0, x145:0, c3, c4) :|: c4 = 0 && c3 = x146:0 + 1 && (x144:0 - 1 >= x143:0 && x145:0 > -1 && x146:0 <= x145:0 - 1 && x146:0 > -1 && x152:0 <= x142:0 && x142:0 > -1 && x152:0 > -1 && x150:0 > 1)

----------------------------------------

(12) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f1409_0_createList_NULL ] = 4*f1409_0_createList_NULL_1 + 2*f1409_0_createList_NULL_5 + 2*f1409_0_createList_NULL_6 + -4*f1409_0_createList_NULL_3 + -3
[ f1273_0_createList_GE ] = 4*f1273_0_createList_GE_3 + 2*f1273_0_createList_GE_4 + 2*f1273_0_createList_GE_5 + -4*f1273_0_createList_GE_2

The following rules are decreasing:
f1409_0_createList_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0, x176:0) -> f1273_0_createList_GE(x177:0, c, x170:0, x174:0, x175:0) :|: c = x172:0 + 1 && (x171:0 > 1 && x177:0 <= x171:0 && x173:0 > -1 && x176:0 + 2 <= x171:0 && x177:0 > 1)
f1273_0_createList_GE(x156:0, x157:0, x158:0, x159:0, x160:0) -> f1409_0_createList_NULL(x158:0, x164:0, x157:0, x166:0, x159:0, c1, x169:0) :|: c1 = x160:0 + 1 && (x158:0 - 1 >= x157:0 && x159:0 > -1 && x160:0 <= x159:0 - 1 && x169:0 > -1 && x160:0 > -1 && x166:0 <= x156:0 && x156:0 > -1 && x166:0 > -1 && x164:0 > 1)
f1409_0_createList_NULL(x184:0, x185:0, x186:0, x187:0, x188:0, x189:0, x190:0) -> f1273_0_createList_GE(x191:0, c2, x184:0, x188:0, x189:0) :|: c2 = x186:0 + 1 && (x187:0 > 0 && x185:0 > 2 && x190:0 + 2 <= x185:0 && x191:0 > 4)
f1273_0_createList_GE(x142:0, x143:0, x144:0, x145:0, x146:0) -> f1409_0_createList_NULL(x144:0, x150:0, x143:0, x152:0, x145:0, c3, c4) :|: c4 = 0 && c3 = x146:0 + 1 && (x144:0 - 1 >= x143:0 && x145:0 > -1 && x146:0 <= x145:0 - 1 && x146:0 > -1 && x152:0 <= x142:0 && x142:0 > -1 && x152:0 > -1 && x150:0 > 1)

The following rules are bounded:
f1273_0_createList_GE(x156:0, x157:0, x158:0, x159:0, x160:0) -> f1409_0_createList_NULL(x158:0, x164:0, x157:0, x166:0, x159:0, c1, x169:0) :|: c1 = x160:0 + 1 && (x158:0 - 1 >= x157:0 && x159:0 > -1 && x160:0 <= x159:0 - 1 && x169:0 > -1 && x160:0 > -1 && x166:0 <= x156:0 && x156:0 > -1 && x166:0 > -1 && x164:0 > 1)
f1273_0_createList_GE(x142:0, x143:0, x144:0, x145:0, x146:0) -> f1409_0_createList_NULL(x144:0, x150:0, x143:0, x152:0, x145:0, c3, c4) :|: c4 = 0 && c3 = x146:0 + 1 && (x144:0 - 1 >= x143:0 && x145:0 > -1 && x146:0 <= x145:0 - 1 && x146:0 > -1 && x152:0 <= x142:0 && x142:0 > -1 && x152:0 > -1 && x150:0 > 1)


----------------------------------------

(13)
Obligation:
Rules:
f1409_0_createList_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0, x176:0) -> f1273_0_createList_GE(x177:0, c, x170:0, x174:0, x175:0) :|: c = x172:0 + 1 && (x171:0 > 1 && x177:0 <= x171:0 && x173:0 > -1 && x176:0 + 2 <= x171:0 && x177:0 > 1)
f1409_0_createList_NULL(x184:0, x185:0, x186:0, x187:0, x188:0, x189:0, x190:0) -> f1273_0_createList_GE(x191:0, c2, x184:0, x188:0, x189:0) :|: c2 = x186:0 + 1 && (x187:0 > 0 && x185:0 > 2 && x190:0 + 2 <= x185:0 && x191:0 > 4)

----------------------------------------

(14) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1409_0_createList_NULL(x, x1, x2, x3, x4, x5, x6)] = -1 + x3
[f1273_0_createList_GE(x7, x8, x9, x10, x11)] = -1

The following rules are decreasing:
f1409_0_createList_NULL(x184:0, x185:0, x186:0, x187:0, x188:0, x189:0, x190:0) -> f1273_0_createList_GE(x191:0, c2, x184:0, x188:0, x189:0) :|: c2 = x186:0 + 1 && (x187:0 > 0 && x185:0 > 2 && x190:0 + 2 <= x185:0 && x191:0 > 4)
The following rules are bounded:
f1409_0_createList_NULL(x184:0, x185:0, x186:0, x187:0, x188:0, x189:0, x190:0) -> f1273_0_createList_GE(x191:0, c2, x184:0, x188:0, x189:0) :|: c2 = x186:0 + 1 && (x187:0 > 0 && x185:0 > 2 && x190:0 + 2 <= x185:0 && x191:0 > 4)

----------------------------------------

(15)
Obligation:
Rules:
f1409_0_createList_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0, x176:0) -> f1273_0_createList_GE(x177:0, c, x170:0, x174:0, x175:0) :|: c = x172:0 + 1 && (x171:0 > 1 && x177:0 <= x171:0 && x173:0 > -1 && x176:0 + 2 <= x171:0 && x177:0 > 1)

----------------------------------------

(16) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1409_0_createList_NULL(x, x1, x2, x3, x4, x5, x6)] = 1
[f1273_0_createList_GE(x7, x8, x9, x10, x11)] = 0

The following rules are decreasing:
f1409_0_createList_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0, x176:0) -> f1273_0_createList_GE(x177:0, c, x170:0, x174:0, x175:0) :|: c = x172:0 + 1 && (x171:0 > 1 && x177:0 <= x171:0 && x173:0 > -1 && x176:0 + 2 <= x171:0 && x177:0 > 1)
The following rules are bounded:
f1409_0_createList_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0, x176:0) -> f1273_0_createList_GE(x177:0, c, x170:0, x174:0, x175:0) :|: c = x172:0 + 1 && (x171:0 > 1 && x177:0 <= x171:0 && x173:0 > -1 && x176:0 + 2 <= x171:0 && x177:0 > 1)

----------------------------------------

(17)
YES

----------------------------------------

(18)
Obligation:

Termination digraph:
Nodes:
(1) f1273_0_createList_GE(x112, x113, x116, x117, x118, x119, x120) -> f1273_0_createList_GE(x121, x122, x123, x124, x125, x126, x127) :|: x118 = x125 && x117 = x124 && x116 = x123 && x113 + 1 = x122 && 1 <= x121 - 1 && -1 <= x112 - 1 && x121 - 2 <= x112 && -1 <= x117 - 1 && x113 <= x116 - 1 && x117 <= x118
(2) f1273_0_createList_GE(x128, x129, x130, x131, x132, x133, x134) -> f1273_0_createList_GE(x135, x136, x137, x138, x139, x140, x141) :|: x132 = x139 && x131 = x138 && x130 = x137 && x129 + 1 = x136 && 4 <= x135 - 1 && 0 <= x128 - 1 && -1 <= x131 - 1 && x129 <= x130 - 1 && x131 <= x132

Arcs:
(1) -> (1), (2)
(2) -> (1), (2)

This digraph is fully evaluated!

----------------------------------------

(19) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(20)
Obligation:
Rules:
f1273_0_createList_GE(x128:0, x129:0, x130:0, x131:0, x132:0, x133:0, x134:0) -> f1273_0_createList_GE(x135:0, x129:0 + 1, x130:0, x131:0, x132:0, x140:0, x141:0) :|: x130:0 - 1 >= x129:0 && x132:0 >= x131:0 && x131:0 > -1 && x135:0 > 4 && x128:0 > 0
f1273_0_createList_GE(x112:0, x113:0, x116:0, x117:0, x118:0, x119:0, x120:0) -> f1273_0_createList_GE(x121:0, x113:0 + 1, x116:0, x117:0, x118:0, x126:0, x127:0) :|: x116:0 - 1 >= x113:0 && x118:0 >= x117:0 && x117:0 > -1 && x121:0 - 2 <= x112:0 && x121:0 > 1 && x112:0 > -1

----------------------------------------

(21) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f1273_0_createList_GE(x1, x2, x3, x4, x5, x6, x7) -> f1273_0_createList_GE(x1, x2, x3, x4, x5)

----------------------------------------

(22)
Obligation:
Rules:
f1273_0_createList_GE(x128:0, x129:0, x130:0, x131:0, x132:0) -> f1273_0_createList_GE(x135:0, x129:0 + 1, x130:0, x131:0, x132:0) :|: x130:0 - 1 >= x129:0 && x132:0 >= x131:0 && x131:0 > -1 && x135:0 > 4 && x128:0 > 0
f1273_0_createList_GE(x112:0, x113:0, x116:0, x117:0, x118:0) -> f1273_0_createList_GE(x121:0, x113:0 + 1, x116:0, x117:0, x118:0) :|: x116:0 - 1 >= x113:0 && x118:0 >= x117:0 && x117:0 > -1 && x121:0 - 2 <= x112:0 && x121:0 > 1 && x112:0 > -1

----------------------------------------

(23) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f1273_0_createList_GE(INTEGER, INTEGER, INTEGER, INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(24)
Obligation:
Rules:
f1273_0_createList_GE(x128:0, x129:0, x130:0, x131:0, x132:0) -> f1273_0_createList_GE(x135:0, c, x130:0, x131:0, x132:0) :|: c = x129:0 + 1 && (x130:0 - 1 >= x129:0 && x132:0 >= x131:0 && x131:0 > -1 && x135:0 > 4 && x128:0 > 0)
f1273_0_createList_GE(x112:0, x113:0, x116:0, x117:0, x118:0) -> f1273_0_createList_GE(x121:0, c1, x116:0, x117:0, x118:0) :|: c1 = x113:0 + 1 && (x116:0 - 1 >= x113:0 && x118:0 >= x117:0 && x117:0 > -1 && x121:0 - 2 <= x112:0 && x121:0 > 1 && x112:0 > -1)

----------------------------------------

(25) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1273_0_createList_GE(x, x1, x2, x3, x4)] = -1 - x1 + x2

The following rules are decreasing:
f1273_0_createList_GE(x128:0, x129:0, x130:0, x131:0, x132:0) -> f1273_0_createList_GE(x135:0, c, x130:0, x131:0, x132:0) :|: c = x129:0 + 1 && (x130:0 - 1 >= x129:0 && x132:0 >= x131:0 && x131:0 > -1 && x135:0 > 4 && x128:0 > 0)
f1273_0_createList_GE(x112:0, x113:0, x116:0, x117:0, x118:0) -> f1273_0_createList_GE(x121:0, c1, x116:0, x117:0, x118:0) :|: c1 = x113:0 + 1 && (x116:0 - 1 >= x113:0 && x118:0 >= x117:0 && x117:0 > -1 && x121:0 - 2 <= x112:0 && x121:0 > 1 && x112:0 > -1)
The following rules are bounded:
f1273_0_createList_GE(x128:0, x129:0, x130:0, x131:0, x132:0) -> f1273_0_createList_GE(x135:0, c, x130:0, x131:0, x132:0) :|: c = x129:0 + 1 && (x130:0 - 1 >= x129:0 && x132:0 >= x131:0 && x131:0 > -1 && x135:0 > 4 && x128:0 > 0)
f1273_0_createList_GE(x112:0, x113:0, x116:0, x117:0, x118:0) -> f1273_0_createList_GE(x121:0, c1, x116:0, x117:0, x118:0) :|: c1 = x113:0 + 1 && (x116:0 - 1 >= x113:0 && x118:0 >= x117:0 && x117:0 > -1 && x121:0 - 2 <= x112:0 && x121:0 > 1 && x112:0 > -1)

----------------------------------------

(26)
YES

----------------------------------------

(27)
Obligation:

Termination digraph:
Nodes:
(1) f752_0_getFirst_NONNULL(x230, x231, x232, x233, x234, x235, x236) -> f752_0_getFirst_NONNULL(x237, x238, x239, x240, x241, x242, x243) :|: x233 + 2 <= x230 && x232 + 2 <= x230 && -1 <= x238 - 1 && 0 <= x237 - 1 && 0 <= x231 - 1 && 2 <= x230 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

----------------------------------------

(28) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(29)
Obligation:
Rules:
f752_0_getFirst_NONNULL(x230:0, x231:0, x232:0, x233:0, x234:0, x235:0, x236:0) -> f752_0_getFirst_NONNULL(x237:0, x238:0, x239:0, x240:0, x241:0, x242:0, x243:0) :|: x231:0 > 0 && x230:0 > 2 && x237:0 > 0 && x238:0 > -1 && x232:0 + 2 <= x230:0 && x233:0 + 2 <= x230:0

----------------------------------------

(30) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f752_0_getFirst_NONNULL(x1, x2, x3, x4, x5, x6, x7) -> f752_0_getFirst_NONNULL(x1, x2, x3, x4)

----------------------------------------

(31)
Obligation:
Rules:
f752_0_getFirst_NONNULL(x230:0, x231:0, x232:0, x233:0) -> f752_0_getFirst_NONNULL(x237:0, x238:0, x239:0, x240:0) :|: x231:0 > 0 && x230:0 > 2 && x237:0 > 0 && x238:0 > -1 && x232:0 + 2 <= x230:0 && x233:0 + 2 <= x230:0

----------------------------------------

(32) FilterProof (EQUIVALENT)
Used the following sort dictionary for filtering: 
f752_0_getFirst_NONNULL(INTEGER, INTEGER, VARIABLE, VARIABLE)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(33)
Obligation:
Rules:
f752_0_getFirst_NONNULL(x230:0, x231:0, x232:0, x233:0) -> f752_0_getFirst_NONNULL(x237:0, x238:0, x239:0, x240:0) :|: x231:0 > 0 && x230:0 > 2 && x237:0 > 0 && x238:0 > -1 && x232:0 + 2 <= x230:0 && x233:0 + 2 <= x230:0

----------------------------------------

(34) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(35)
Obligation:
Rules:
f752_0_getFirst_NONNULL(x230:0:0, x231:0:0, x232:0:0, x233:0:0) -> f752_0_getFirst_NONNULL(x237:0:0, x238:0:0, x239:0:0, x240:0:0) :|: x232:0:0 + 2 <= x230:0:0 && x233:0:0 + 2 <= x230:0:0 && x238:0:0 > -1 && x237:0:0 > 0 && x230:0:0 > 2 && x231:0:0 > 0

----------------------------------------

(36) IntTRSPeriodicNontermProof (COMPLETE)
Normalized system to the following form:
f(pc, x230:0:0, x231:0:0, x232:0:0, x233:0:0) -> f(1, x237:0:0, x238:0:0, x239:0:0, x240:0:0) :|: pc = 1 && (x232:0:0 + 2 <= x230:0:0 && x233:0:0 + 2 <= x230:0:0 && x238:0:0 > -1 && x237:0:0 > 0 && x230:0:0 > 2 && x231:0:0 > 0)
Witness term starting non-terminating reduction: f(1, 15, 15, -6, -8)
----------------------------------------

(37)
NO

----------------------------------------

(38)
Obligation:

Termination digraph:
Nodes:
(1) f1026_0_findR_NE(x274, x275, x276, x277, x278, x279, x280) -> f1026_0_findR_NE(x281, x282, x283, x284, x285, x286, x287) :|: x275 = x282 && x276 + 2 <= x274 && 0 <= x281 - 1 && x276 <= x275 - 1 && 2 <= x274 - 1
(2) f1026_0_findR_NE(x288, x289, x290, x291, x292, x293, x294) -> f1026_0_findR_NE(x295, x296, x297, x298, x299, x300, x301) :|: x289 = x296 && x290 + 2 <= x288 && 0 <= x295 - 1 && x289 <= x290 - 1 && 2 <= x288 - 1

Arcs:
(1) -> (1), (2)
(2) -> (1), (2)

This digraph is fully evaluated!

----------------------------------------

(39) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(40)
Obligation:
Rules:
f1026_0_findR_NE(x288:0, x289:0, x290:0, x291:0, x292:0, x293:0, x294:0) -> f1026_0_findR_NE(x295:0, x289:0, x297:0, x298:0, x299:0, x300:0, x301:0) :|: x290:0 - 1 >= x289:0 && x288:0 > 2 && x290:0 + 2 <= x288:0 && x295:0 > 0
f1026_0_findR_NE(x274:0, x275:0, x276:0, x277:0, x278:0, x279:0, x280:0) -> f1026_0_findR_NE(x281:0, x275:0, x283:0, x284:0, x285:0, x286:0, x287:0) :|: x276:0 <= x275:0 - 1 && x274:0 > 2 && x276:0 + 2 <= x274:0 && x281:0 > 0

----------------------------------------

(41) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f1026_0_findR_NE(x1, x2, x3, x4, x5, x6, x7) -> f1026_0_findR_NE(x1, x2, x3)

----------------------------------------

(42)
Obligation:
Rules:
f1026_0_findR_NE(x288:0, x289:0, x290:0) -> f1026_0_findR_NE(x295:0, x289:0, x297:0) :|: x290:0 - 1 >= x289:0 && x288:0 > 2 && x290:0 + 2 <= x288:0 && x295:0 > 0
f1026_0_findR_NE(x274:0, x275:0, x276:0) -> f1026_0_findR_NE(x281:0, x275:0, x283:0) :|: x276:0 <= x275:0 - 1 && x274:0 > 2 && x276:0 + 2 <= x274:0 && x281:0 > 0

----------------------------------------

(43) FilterProof (EQUIVALENT)
Used the following sort dictionary for filtering: 
f1026_0_findR_NE(INTEGER, INTEGER, VARIABLE)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(44)
Obligation:
Rules:
f1026_0_findR_NE(x288:0, x289:0, x290:0) -> f1026_0_findR_NE(x295:0, x289:0, x297:0) :|: x290:0 - 1 >= x289:0 && x288:0 > 2 && x290:0 + 2 <= x288:0 && x295:0 > 0
f1026_0_findR_NE(x274:0, x275:0, x276:0) -> f1026_0_findR_NE(x281:0, x275:0, x283:0) :|: x276:0 <= x275:0 - 1 && x274:0 > 2 && x276:0 + 2 <= x274:0 && x281:0 > 0

----------------------------------------

(45) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(46)
Obligation:
Rules:
f1026_0_findR_NE(x288:0:0, x289:0:0, x290:0:0) -> f1026_0_findR_NE(x295:0:0, x289:0:0, x297:0:0) :|: x290:0:0 + 2 <= x288:0:0 && x295:0:0 > 0 && x288:0:0 > 2 && x290:0:0 - 1 >= x289:0:0
f1026_0_findR_NE(x274:0:0, x275:0:0, x276:0:0) -> f1026_0_findR_NE(x281:0:0, x275:0:0, x283:0:0) :|: x276:0:0 + 2 <= x274:0:0 && x281:0:0 > 0 && x274:0:0 > 2 && x276:0:0 <= x275:0:0 - 1

----------------------------------------

(47) IntTRSPeriodicNontermProof (COMPLETE)
Normalized system to the following form:
f(pc, x288:0:0, x289:0:0, x290:0:0) -> f(1, x295:0:0, x289:0:0, x297:0:0) :|: pc = 1 && (x290:0:0 + 2 <= x288:0:0 && x295:0:0 > 0 && x288:0:0 > 2 && x290:0:0 - 1 >= x289:0:0)
f(pc, x274:0:0, x275:0:0, x276:0:0) -> f(1, x281:0:0, x275:0:0, x283:0:0) :|: pc = 1 && (x276:0:0 + 2 <= x274:0:0 && x281:0:0 > 0 && x274:0:0 > 2 && x276:0:0 <= x275:0:0 - 1)
Witness term starting non-terminating reduction: f(1, 4, 0, -8)
----------------------------------------

(48)
NO