Termination of the given JBC could be proven:

(0) Obligation:

JBC Problem based on JBC Program:

public class Sequence {
    public static void main(String[] args) {
	for (int i = 0; i < 100; i++) {};

	for (int j = 5; j < 21; j += 3) {};
    }
}

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

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

(3) TerminationGraphToSCCProof (SOUND transformation)

Proven termination by absence of SCCs

(4) TRUE