(0) Obligation:

JBC Problem based on JBC Program:
/**
* A loop whose termination depends on a <tt>break</tt> statement.
*
* All calls terminate.
*
* Julia + BinTerm prove that all calls terminate
*
* @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A>
*/

public class Break {

public static void main(String[] args) {
int i = 0;

while (true) {
if (i > 10) break;
i++;
}
}
}

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

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


(3) TerminationGraphToSCCProof (SOUND transformation)

Proven termination by absence of SCCs

(4) TRUE