| isFairCycle(int) |  | 0% |  | 0% | 21 | 21 | 43 | 43 | 1 | 1 |
| printStack(PrintStream, boolean, boolean) |  | 0% |  | 0% | 15 | 15 | 28 | 28 | 1 | 1 |
| seekFromTop() |   | 61% |   | 41% | 20 | 25 | 20 | 65 | 0 | 1 |
| writeStack(PrintStream) |  | 0% |  | 0% | 5 | 5 | 18 | 18 | 1 | 1 |
| determinePreemptibility(StackEntry, Collection, Object) |  | 0% |  | 0% | 5 | 5 | 15 | 15 | 1 | 1 |
| printStack(PrintStream) |  | 0% |  | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| proceedToNewState() |   | 67% |   | 54% | 7 | 12 | 3 | 20 | 0 | 1 |
| debugStates(String) |  | 0% |  | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| search(Object) |   | 71% |   | 66% | 2 | 4 | 5 | 18 | 0 | 1 |
| printSummary(PrintStream) |  | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| debugPrintStack(String, boolean) |   | 20% |   | 50% | 1 | 2 | 3 | 5 | 0 | 1 |
| DfsSearcher(EnablerIF, StateManager, StatePredicateIF, GMCConfiguration, PrintStream) |   | 87% |   | 50% | 3 | 4 | 3 | 32 | 0 | 1 |
| restrictDepth() |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| setDebugOut(PrintStream) |  | 0% |  | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| expand() |   | 85% |   | 62% | 3 | 5 | 1 | 22 | 0 | 1 |
| stackOutOfBound() |   | 38% |   | 25% | 2 | 3 | 0 | 1 | 0 | 1 |
| debug(String) |   | 36% |   | 50% | 1 | 2 | 2 | 4 | 0 | 1 |
| unboundDepth() |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| boundDepth(int) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| resetState(SequentialNode) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| checkStackTrace(StackEntry) |   | 83% |   | 66% | 2 | 4 | 1 | 7 | 0 | 1 |
| setName(String) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setMinimize(boolean) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setPreemptionBound(int) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setFairCycleCheck(boolean) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setReportCycleAsViolation(boolean) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| numOfSearchNodeSaved() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| search() |   | 92% |   | 83% | 1 | 4 | 1 | 9 | 0 | 1 |
| predicate() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| name() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isDepthBounded() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getMinimize() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| reportCycleAsViolation() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| fairCycleCheck() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| cycleFound() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| stack() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| debugging() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getDebugOut() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| numStatesSeen() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| numTransitions() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| numStatesMatched() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| currentState() |  | 83% |   | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| DfsSearcher(EnablerIF, StateManager, StatePredicateIF, GMCConfiguration) |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| updateMinimumStackIndex(StackEntry, int) |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| setDebugging(boolean) |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |