Termination of the given JBC could be proven:

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_20 (Sun Microsystems Inc.) Main-Class: CyclicPair

public class CyclicPair {
	CyclicPair next;

	public static void main(String[] args) {
		Random.args = args;
		CyclicPair one = new CyclicPair();
		CyclicPair two = new CyclicPair();
		int i = Random.random();
		if (i == 0) { //two cyclic
			two.next = two;
		} else {      //one cyclic
			one.next = one;
		}

		while (two.next == two && one.next == one) {
			one.next = two;      //one: o1, two: o2 | o1: (next=o2), o2: (next=o2)
			two.next = one;      //one: o1, two: o2 | o1: (next=o2), o2: (next=o1)
			one.next = two.next; //one: o2, two: o2 | o1: (next=o1), o2: (next=o1)
			two.next = two;
		}
	}
}


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:
CyclicPair.main([Ljava/lang/String;)V: Graph of 138 nodes with 0 SCCs.

(3) TerminationGraphToSCCProof (SOUND transformation)

Proven termination by absence of SCCs

(4) TRUE