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

(0) Obligation:

Need to prove time_complexity of the following program:

public class IntPath2 {
    public static void main(int i) {
		Object obj = null;
		if (i > 0)
			obj = new Object();
		while (i == 0 && obj != null)
			obj = new Object();
    }
}

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

Constructed TerminationGraph.

(2) Obligation:

Termination Graph based on JBC Program:
IntPath2.main(I)V: Graph of 47 nodes with 0 SCCs.

(3) TerminationGraphToComplexityProof (EQUIVALENT transformation)

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

(4) BOUNDS(CONSTANT, 34)

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

Constructed TerminationGraph.

(6) Obligation:

Termination Graph based on JBC Program:
IntPath2.main(I)V: Graph of 47 nodes with 0 SCCs.

(7) TerminationGraphToComplexityProof (BOTH CONCRETE BOUNDS(ID, ADD(14)) transformation)

Extracted set of 32 edges for the analysis of TIME complexity. Kept leaves.

(8) Obligation:

Set of 32 edges based on JBC Program.
Performed SCC analyses:

• Used field analysis yielded the following read fields:
  

Considered paths: nonterm paths and paths from start to sinks