diff --git a/src/builder/DftExplorationHeuristic.cpp b/src/builder/DftExplorationHeuristic.cpp index 74937d4b1..727c29c37 100644 --- a/src/builder/DftExplorationHeuristic.cpp +++ b/src/builder/DftExplorationHeuristic.cpp @@ -44,9 +44,7 @@ namespace storm { template void DFTExplorationHeuristic::setHeuristicValues(size_t depth, ValueType rate, ValueType exitRate) { - std::cout << "Set priority: " << depth << ", old: " << this->depth << std::endl; this->depth = depth; - // TODO Matthias: update rates and exitRates as well this->rate = rate; this->exitRate = exitRate; } diff --git a/src/builder/ExplicitDFTModelBuilderApprox.cpp b/src/builder/ExplicitDFTModelBuilderApprox.cpp index 9ed09eccb..0bf848838 100644 --- a/src/builder/ExplicitDFTModelBuilderApprox.cpp +++ b/src/builder/ExplicitDFTModelBuilderApprox.cpp @@ -412,7 +412,7 @@ namespace storm { void ExplicitDFTModelBuilderApprox::changeMatrixLowerBound(storm::storage::SparseMatrix & matrix) const { // Set lower bound for skipped states for (auto it = skippedStates.begin(); it != skippedStates.end(); ++it) { - auto matrixEntry = matrix.getRow(it->first).begin(); + auto matrixEntry = matrix.getRow(it->first, 0).begin(); STORM_LOG_ASSERT(matrixEntry->getColumn() == failedStateId, "Transition has wrong target state."); // Get the lower bound by considering the failure of the BE with the highest rate // The list is sorted by rate, therefore we consider the first BE for the highest failure rate @@ -424,7 +424,7 @@ namespace storm { void ExplicitDFTModelBuilderApprox::changeMatrixUpperBound(storm::storage::SparseMatrix & matrix) const { // Set uppper bound for skipped states for (auto it = skippedStates.begin(); it != skippedStates.end(); ++it) { - auto matrixEntry = matrix.getRow(it->first).begin(); + auto matrixEntry = matrix.getRow(it->first, 0).begin(); STORM_LOG_ASSERT(matrixEntry->getColumn() == failedStateId, "Transition has wrong target state."); // Get the upper bound by considering the failure of all BEs // The used formula for the rate is 1/( 1/a + 1/b + ...)