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

(0) Obligation:

Need to prove time_complexity of the following program:

public class SharingPair {
	SharingPair next;

	public static void main(int i) {
		SharingPair one = new SharingPair();
		SharingPair two = new SharingPair();
		SharingPair cur;
		if (i == 0) {
			one.next = two;
			cur = one;
		} else {
			two.next = one;
			cur = two;
		}

		while (true) {
			if (i == 0) {
				one.next = new SharingPair();
				cur = cur.next;
			} else {
				two.next = new SharingPair();
				cur = cur.next;
			}
		}
	}
}

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

Constructed TerminationGraph.

(2) Obligation:

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

(3) TerminationGraphToComplexityProof (EQUIVALENT transformation)

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

(4) BOUNDS(CONSTANT, 161)