Program: 9561
Project: 9561
Buggy source:
public void init(){
  for (  ObjectProperty op : reasoner.getObjectProperties()) {
    opDomains.put(op,reasoner.getDomain(op));
    opRanges.put(op,reasoner.getRange(op));
    if (useHasValueConstructor) {
      Map<Individual,Integer> opMap=new TreeMap<Individual,Integer>();
      valueFrequency.put(op,opMap);
      Collection<SortedSet<Individual>> fillerSets=reasoner.getPropertyMembers(op).values();
      for (      SortedSet<Individual> fillerSet : fillerSets) {
        for (        Individual i : fillerSet) {
          Integer value=opMap.get(i);
          if (value != null) {
            opMap.put(i,value + 1);
          }
 else {
            opMap.put(i,1);
          }
        }
      }
      Set<Individual> frequentInds=new TreeSet<Individual>();
      for (      Individual i : opMap.keySet()) {
        if (opMap.get(i) >= frequencyThreshold) {
          frequentInds.add(i);
        }
      }
      frequentValues.put(op,frequentInds);
    }
  }
  for (  DatatypeProperty dp : reasoner.getDatatypeProperties()) {
    dpDomains.put(dp,reasoner.getDomain(dp));
    if (useDataHasValueConstructor) {
      Map<Constant,Integer> dpMap=new TreeMap<Constant,Integer>();
      dataValueFrequency.put(dp,dpMap);
      Collection<SortedSet<Constant>> fillerSets=reasoner.getDatatypeMembers(dp).values();
      for (      SortedSet<Constant> fillerSet : fillerSets) {
        for (        Constant i : fillerSet) {
          Integer value=dpMap.get(i);
          if (value != null) {
            dpMap.put(i,value + 1);
          }
 else {
            dpMap.put(i,1);
          }
        }
      }
      Set<Constant> frequentInds=new TreeSet<Constant>();
      for (      Constant i : dpMap.keySet()) {
        if (dpMap.get(i) >= frequencyThreshold) {
          logger.trace("String_Node_Str" + i + "String_Node_Str"+ dpMap.get(i)+ "String_Node_Str"+ frequencyThreshold);
          frequentInds.add(i);
        }
      }
      frequentDataValues.put(dp,frequentInds);
    }
  }
  valueFrequency=null;
  dataValueFrequency=null;
  for (  DatatypeProperty dp : reasoner.getDoubleDatatypeProperties()) {
    computeSplits(dp);
  }
  if (useCardinalityRestrictions) {
    for (    ObjectProperty op : reasoner.getObjectProperties()) {
      int maxFillers=0;
      Map<Individual,SortedSet<Individual>> opMembers=reasoner.getPropertyMembers(op);
      for (      SortedSet<Individual> inds : opMembers.values()) {
        if (inds.size() > maxFillers)         maxFillers=inds.size();
        if (maxFillers >= cardinalityLimit) {
          maxFillers=cardinalityLimit;
          break;
        }
      }
      maxNrOfFillers.put(op,maxFillers);
    }
  }
}

Fixed version (ground truth):
public void init() throws ComponentInitException {
  if (isInitialised) {
    throw new ComponentInitException("String_Node_Str");
  }
  for (  ObjectProperty op : reasoner.getObjectProperties()) {
    opDomains.put(op,reasoner.getDomain(op));
    opRanges.put(op,reasoner.getRange(op));
    if (useHasValueConstructor) {
      Map<Individual,Integer> opMap=new TreeMap<Individual,Integer>();
      valueFrequency.put(op,opMap);
      Collection<SortedSet<Individual>> fillerSets=reasoner.getPropertyMembers(op).values();
      for (      SortedSet<Individual> fillerSet : fillerSets) {
        for (        Individual i : fillerSet) {
          Integer value=opMap.get(i);
          if (value != null) {
            opMap.put(i,value + 1);
          }
 else {
            opMap.put(i,1);
          }
        }
      }
      Set<Individual> frequentInds=new TreeSet<Individual>();
      for (      Individual i : opMap.keySet()) {
        if (opMap.get(i) >= frequencyThreshold) {
          frequentInds.add(i);
        }
      }
      frequentValues.put(op,frequentInds);
    }
  }
  for (  DatatypeProperty dp : reasoner.getDatatypeProperties()) {
    dpDomains.put(dp,reasoner.getDomain(dp));
    if (useDataHasValueConstructor) {
      Map<Constant,Integer> dpMap=new TreeMap<Constant,Integer>();
      dataValueFrequency.put(dp,dpMap);
      Collection<SortedSet<Constant>> fillerSets=reasoner.getDatatypeMembers(dp).values();
      for (      SortedSet<Constant> fillerSet : fillerSets) {
        for (        Constant i : fillerSet) {
          Integer value=dpMap.get(i);
          if (value != null) {
            dpMap.put(i,value + 1);
          }
 else {
            dpMap.put(i,1);
          }
        }
      }
      Set<Constant> frequentInds=new TreeSet<Constant>();
      for (      Constant i : dpMap.keySet()) {
        if (dpMap.get(i) >= frequencyThreshold) {
          logger.trace("String_Node_Str" + i + "String_Node_Str"+ dpMap.get(i)+ "String_Node_Str"+ frequencyThreshold);
          frequentInds.add(i);
        }
      }
      frequentDataValues.put(dp,frequentInds);
    }
  }
  valueFrequency=null;
  dataValueFrequency=null;
  System.out.println("String_Node_Str" + frequentDataValues);
  for (  DatatypeProperty dp : reasoner.getDoubleDatatypeProperties()) {
    computeSplits(dp);
  }
  if (useCardinalityRestrictions) {
    for (    ObjectProperty op : reasoner.getObjectProperties()) {
      int maxFillers=0;
      Map<Individual,SortedSet<Individual>> opMembers=reasoner.getPropertyMembers(op);
      for (      SortedSet<Individual> inds : opMembers.values()) {
        if (inds.size() > maxFillers)         maxFillers=inds.size();
        if (maxFillers >= cardinalityLimit) {
          maxFillers=cardinalityLimit;
          break;
        }
      }
      maxNrOfFillers.put(op,maxFillers);
    }
    isInitialised=true;
  }
}