anchor.diff:      if(time - timeLast > 1d0 .or. more /= 1) then
         timeLast = time
         cur_cp = N_cp
  -      if(.not. actually_computed(1)) cycle pullLoop
  +      if(.not. actually_computed(mrcc_jobs(1))) cycle pullLoop
   
         do i=2,N_det_generators
  -        if(.not. actually_computed(i)) then
  +        if(.not. actually_computed(mrcc_jobs(i))) then
  +          print *, "first not comp", i
             cur_cp = done_cp_at(i-1)
             exit
           end if
  
positive.code:   logical, allocatable         :: computed(:)
    integer                        :: i, j, last_full, dets(comb_teeth)
    integer                        :: k, l, cur_cp, under_det(comb_teeth+1)
    
    allocate(computed(N_det_generators))
    cps = 0d0
    cur_cp = 1
    done_cp_at = 0
  
negative.code:   cps(:, N_cp) = 0d0
    cp_first_tooth(N_cp) = comb_teeth+1
  
    iorder = -1132154665
    do i=1,N_cp-1
      call isort(mrcc_jobs(first_cp(i)+1:first_cp(i+1)),iorder,first_cp(i+1)-first_cp(i))
    end do
  ! end subroutine
  END_PROVIDER
  
  