Meaning of the annotations for the proof of each method:
- loop: the method seems to be part of a loop or recursion
- inherits: the method seems to call a method that possibly diverges
- may_diverge: proved the existence of at least a diverging execution
- local_polyh: proved to terminate by using a local linear ranking function for the binary unfolding with polyhedra
- local_bds: proved to terminate by using local linear ranking functions for the binary unfolding with bounded difference shapes
- local_sct: proved to terminate via the size change termination principle with monotonicity constraints
- global_lex_aff_rnkfn: proved to terminate by using a global lexicographic affine ranking function
- finite_unfoldings: proved to terminate since there is a finite number of undoldings
  * numerical: the ranking function uses numerical variables or fields
  * structural: the ranking function uses reference variables or fields

These methods do not introduce divergence:
                                             javaUtilEx.LinkedList$ListItr.next():java.lang.Object
                                             javaUtilEx.IllegalStateException.():void
                                             javaUtilEx.LinkedList.addLast(java.lang.Object):void
                                             javaUtilEx.LinkedList.listIterator(int):javaUtilEx.ListIterator
                                             javaUtilEx.AbstractCollection.():void
[loop,numerical,structural,local_bds]        javaUtilEx.LinkedList$ListItr.(javaUtilEx.LinkedList,int):void
                                             javaUtilEx.juLinkedListCreateRemoveRange.main(java.lang.String[]):void
                                             javaUtilEx.ConcurrentModificationException.():void
                                             javaUtilEx.AbstractSequentialList.():void
[loop,numerical,local_bds]                   javaUtilEx.juLinkedListCreateRemoveRange.createList(int):javaUtilEx.LinkedList
                                             javaUtilEx.LinkedList.addBefore(java.lang.Object,javaUtilEx.LinkedList$Entry):javaUtilEx.LinkedList$Entry
                                             javaUtilEx.LinkedList$ListItr.remove():void
                                             javaUtilEx.NoSuchElementException.():void
                                             javaUtilEx.LinkedList$Entry.(java.lang.Object,javaUtilEx.LinkedList$Entry,javaUtilEx.LinkedList$Entry):void
                                             javaUtilEx.AbstractList.():void
                                             javaUtilEx.LinkedList.remove(javaUtilEx.LinkedList$Entry):java.lang.Object
                                             javaUtilEx.Random.():void
                                             javaUtilEx.LinkedList.():void
                                             javaUtilEx.Random.random():int
                                             javaUtilEx.Content.(int):void
                                             javaUtilEx.LinkedList$ListItr.checkForComodification():void
[loop,numerical,local_bds]                   javaUtilEx.AbstractList.removeRange(int,int):void

There is at least a diverging computation for these methods:
  none

Nothing is known about these methods:
  none

Methods that might introduce divergence: 0/22 (  0.00%)
Methods that do might introduce or inherit divergence: 0/22 (  0.00%)
Methods that definitely terminate: 22/22 (100.00%)

There are no warnings