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, 163 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 40 ms]
(6) IRSwT
(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) FilterProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(12) IntTRS
(13) IntTRSPeriodicNontermProof [COMPLETE, 0 ms]
(14) NO


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

(0)
Obligation:
Rules:
f1_0_main_ConstantStackPush(arg1, arg2, arg3) -> f151_0_main_InvokeMethod(arg1P, arg2P, arg3P) :|: 2 = arg3P && 2 = arg2 && 0 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg2P <= arg1 && arg1P <= arg1
f1_0_main_ConstantStackPush(x, x1, x2) -> f151_0_main_InvokeMethod(x3, x4, x5) :|: 1 = x5 && 1 = x1 && 0 <= x4 - 1 && 0 <= x3 - 1 && 0 <= x - 1 && x4 <= x && x3 <= x
f151_0_main_InvokeMethod(x6, x7, x8) -> f151_0_main_InvokeMethod(x9, x10, x11) :|: x8 = x11 && 0 <= x10 - 1 && 0 <= x9 - 1 && 0 <= x7 - 1 && 0 <= x6 - 1 && x10 <= x7 && x10 <= x6 && x9 <= x7 && x9 <= x6
__init(x12, x13, x14) -> f1_0_main_ConstantStackPush(x15, x16, x17) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3)

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

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

(2)
Obligation:
Rules:
f1_0_main_ConstantStackPush(arg1, arg2, arg3) -> f151_0_main_InvokeMethod(arg1P, arg2P, arg3P) :|: 2 = arg3P && 2 = arg2 && 0 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg2P <= arg1 && arg1P <= arg1
f1_0_main_ConstantStackPush(x, x1, x2) -> f151_0_main_InvokeMethod(x3, x4, x5) :|: 1 = x5 && 1 = x1 && 0 <= x4 - 1 && 0 <= x3 - 1 && 0 <= x - 1 && x4 <= x && x3 <= x
f151_0_main_InvokeMethod(x6, x7, x8) -> f151_0_main_InvokeMethod(x9, x10, x11) :|: x8 = x11 && 0 <= x10 - 1 && 0 <= x9 - 1 && 0 <= x7 - 1 && 0 <= x6 - 1 && x10 <= x7 && x10 <= x6 && x9 <= x7 && x9 <= x6
__init(x12, x13, x14) -> f1_0_main_ConstantStackPush(x15, x16, x17) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1_0_main_ConstantStackPush(arg1, arg2, arg3) -> f151_0_main_InvokeMethod(arg1P, arg2P, arg3P) :|: 2 = arg3P && 2 = arg2 && 0 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg2P <= arg1 && arg1P <= arg1
(2) f1_0_main_ConstantStackPush(x, x1, x2) -> f151_0_main_InvokeMethod(x3, x4, x5) :|: 1 = x5 && 1 = x1 && 0 <= x4 - 1 && 0 <= x3 - 1 && 0 <= x - 1 && x4 <= x && x3 <= x
(3) f151_0_main_InvokeMethod(x6, x7, x8) -> f151_0_main_InvokeMethod(x9, x10, x11) :|: x8 = x11 && 0 <= x10 - 1 && 0 <= x9 - 1 && 0 <= x7 - 1 && 0 <= x6 - 1 && x10 <= x7 && x10 <= x6 && x9 <= x7 && x9 <= x6
(4) __init(x12, x13, x14) -> f1_0_main_ConstantStackPush(x15, x16, x17) :|: 0 <= 0

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

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

(4)
Obligation:

Termination digraph:
Nodes:
(1) f151_0_main_InvokeMethod(x6, x7, x8) -> f151_0_main_InvokeMethod(x9, x10, x11) :|: x8 = x11 && 0 <= x10 - 1 && 0 <= x9 - 1 && 0 <= x7 - 1 && 0 <= x6 - 1 && x10 <= x7 && x10 <= x6 && x9 <= x7 && x9 <= x6

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(6)
Obligation:
Rules:
f151_0_main_InvokeMethod(x6:0, x7:0, x11:0) -> f151_0_main_InvokeMethod(x9:0, x10:0, x11:0) :|: x9:0 <= x7:0 && x9:0 <= x6:0 && x6:0 >= x10:0 && x7:0 >= x10:0 && x6:0 > 0 && x7:0 > 0 && x10:0 > 0 && x9:0 > 0

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

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

   f151_0_main_InvokeMethod(x1, x2, x3) -> f151_0_main_InvokeMethod(x1, x2)

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

(8)
Obligation:
Rules:
f151_0_main_InvokeMethod(x6:0, x7:0) -> f151_0_main_InvokeMethod(x9:0, x10:0) :|: x9:0 <= x7:0 && x9:0 <= x6:0 && x6:0 >= x10:0 && x7:0 >= x10:0 && x6:0 > 0 && x7:0 > 0 && x10:0 > 0 && x9:0 > 0

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

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

(10)
Obligation:
Rules:
f151_0_main_InvokeMethod(x6:0, x7:0) -> f151_0_main_InvokeMethod(x9:0, x10:0) :|: x9:0 <= x7:0 && x9:0 <= x6:0 && x6:0 >= x10:0 && x7:0 >= x10:0 && x6:0 > 0 && x7:0 > 0 && x10:0 > 0 && x9:0 > 0

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

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

(12)
Obligation:
Rules:
f151_0_main_InvokeMethod(x6:0:0, x7:0:0) -> f151_0_main_InvokeMethod(x9:0:0, x10:0:0) :|: x10:0:0 > 0 && x9:0:0 > 0 && x7:0:0 > 0 && x6:0:0 > 0 && x7:0:0 >= x10:0:0 && x6:0:0 >= x10:0:0 && x9:0:0 <= x6:0:0 && x9:0:0 <= x7:0:0

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

(13) IntTRSPeriodicNontermProof (COMPLETE)
Normalized system to the following form:
f(pc, x6:0:0, x7:0:0) -> f(1, x9:0:0, x10:0:0) :|: pc = 1 && (x10:0:0 > 0 && x9:0:0 > 0 && x7:0:0 > 0 && x6:0:0 > 0 && x7:0:0 >= x10:0:0 && x6:0:0 >= x10:0:0 && x9:0:0 <= x6:0:0 && x9:0:0 <= x7:0:0)
Witness term starting non-terminating reduction: f(1, 16, 16)
----------------------------------------

(14)
NO