(0) Obligation:

JBC Problem based on JBC Program:
public class A {
public void method() {
while (true);
}
}


public class ArrayClasses {
public static void main(String[] args) {
Random.args = args;
A[] data = new A[2];
data[0] = new A();
data[1] = new B();
int i = Random.random();
if (i == 1) data[i].method();
}
}


public class B extends A {
public void method() {
return;
}
}


public class Random {
static String[] args;
static int index = 0;

public static int random() {
String string = args[index];
index++;
return string.length();
}
}


(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

Termination Graph based on JBC Program:
ArrayClasses.main([Ljava/lang/String;)V: Graph of 140 nodes with 0 SCCs.


(3) TerminationGraphToSCCProof (SOUND transformation)

Proven termination by absence of SCCs

(4) TRUE