The time complexity of the given JBC problem could be proven to be BOUNDS(CONSTANT, 130).

(0) Obligation:

Need to prove time_complexity of the following program:

public class CyclicPair2 {
	CyclicPair2 next;

    public static void main(String[] args) {
        Random.args = args;
        CyclicPair2 one = new CyclicPair2();
        CyclicPair2 two = new CyclicPair2();
		int rand = Random.random();
        if (rand != 0) {
            one.next = two;
            two.next = one;
        } else {
            one.next = two;
        }

        if (rand == 0) {
            one.run();
        }
    }

    public void run() {
       CyclicPair2 current = this;
       while (current != null)
           current = current.next;
    }
}


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

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

(1) JBCToGraph (BOTH CONCRETE BOUNDS(ID, ID) transformation)

Constructed TerminationGraph.

(2) Obligation:

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

(3) TerminationGraphToComplexityProof (EQUIVALENT transformation)

Proven constant complexity by absence of SCCs and edges with non-constant weight

(4) BOUNDS(CONSTANT, 130)