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

(0) Obligation:

Need to prove time_complexity of the following program:

public class A {
  public boolean hasSuperType() {
    return false;
  }

  public A getSuperType() {
    return null;
  }
}


public class B extends A {
  public boolean hasSuperType() {
    return true;
  }

  public A getSuperType() {
    return new A();
  }
}


public class C extends B {
  public A getSuperType() {
    return new B();
  }
}


public class TypeSwitch {
  public static void main(String[] args) {
    A x = null;
    switch (args.length) {
      case 0: x = new A();
              break;
      case 1: x = new B();
              break;
      case 2: x = new C();
              break;
    }

    while (x.hasSuperType()) {
      x = x.getSuperType();
    }
  }
}

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

Constructed TerminationGraph.

(2) Obligation:

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

(3) TerminationGraphToComplexityProof (EQUIVALENT transformation)

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

(4) BOUNDS(CONSTANT, 145)