anchor.diff:          if CGraph.isInside n then pairs <- Set.add (n.Node.Loc, p.Node.Loc) pairs
       (nodes, pairs)
     
  -  let configureIncomingTraffic cg : IncomingExportMap = 
  +  let configureIncomingTraffic cg (ord : Consistency.Ordering) : IncomingExportMap = 
       let settings = Args.getSettings()
       let info = collectIncomingInfo cg
       let preferences = Seq.map (fun p -> (p, Reachable.srcAccepting cg p Down)) info.Peers
  
positive.code:                 | None -> ()
                  | Some v -> raise (UncontrollablePeerPreferenceException p1.Node.Loc)
              // preferences for different peers must be implementable from internal preferences
              // TODO: use inferred preferences rather than exact
              if not (bestCasePrefs.[p1] > worstCasePrefs.[p2]) then 
                if p1.Node.Loc <> p2.Node.Loc then 
                  raise (UncontrollablePeerPreferenceException p1.Node.Loc)
          let mutable actions = []
  
negative.code:       let msg = sprintf "Unused preference %d policy " i + sprintf "for predicate %s" predStr
        warning msg) unusedPrefs
    try 
      // check aggregation failure consistency
      let k = getMinAggregateFailures cg pred aggInfo
      // check that there is a valid ordering for BGP preferences to ensure compliance
      let (ordering, orderTime) = Profile.time (Consistency.findOrderingConservative idx) cg
      match ordering with
      | Ok ord -> 
        // check that BGP can ensure incoming traffic compliance
        let inExports = Incoming.configureIncomingTraffic cg ord
        let config, configTime = Profile.time (genConfig cg pred ord) inExports
        
        let result = 
  