/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files


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


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 480 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToIRSProof [SOUND, 87 ms]
        (9) IRSwT
        (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (11) IRSwT
        (12) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
        (13) IRSwT
        (14) TempFilterProof [SOUND, 23 ms]
        (15) IRSwT
        (16) IRSwTToQDPProof [SOUND, 0 ms]
        (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) JBCTerminationSCC
        (21) SCCToIRSProof [SOUND, 21 ms]
        (22) IRSwT
        (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (24) IRSwT
        (25) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
        (26) IRSwT
        (27) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (28) IRSwT
        (29) FilterProof [EQUIVALENT, 0 ms]
        (30) IntTRS
        (31) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (32) IntTRS
        (33) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (34) YES
    (35) JBCTerminationSCC
        (36) SCCToIRSProof [SOUND, 26 ms]
        (37) IRSwT
        (38) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (39) IRSwT
        (40) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
        (41) IRSwT
        (42) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (43) IRSwT
        (44) TempFilterProof [SOUND, 24 ms]
        (45) IntTRS
        (46) PolynomialOrderProcessor [EQUIVALENT, 9 ms]
        (47) YES
    (48) JBCTerminationSCC
        (49) SCCToIRSProof [SOUND, 12 ms]
        (50) IRSwT
        (51) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (52) IRSwT
        (53) IRSwTTerminationDigraphProof [EQUIVALENT, 10 ms]
        (54) IRSwT
        (55) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (56) IRSwT
        (57) TempFilterProof [SOUND, 12 ms]
        (58) IntTRS
        (59) PolynomialOrderProcessor [EQUIVALENT, 5 ms]
        (60) YES


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

(0)
Obligation:
need to prove termination of the following program:
public class ListReversePanhandleList {
	public static void main(String... args) {
		List x = List.createPanhandleList(args[0].length(), args[1].length());
		List.reverse(x);
	}
}

class List {
	List n;

	public List(List next) {
		this.n = next;
	}

	public static void reverse(List x) {		
		List y = null;
		while (x != null) {
			List z = x;
			x = x.n;
			z.n = y;
			y = z;
		}
	}

	public static List createList(int l, List end) {
		while (--l > 0) {
			end = new List(end);
		}
		return end;
	}

	public static List createCycle(int l) {
		List last = new List(null);
		List first = createList(l - 1, last);
		last.n = first;
		return first;
	}

	public static List createPanhandleList(int pl, int cl) {
		return createList(pl, createCycle(cl));
	}

}



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

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
public class ListReversePanhandleList {
	public static void main(String... args) {
		List x = List.createPanhandleList(args[0].length(), args[1].length());
		List.reverse(x);
	}
}

class List {
	List n;

	public List(List next) {
		this.n = next;
	}

	public static void reverse(List x) {		
		List y = null;
		while (x != null) {
			List z = x;
			x = x.n;
			z.n = y;
			y = z;
		}
	}

	public static List createList(int l, List end) {
		while (--l > 0) {
			end = new List(end);
		}
		return end;
	}

	public static List createCycle(int l) {
		List last = new List(null);
		List first = createList(l - 1, last);
		last.n = first;
		return first;
	}

	public static List createPanhandleList(int pl, int cl) {
		return createList(pl, createCycle(cl));
	}

}



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

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
ListReversePanhandleList.main([Ljava/lang/String;)V: Graph of 364 nodes with 4 SCCs.





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

(5) TerminationGraphToSCCProof (SOUND)
Splitted TerminationGraph to 4 SCCss.
----------------------------------------

(6)
Complex Obligation (AND)

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

(7)
Obligation:
SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: ListReversePanhandleList.main([Ljava/lang/String;)V
SCC calls the following helper methods: 
Performed SCC analyses:
*Used field analysis yielded the following read fields:
*List: [n]
*Marker field analysis yielded the following relations that could be markers:

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

(8) SCCToIRSProof (SOUND)
Transformed FIGraph SCCs to intTRSs. Log: 
Generated rules. Obtained 16 IRulesP rules:
f1983_0_reverse_NULL(EOS(STATIC_1983), java.lang.Object(o1113sub), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(o1113sub)) -> f2002_0_reverse_Load(EOS(STATIC_2002), java.lang.Object(o1113sub), java.lang.Object(List(EOC, o1031812826308))) :|: TRUE
f2002_0_reverse_Load(EOS(STATIC_2002), java.lang.Object(o1113sub), java.lang.Object(List(EOC, o1031812826308))) -> f2038_0_reverse_Store(EOS(STATIC_2038), java.lang.Object(o1113sub), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(o1113sub)) :|: TRUE
f2038_0_reverse_Store(EOS(STATIC_2038), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199))) -> f2064_0_reverse_Store(EOS(STATIC_2064), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199))) :|: TRUE
f2064_0_reverse_Store(EOS(STATIC_2064), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199))) -> f2076_0_reverse_Load(EOS(STATIC_2076), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199))) :|: TRUE
f2076_0_reverse_Load(EOS(STATIC_2076), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199))) -> f2086_0_reverse_FieldAccess(EOS(STATIC_2086), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1199))) :|: TRUE
f2086_0_reverse_FieldAccess(EOS(STATIC_2086), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1199))) -> f2112_0_reverse_Store(EOS(STATIC_2112), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199)), o1199) :|: TRUE
f2112_0_reverse_Store(EOS(STATIC_2112), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199)), o1199) -> f2144_0_reverse_Load(EOS(STATIC_2144), o1199, java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199))) :|: TRUE
f2144_0_reverse_Load(EOS(STATIC_2144), o1199, java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199))) -> f2177_0_reverse_Load(EOS(STATIC_2177), o1199, java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1199))) :|: TRUE
f2177_0_reverse_Load(EOS(STATIC_2177), o1199, java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1199))) -> f2211_0_reverse_FieldAccess(EOS(STATIC_2211), o1199, java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1031812826308))) :|: TRUE
f2211_0_reverse_FieldAccess(EOS(STATIC_2211), o1199, java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1199)), java.lang.Object(List(EOC, o1031812826308))) -> f2244_0_reverse_Load(EOS(STATIC_2244), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o1031put1625688421))))) :|: TRUE
f2244_0_reverse_Load(EOS(STATIC_2244), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o10311625688421))))) -> f2286_0_reverse_Store(EOS(STATIC_2286), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o10311625688421))))) :|: TRUE
f2286_0_reverse_Store(EOS(STATIC_2286), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o10311625688421))))) -> f2311_0_reverse_JMP(EOS(STATIC_2311), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o10311625688421))))) :|: TRUE
f2311_0_reverse_JMP(EOS(STATIC_2311), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o10311625688421))))) -> f2474_0_reverse_Load(EOS(STATIC_2474), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o10311625688421))))) :|: TRUE
f2474_0_reverse_Load(EOS(STATIC_2474), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o10311625688421))))) -> f1917_0_reverse_Load(EOS(STATIC_1917), o1199, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o10311625688421))))) :|: TRUE
f1917_0_reverse_Load(EOS(STATIC_1917), o1029, java.lang.Object(List(EOC, o1031812826308))) -> f1964_0_reverse_NULL(EOS(STATIC_1964), o1029, java.lang.Object(List(EOC, o1031812826308)), o1029) :|: TRUE
f1964_0_reverse_NULL(EOS(STATIC_1964), java.lang.Object(o1113sub), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(o1113sub)) -> f1983_0_reverse_NULL(EOS(STATIC_1983), java.lang.Object(o1113sub), java.lang.Object(List(EOC, o1031812826308)), java.lang.Object(o1113sub)) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f1983_0_reverse_NULL(EOS(STATIC_1983), java.lang.Object(List(EOC, java.lang.Object(o1113sub:0))), java.lang.Object(List(EOC, o1031812826308:0)), java.lang.Object(List(EOC, java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(EOS(STATIC_1983), java.lang.Object(o1113sub:0), java.lang.Object(List(EOC, java.lang.Object(List(EOC, o1031put1625688421:0)))), java.lang.Object(o1113sub:0)) :|: TRUE
Filtered constant ground arguments:
   f1983_0_reverse_NULL(x1, x2, x3, x4) -> f1983_0_reverse_NULL(x2, x3, x4)
   EOS(x1) -> EOS
   List(x1, x2) -> List(x2)
Filtered duplicate arguments:
   f1983_0_reverse_NULL(x1, x2, x3) -> f1983_0_reverse_NULL(x2, x3)
Finished conversion. Obtained 1 rules.P rules:
f1983_0_reverse_NULL(java.lang.Object(List(o1031812826308:0)), java.lang.Object(List(java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(java.lang.Object(List(java.lang.Object(List(o1031put1625688421:0)))), java.lang.Object(o1113sub:0)) :|: TRUE

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

(9)
Obligation:
Rules:
f1983_0_reverse_NULL(java.lang.Object(List(o1031812826308:0)), java.lang.Object(List(java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(java.lang.Object(List(java.lang.Object(List(o1031put1625688421:0)))), java.lang.Object(o1113sub:0)) :|: TRUE

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

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

(11)
Obligation:
Rules:
f1983_0_reverse_NULL(java.lang.Object(List(o1031812826308:0)), java.lang.Object(List(java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(java.lang.Object(List(java.lang.Object(List(o1031put1625688421:0)))), java.lang.Object(o1113sub:0)) :|: TRUE

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

(12) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1983_0_reverse_NULL(java.lang.Object(List(o1031812826308:0)), java.lang.Object(List(java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(java.lang.Object(List(java.lang.Object(List(o1031put1625688421:0)))), java.lang.Object(o1113sub:0)) :|: TRUE

Arcs:
(1) -> (1)

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

(13)
Obligation:

Termination digraph:
Nodes:
(1) f1983_0_reverse_NULL(java.lang.Object(List(o1031812826308:0)), java.lang.Object(List(java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(java.lang.Object(List(java.lang.Object(List(o1031put1625688421:0)))), java.lang.Object(o1113sub:0)) :|: TRUE

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

(14) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f1983_0_reverse_NULL(VARIABLE, VARIABLE)
java.lang.Object(VARIABLE)
List(VARIABLE)
Removed predefined arithmetic.
----------------------------------------

(15)
Obligation:
Rules:
f1983_0_reverse_NULL(java.lang.Object(List(java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(java.lang.Object(o1113sub:0)) :|: TRUE

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

(16) IRSwTToQDPProof (SOUND)
Removed the integers and created a QDP-Problem.
----------------------------------------

(17)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   f1983_0_reverse_NULL(java.lang.Object(List(java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(java.lang.Object(o1113sub:0))

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
----------------------------------------

(18) QDPSizeChangeProof (EQUIVALENT)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 

From the DPs we obtained the following set of size-change graphs:
*f1983_0_reverse_NULL(java.lang.Object(List(java.lang.Object(o1113sub:0)))) -> f1983_0_reverse_NULL(java.lang.Object(o1113sub:0))
The graph contains the following edges 1 > 1


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

(19)
YES

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

(20)
Obligation:
SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: ListReversePanhandleList.main([Ljava/lang/String;)V
SCC calls the following helper methods: 
Performed SCC analyses:
*Used field analysis yielded the following read fields:
*List: [n]
*Marker field analysis yielded the following relations that could be markers:

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

(21) SCCToIRSProof (SOUND)
Transformed FIGraph SCCs to intTRSs. Log: 
Generated rules. Obtained 16 IRulesP rules:
f1657_0_reverse_FieldAccess(EOS(STATIC_1657), o675[List.n]o675, o795[List.n]o675) -> f1672_0_reverse_FieldAccess(EOS(STATIC_1672), o675[List.n]o675, o796[List.n]o675) :|: o796[List.n]o675 < o795[List.n]o675 && o795[List.n]o675 >= 0
f1672_0_reverse_FieldAccess(EOS(STATIC_1672), o675[List.n]o675, o796[List.n]o675) -> f1686_0_reverse_Store(EOS(STATIC_1686), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1686_0_reverse_Store(EOS(STATIC_1686), o675[List.n]o675, o796[List.n]o675) -> f1706_0_reverse_Load(EOS(STATIC_1706), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1706_0_reverse_Load(EOS(STATIC_1706), o675[List.n]o675, o796[List.n]o675) -> f1741_0_reverse_Load(EOS(STATIC_1741), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1741_0_reverse_Load(EOS(STATIC_1741), o675[List.n]o675, o796[List.n]o675) -> f1763_0_reverse_FieldAccess(EOS(STATIC_1763), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1763_0_reverse_FieldAccess(EOS(STATIC_1763), o675[List.n]o675, o796[List.n]o675) -> f1785_0_reverse_Load(EOS(STATIC_1785), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1785_0_reverse_Load(EOS(STATIC_1785), o675[List.n]o675, o796[List.n]o675) -> f1801_0_reverse_Store(EOS(STATIC_1801), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1801_0_reverse_Store(EOS(STATIC_1801), o675[List.n]o675, o796[List.n]o675) -> f1826_0_reverse_JMP(EOS(STATIC_1826), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1826_0_reverse_JMP(EOS(STATIC_1826), o675[List.n]o675, o796[List.n]o675) -> f1934_0_reverse_Load(EOS(STATIC_1934), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1934_0_reverse_Load(EOS(STATIC_1934), o675[List.n]o675, o796[List.n]o675) -> f1529_0_reverse_Load(EOS(STATIC_1529), o675[List.n]o675, o796[List.n]o675) :|: TRUE
f1529_0_reverse_Load(EOS(STATIC_1529), o675[List.n]o675, o674[List.n]o675) -> f1548_0_reverse_NULL(EOS(STATIC_1548), o675[List.n]o675, o674[List.n]o675) :|: TRUE
f1548_0_reverse_NULL(EOS(STATIC_1548), o675[List.n]o675, o674[List.n]o675) -> f1556_0_reverse_Load(EOS(STATIC_1556), o675[List.n]o675, o674[List.n]o675) :|: TRUE
f1556_0_reverse_Load(EOS(STATIC_1556), o675[List.n]o675, o674[List.n]o675) -> f1565_0_reverse_Store(EOS(STATIC_1565), o675[List.n]o675, o674[List.n]o675) :|: TRUE
f1565_0_reverse_Store(EOS(STATIC_1565), o675[List.n]o675, o674[List.n]o675) -> f1588_0_reverse_Load(EOS(STATIC_1588), o675[List.n]o675, o674[List.n]o675) :|: TRUE
f1588_0_reverse_Load(EOS(STATIC_1588), o675[List.n]o675, o674[List.n]o675) -> f1626_0_reverse_FieldAccess(EOS(STATIC_1626), o675[List.n]o675, o674[List.n]o675) :|: TRUE
f1626_0_reverse_FieldAccess(EOS(STATIC_1626), o675[List.n]o675, o674[List.n]o675) -> f1657_0_reverse_FieldAccess(EOS(STATIC_1657), o675[List.n]o675, o674[List.n]o675) :|: o675[List.n]o675 > 0 && o674[List.n]o675 > 0
Combined rules. Obtained 1 IRulesP rules:
f1657_0_reverse_FieldAccess(EOS(STATIC_1657), o675[List.n]o675:0, o795[List.n]o675:0) -> f1657_0_reverse_FieldAccess(EOS(STATIC_1657), o675[List.n]o675:0, o796[List.n]o675:0) :|: o795[List.n]o675:0 > -1 && o796[List.n]o675:0 < o795[List.n]o675:0 && o675[List.n]o675:0 > 0 && o796[List.n]o675:0 > 0
Filtered constant ground arguments:
   f1657_0_reverse_FieldAccess(x1, x2, x3) -> f1657_0_reverse_FieldAccess(x2, x3)
   EOS(x1) -> EOS
Finished conversion. Obtained 1 rules.P rules:
f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o795[List.n]o675:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o796[List.n]o675:0) :|: o796[List.n]o675:0 < o795[List.n]o675:0 && o795[List.n]o675:0 > -1 && o796[List.n]o675:0 > 0 && o675[List.n]o675:0 > 0

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

(22)
Obligation:
Rules:
f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o795[List.n]o675:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o796[List.n]o675:0) :|: o796[List.n]o675:0 < o795[List.n]o675:0 && o795[List.n]o675:0 > -1 && o796[List.n]o675:0 > 0 && o675[List.n]o675:0 > 0

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

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

(24)
Obligation:
Rules:
f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o795[List.n]o675:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o796[List.n]o675:0) :|: o796[List.n]o675:0 < o795[List.n]o675:0 && o795[List.n]o675:0 > -1 && o796[List.n]o675:0 > 0 && o675[List.n]o675:0 > 0

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

(25) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o795[List.n]o675:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o796[List.n]o675:0) :|: o796[List.n]o675:0 < o795[List.n]o675:0 && o795[List.n]o675:0 > -1 && o796[List.n]o675:0 > 0 && o675[List.n]o675:0 > 0

Arcs:
(1) -> (1)

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

(26)
Obligation:

Termination digraph:
Nodes:
(1) f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o795[List.n]o675:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0, o796[List.n]o675:0) :|: o796[List.n]o675:0 < o795[List.n]o675:0 && o795[List.n]o675:0 > -1 && o796[List.n]o675:0 > 0 && o675[List.n]o675:0 > 0

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(28)
Obligation:
Rules:
f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0, o795[List.n]o675:0:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0, o796[List.n]o675:0:0) :|: o796[List.n]o675:0:0 > 0 && o675[List.n]o675:0:0 > 0 && o795[List.n]o675:0:0 > -1 && o796[List.n]o675:0:0 < o795[List.n]o675:0:0

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

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

(30)
Obligation:
Rules:
f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0, o795[List.n]o675:0:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0, o796[List.n]o675:0:0) :|: o796[List.n]o675:0:0 > 0 && o675[List.n]o675:0:0 > 0 && o795[List.n]o675:0:0 > -1 && o796[List.n]o675:0:0 < o795[List.n]o675:0:0

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

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

(32)
Obligation:
Rules:
f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0:0, o795[List.n]o675:0:0:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0:0, o796[List.n]o675:0:0:0) :|: o795[List.n]o675:0:0:0 > -1 && o796[List.n]o675:0:0:0 < o795[List.n]o675:0:0:0 && o675[List.n]o675:0:0:0 > 0 && o796[List.n]o675:0:0:0 > 0

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

(33) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1657_0_reverse_FieldAccess(x, x1)] = x1

The following rules are decreasing:
f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0:0, o795[List.n]o675:0:0:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0:0, o796[List.n]o675:0:0:0) :|: o795[List.n]o675:0:0:0 > -1 && o796[List.n]o675:0:0:0 < o795[List.n]o675:0:0:0 && o675[List.n]o675:0:0:0 > 0 && o796[List.n]o675:0:0:0 > 0
The following rules are bounded:
f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0:0, o795[List.n]o675:0:0:0) -> f1657_0_reverse_FieldAccess(o675[List.n]o675:0:0:0, o796[List.n]o675:0:0:0) :|: o795[List.n]o675:0:0:0 > -1 && o796[List.n]o675:0:0:0 < o795[List.n]o675:0:0:0 && o675[List.n]o675:0:0:0 > 0 && o796[List.n]o675:0:0:0 > 0

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

(34)
YES

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

(35)
Obligation:
SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: ListReversePanhandleList.main([Ljava/lang/String;)V
SCC calls the following helper methods: 
Performed SCC analyses:
*Used field analysis yielded the following read fields:

*Marker field analysis yielded the following relations that could be markers:

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

(36) SCCToIRSProof (SOUND)
Transformed FIGraph SCCs to intTRSs. Log: 
Generated rules. Obtained 17 IRulesP rules:
f723_0_createList_Load(EOS(STATIC_723), i86) -> f766_0_createList_LE(EOS(STATIC_766), i86, i86) :|: TRUE
f766_0_createList_LE(EOS(STATIC_766), i106, i106) -> f779_0_createList_LE(EOS(STATIC_779), i106, i106) :|: TRUE
f779_0_createList_LE(EOS(STATIC_779), i106, i106) -> f788_0_createList_New(EOS(STATIC_788), i106) :|: i106 > 0
f788_0_createList_New(EOS(STATIC_788), i106) -> f796_0_createList_Duplicate(EOS(STATIC_796), i106) :|: TRUE
f796_0_createList_Duplicate(EOS(STATIC_796), i106) -> f803_0_createList_Load(EOS(STATIC_803), i106) :|: TRUE
f803_0_createList_Load(EOS(STATIC_803), i106) -> f810_0_createList_InvokeMethod(EOS(STATIC_810), i106) :|: TRUE
f810_0_createList_InvokeMethod(EOS(STATIC_810), i106) -> f820_0__init__Load(EOS(STATIC_820), i106) :|: TRUE
f820_0__init__Load(EOS(STATIC_820), i106) -> f872_0__init__InvokeMethod(EOS(STATIC_872), i106) :|: TRUE
f872_0__init__InvokeMethod(EOS(STATIC_872), i106) -> f883_0__init__Load(EOS(STATIC_883), i106) :|: TRUE
f883_0__init__Load(EOS(STATIC_883), i106) -> f892_0__init__Load(EOS(STATIC_892), i106) :|: TRUE
f892_0__init__Load(EOS(STATIC_892), i106) -> f904_0__init__FieldAccess(EOS(STATIC_904), i106) :|: TRUE
f904_0__init__FieldAccess(EOS(STATIC_904), i106) -> f921_0__init__Return(EOS(STATIC_921), i106) :|: TRUE
f921_0__init__Return(EOS(STATIC_921), i106) -> f937_0_createList_Store(EOS(STATIC_937), i106) :|: TRUE
f937_0_createList_Store(EOS(STATIC_937), i106) -> f944_0_createList_JMP(EOS(STATIC_944), i106) :|: TRUE
f944_0_createList_JMP(EOS(STATIC_944), i106) -> f958_0_createList_Inc(EOS(STATIC_958), i106) :|: TRUE
f958_0_createList_Inc(EOS(STATIC_958), i106) -> f713_0_createList_Inc(EOS(STATIC_713), i106) :|: TRUE
f713_0_createList_Inc(EOS(STATIC_713), i13) -> f723_0_createList_Load(EOS(STATIC_723), i13 + -1) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f723_0_createList_Load(EOS(STATIC_723), i86:0) -> f723_0_createList_Load(EOS(STATIC_723), i86:0 - 1) :|: i86:0 > 0
Filtered constant ground arguments:
   f723_0_createList_Load(x1, x2) -> f723_0_createList_Load(x2)
   EOS(x1) -> EOS
Finished conversion. Obtained 1 rules.P rules:
f723_0_createList_Load(i86:0) -> f723_0_createList_Load(i86:0 - 1) :|: i86:0 > 0

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

(37)
Obligation:
Rules:
f723_0_createList_Load(i86:0) -> f723_0_createList_Load(i86:0 - 1) :|: i86:0 > 0

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

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

(39)
Obligation:
Rules:
f723_0_createList_Load(i86:0) -> f723_0_createList_Load(arith) :|: i86:0 > 0 && arith = i86:0 - 1

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

(40) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f723_0_createList_Load(i86:0) -> f723_0_createList_Load(arith) :|: i86:0 > 0 && arith = i86:0 - 1

Arcs:
(1) -> (1)

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

(41)
Obligation:

Termination digraph:
Nodes:
(1) f723_0_createList_Load(i86:0) -> f723_0_createList_Load(arith) :|: i86:0 > 0 && arith = i86:0 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(43)
Obligation:
Rules:
f723_0_createList_Load(i86:0:0) -> f723_0_createList_Load(i86:0:0 - 1) :|: i86:0:0 > 0

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

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

(45)
Obligation:
Rules:
f723_0_createList_Load(i86:0:0) -> f723_0_createList_Load(c) :|: c = i86:0:0 - 1 && i86:0:0 > 0

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

(46) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f723_0_createList_Load(x)] = x

The following rules are decreasing:
f723_0_createList_Load(i86:0:0) -> f723_0_createList_Load(c) :|: c = i86:0:0 - 1 && i86:0:0 > 0
The following rules are bounded:
f723_0_createList_Load(i86:0:0) -> f723_0_createList_Load(c) :|: c = i86:0:0 - 1 && i86:0:0 > 0

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

(47)
YES

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

(48)
Obligation:
SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: ListReversePanhandleList.main([Ljava/lang/String;)V
SCC calls the following helper methods: 
Performed SCC analyses:
*Used field analysis yielded the following read fields:

*Marker field analysis yielded the following relations that could be markers:

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

(49) SCCToIRSProof (SOUND)
Transformed FIGraph SCCs to intTRSs. Log: 
Generated rules. Obtained 17 IRulesP rules:
f637_0_createList_Load(EOS(STATIC_637), i81) -> f640_0_createList_LE(EOS(STATIC_640), i81, i81) :|: TRUE
f640_0_createList_LE(EOS(STATIC_640), i83, i83) -> f644_0_createList_LE(EOS(STATIC_644), i83, i83) :|: TRUE
f644_0_createList_LE(EOS(STATIC_644), i83, i83) -> f647_0_createList_New(EOS(STATIC_647), i83) :|: i83 > 0
f647_0_createList_New(EOS(STATIC_647), i83) -> f649_0_createList_Duplicate(EOS(STATIC_649), i83) :|: TRUE
f649_0_createList_Duplicate(EOS(STATIC_649), i83) -> f653_0_createList_Load(EOS(STATIC_653), i83) :|: TRUE
f653_0_createList_Load(EOS(STATIC_653), i83) -> f657_0_createList_InvokeMethod(EOS(STATIC_657), i83) :|: TRUE
f657_0_createList_InvokeMethod(EOS(STATIC_657), i83) -> f659_0__init__Load(EOS(STATIC_659), i83) :|: TRUE
f659_0__init__Load(EOS(STATIC_659), i83) -> f665_0__init__InvokeMethod(EOS(STATIC_665), i83) :|: TRUE
f665_0__init__InvokeMethod(EOS(STATIC_665), i83) -> f676_0__init__Load(EOS(STATIC_676), i83) :|: TRUE
f676_0__init__Load(EOS(STATIC_676), i83) -> f694_0__init__Load(EOS(STATIC_694), i83) :|: TRUE
f694_0__init__Load(EOS(STATIC_694), i83) -> f703_0__init__FieldAccess(EOS(STATIC_703), i83) :|: TRUE
f703_0__init__FieldAccess(EOS(STATIC_703), i83) -> f711_0__init__Return(EOS(STATIC_711), i83) :|: TRUE
f711_0__init__Return(EOS(STATIC_711), i83) -> f717_0_createList_Store(EOS(STATIC_717), i83) :|: TRUE
f717_0_createList_Store(EOS(STATIC_717), i83) -> f720_0_createList_JMP(EOS(STATIC_720), i83) :|: TRUE
f720_0_createList_JMP(EOS(STATIC_720), i83) -> f761_0_createList_Inc(EOS(STATIC_761), i83) :|: TRUE
f761_0_createList_Inc(EOS(STATIC_761), i83) -> f631_0_createList_Inc(EOS(STATIC_631), i83) :|: TRUE
f631_0_createList_Inc(EOS(STATIC_631), i78) -> f637_0_createList_Load(EOS(STATIC_637), i78 + -1) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f637_0_createList_Load(EOS(STATIC_637), i81:0) -> f637_0_createList_Load(EOS(STATIC_637), i81:0 - 1) :|: i81:0 > 0
Filtered constant ground arguments:
   f637_0_createList_Load(x1, x2) -> f637_0_createList_Load(x2)
   EOS(x1) -> EOS
Finished conversion. Obtained 1 rules.P rules:
f637_0_createList_Load(i81:0) -> f637_0_createList_Load(i81:0 - 1) :|: i81:0 > 0

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

(50)
Obligation:
Rules:
f637_0_createList_Load(i81:0) -> f637_0_createList_Load(i81:0 - 1) :|: i81:0 > 0

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

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

(52)
Obligation:
Rules:
f637_0_createList_Load(i81:0) -> f637_0_createList_Load(arith) :|: i81:0 > 0 && arith = i81:0 - 1

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

(53) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f637_0_createList_Load(i81:0) -> f637_0_createList_Load(arith) :|: i81:0 > 0 && arith = i81:0 - 1

Arcs:
(1) -> (1)

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

(54)
Obligation:

Termination digraph:
Nodes:
(1) f637_0_createList_Load(i81:0) -> f637_0_createList_Load(arith) :|: i81:0 > 0 && arith = i81:0 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(56)
Obligation:
Rules:
f637_0_createList_Load(i81:0:0) -> f637_0_createList_Load(i81:0:0 - 1) :|: i81:0:0 > 0

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

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

(58)
Obligation:
Rules:
f637_0_createList_Load(i81:0:0) -> f637_0_createList_Load(c) :|: c = i81:0:0 - 1 && i81:0:0 > 0

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

(59) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f637_0_createList_Load(x)] = x

The following rules are decreasing:
f637_0_createList_Load(i81:0:0) -> f637_0_createList_Load(c) :|: c = i81:0:0 - 1 && i81:0:0 > 0
The following rules are bounded:
f637_0_createList_Load(i81:0:0) -> f637_0_createList_Load(c) :|: c = i81:0:0 - 1 && i81:0:0 > 0

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

(60)
YES