Remove unneeded utils, small fixes

src/main/scala/inox/solvers/z3/NativeZ3Solver.scala

@@ -3,7 +3,6 @@
 package inox
 package solvers.z3
 
-import utils._
 import solvers.{z3 => _, _}
 import unrolling._
 import theories._

src/main/scala/inox/utils/FreeableIterator.scala

@@ -23,7 +23,7 @@ abstract class FreeableIterator[T] extends Iterator[T] {
 
   override def map[B](f: T => B): FreeableIterator[B] = {
     new FreeableIterator[B] {
-      def computeNext() = orig.computeNext.map(f)
+      def computeNext() = orig.computeNext().map(f)
       def free() = orig.free()
     }
   }
@@ -35,7 +35,7 @@ abstract class FreeableIterator[T] extends Iterator[T] {
       def computeNext() = {
         if (c < n) {
           c += 1
-          orig.computeNext
+          orig.computeNext()
         } else {
           None
         }
@@ -47,7 +47,7 @@ abstract class FreeableIterator[T] extends Iterator[T] {
 
   override def takeWhile(p: T => Boolean) = {
     new FreeableIterator[T] {
-      def computeNext(): Option[T] = orig.computeNext.filter(p)
+      def computeNext(): Option[T] = orig.computeNext().filter(p)
       def free(): Unit = orig.free()
     }
   }

src/main/scala/inox/utils/GraphOps.scala

@@ -16,8 +16,7 @@ object GraphOps {
       if (noPreds.isEmpty) {
         if (hasPreds.isEmpty) Right(done.reverse) 
         else Left(hasPreds.keySet)
-      } 
-      else {
+      } else {
         val found : Seq[A] = noPreds.keys.toSeq
         tSort(hasPreds mapValues { _ -- found }, found ++ done)    
       }

src/main/scala/inox/utils/GrowableIterable.scala

-/* Copyright 2009-2016 EPFL, Lausanne */
-
-package inox.utils
-
-import scala.collection.mutable.ArrayBuffer
-
-class GrowableIterable[T](init: Seq[T], growth: Iterator[T]) extends Iterable[T] {
-  private var buffer = new ArrayBuffer[T]() ++ init
-
-  var canGrow = () => true
-
-  private val cachingIterator = new Iterator[T] {
-    def hasNext = canGrow() && growth.hasNext
-
-    def next() = {
-      val res = growth.next()
-      buffer += res
-      res
-    }
-  }
-
-  def += (more: T)           = buffer +=  more
-  def ++=(more: Iterable[T]) = buffer ++= more
-  def -= (less: T)           = buffer -=  less
-  def --=(less: Iterable[T]) = buffer --= less
-
-  def iterator: Iterator[T] = {
-    buffer.iterator ++ cachingIterator
-  }
-
-  def bufferedCount = buffer.size
-
-  def sortBufferBy[B](f: T => B)(implicit ord: math.Ordering[B]) = {
-    buffer = buffer.sortBy(f)
-  }
-}

src/main/scala/inox/utils/Report.scala

-/* Copyright 2009-2016 EPFL, Lausanne */
-
-package inox.utils
-
-/** Represents a pretty-printable report */
-abstract class Report {
-  def summaryString: String
-}