When testing deleteMin method, there is one location in percolateDown is
never covered (line 10). 
private void percolateDown( int hole )
        {
/* 1*/      int child;
/* 2*/      int tmp = array[ hole ];

/* 3*/      for( ; hole * 2 <= currentSize; hole = child )
            {
/* 4*/          child = hole * 2;
/* 5*/          if( child != currentSize &&
/* 6*/                  array[ child + 1 ]< array[ child ]  )
/* 7*/              child++;
/* 8*/          if( array[ child ]< tmp )
/* 9*/              array[ hole ] = array[ child ];
                else
/*10*/              break;
            }
/*11*/      array[ hole ] = tmp;
        }
 This is because line 10 is short circuited in bytecode and only a label is left.
 
 The branch coverage of findMin method is 50%. This is because findMin which
 has a branch condition isEmpty is called
 in deleteMin after isEmpty returning false. 
 
Result for testing deleteMin:
k=1,
Total #Pre:1 #POST: 2
Method {|intelement.BinaryHeap.spex_M_deleteMin()I|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 33 num of covered location is 33
Method {|intelement.BinaryHeap.wellFormed()Z|}: Total num of branches is 16 covered is 9 branch coverage is 0.5625 Total num of location is 76 num of covered location is 46
Method MAIN: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 7 num of covered location is 7
Method {|intelement.BinaryHeap.deleteMin$Top()I|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 28 num of covered location is 25
Method {|intelement.BinaryHeap.isEmpty()Z|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 8 num of covered location is 8
Method {|intelement.BinaryHeap.percolateDown(I)V|}: Total num of branches is 8 covered is 1 branch coverage is 0.125 Total num of location is 60 num of covered location is 19
Method {|intelement.BinaryHeap.findMin()I|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 13 num of covered location is 11
k=2,
Total #Pre:2 #POST: 3
Method {|intelement.BinaryHeap.spex_M_deleteMin()I|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 33 num of covered location is 33
Method {|intelement.BinaryHeap.wellFormed()Z|}: Total num of branches is 16 covered is 13 branch coverage is 0.8125 Total num of location is 76 num of covered location is 72
Method MAIN: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 7 num of covered location is 7
Method {|intelement.BinaryHeap.deleteMin$Top()I|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 28 num of covered location is 25
Method {|intelement.BinaryHeap.isEmpty()Z|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 8 num of covered location is 8
Method {|intelement.BinaryHeap.percolateDown(I)V|}: Total num of branches is 8 covered is 1 branch coverage is 0.125 Total num of location is 60 num of covered location is 19
Method {|intelement.BinaryHeap.findMin()I|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 13 num of covered location is 11
k=3,
Total #Pre:3 #POST: 5
Method {|intelement.BinaryHeap.spex_M_deleteMin()I|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 33 num of covered location is 33
Method {|intelement.BinaryHeap.wellFormed()Z|}: Total num of branches is 16 covered is 16 branch coverage is 1.0 Total num of location is 76 num of covered location is 76
Method MAIN: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 7 num of covered location is 7
Method {|intelement.BinaryHeap.deleteMin$Top()I|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 28 num of covered location is 25
Method {|intelement.BinaryHeap.isEmpty()Z|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 8 num of covered location is 8
Method {|intelement.BinaryHeap.percolateDown(I)V|}: Total num of branches is 8 covered is 5 branch coverage is 0.625 Total num of location is 60 num of covered location is 46
Method {|intelement.BinaryHeap.findMin()I|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 13 num of covered location is 11
k=4,
Total #Pre:4 #POST: 8
Method {|intelement.BinaryHeap.spex_M_deleteMin()I|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 33 num of covered location is 33
Method {|intelement.BinaryHeap.wellFormed()Z|}: Total num of branches is 16 covered is 16 branch coverage is 1.0 Total num of location is 76 num of covered location is 76
Method MAIN: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 7 num of covered location is 7
Method {|intelement.BinaryHeap.deleteMin$Top()I|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 28 num of covered location is 25
Method {|intelement.BinaryHeap.isEmpty()Z|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 8 num of covered location is 8
Method {|intelement.BinaryHeap.percolateDown(I)V|}: Total num of branches is 8 covered is 8 branch coverage is 1.0 Total num of location is 60 num of covered location is 59
Method {|intelement.BinaryHeap.findMin()I|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 13 num of covered location is 11

Checking insert method:
k=1,
Total #Pre:1 #POST: 2
Method {|intelement.BinaryHeap.insert$Top(I)V|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 26 num of covered location is 23
Method {|intelement.BinaryHeap.wellFormed()Z|}: Total num of branches is 16 covered is 9 branch coverage is 0.5625 Total num of location is 76 num of covered location is 46
Method MAIN: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 9 num of covered location is 9
Method {|intelement.BinaryHeap.isFull()Z|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 13 num of covered location is 13
Method {|intelement.BinaryHeap.spex_M_insert(I)V|}: Total num of branches is 6 covered is 6 branch coverage is 1.0 Total num of location is 53 num of covered location is 49
Method {|intelement.Overflow.<init>()V|}: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 3 num of covered location is 3
k=2,
Total #Pre:2 #POST: 5
Method {|intelement.BinaryHeap.insert$Top(I)V|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 26 num of covered location is 23
Method {|intelement.BinaryHeap.wellFormed()Z|}: Total num of branches is 16 covered is 13 branch coverage is 0.8125 Total num of location is 76 num of covered location is 72
Method MAIN: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 9 num of covered location is 9
Method {|intelement.BinaryHeap.isFull()Z|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 13 num of covered location is 13
Method {|intelement.BinaryHeap.spex_M_insert(I)V|}: Total num of branches is 6 covered is 6 branch coverage is 1.0 Total num of location is 53 num of covered location is 53
Method {|intelement.Overflow.<init>()V|}: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 3 num of covered location is 3
k=3,
Total #Pre:3 #POST: 8
Method {|intelement.BinaryHeap.insert$Top(I)V|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 26 num of covered location is 23
Method {|intelement.BinaryHeap.wellFormed()Z|}: Total num of branches is 16 covered is 16 branch coverage is 1.0 Total num of location is 76 num of covered location is 76
Method MAIN: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 9 num of covered location is 9
Method {|intelement.BinaryHeap.isFull()Z|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 13 num of covered location is 13
Method {|intelement.BinaryHeap.spex_M_insert(I)V|}: Total num of branches is 6 covered is 6 branch coverage is 1.0 Total num of location is 53 num of covered location is 53
Method {|intelement.Overflow.<init>()V|}: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 3 num of covered location is 3
k=4,
Total #Pre:4 #POST: 12
Method {|intelement.BinaryHeap.insert$Top(I)V|}: Total num of branches is 2 covered is 1 branch coverage is 0.5 Total num of location is 26 num of covered location is 23
Method {|intelement.BinaryHeap.wellFormed()Z|}: Total num of branches is 16 covered is 16 branch coverage is 1.0 Total num of location is 76 num of covered location is 76
Method MAIN: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 9 num of covered location is 9
Method {|intelement.BinaryHeap.isFull()Z|}: Total num of branches is 2 covered is 2 branch coverage is 1.0 Total num of location is 13 num of covered location is 13
Method {|intelement.BinaryHeap.spex_M_insert(I)V|}: Total num of branches is 6 covered is 6 branch coverage is 1.0 Total num of location is 53 num of covered location is 53
Method {|intelement.Overflow.<init>()V|}: Total num of branches is 0 covered is 0 branch coverage is NaN Total num of location is 3 num of covered location is 3
  