@ -30,6 +30,7 @@
extern log4cplus : : Logger logger ;
extern log4cplus : : Logger logger ;
namespace storm {
namespace storm {
namespace parser {
namespace parser {
/*!
/*!
@ -44,43 +45,36 @@ namespace parser {
* @ param buf Data to scan . Is expected to be some char array .
* @ param buf Data to scan . Is expected to be some char array .
* @ param maxnode Is set to highest id of all nodes .
* @ param maxnode Is set to highest id of all nodes .
*/
*/
uint_fast64_t firstPass ( char * buf , SupportedLineEndingsEnum lineEndings , uint_fast64_t & maxnode , RewardMatrixInformationStruct * rewardMatrixInformation ) {
bool isRewardMatrix = rewardMatrixInformation ! = nullptr ;
uint_fast64_t nonZeroEntryCount = 0 ;
DeterministicSparseTransitionParser : : FirstPassResult DeterministicSparseTransitionParser : : firstPass ( char * buf , SupportedLineEndingsEnum lineEndings , bool insertDiagonalEntriesIfMissing ) {
DeterministicSparseTransitionParser : : FirstPassResult result ;
/*
* Check file header and extract number of transitions .
*/
if ( ! isRewardMatrix ) {
// skip format hint
// Skip the format hint if it is there.
buf = trimWhitespaces ( buf ) ;
if ( buf [ 0 ] ! = ' 0 ' ) {
buf = storm : : parser : : forwardToNextLine ( buf , lineEndings ) ;
buf = storm : : parser : : forwardToNextLine ( buf , lineEndings ) ;
}
}
/*
* Check all transitions for non - zero diagonal entries and deadlock states .
*/
int_fast64_t lastRow = - 1 ;
uint_fast64_t row , col ;
uint_fast64_t readTransitionCount = 0 ;
// Check all transitions for non-zero diagonal entries and deadlock states.
uint_fast64_t row , col , lastRow = 0 ;
bool rowHadDiagonalEntry = false ;
bool rowHadDiagonalEntry = false ;
double val ;
maxnode = 0 ;
while ( buf [ 0 ] ! = ' \0 ' ) {
while ( buf [ 0 ] ! = ' \0 ' ) {
/*
* Read row and column .
*/
// Read the transition..
row = checked_strtol ( buf , & buf ) ;
row = checked_strtol ( buf , & buf ) ;
col = checked_strtol ( buf , & buf ) ;
col = checked_strtol ( buf , & buf ) ;
if ( ! isRewardMatrix ) {
if ( lastRow ! = ( int_fast64_t ) row ) {
if ( ( lastRow ! = - 1 ) & & ( ! rowHadDiagonalEntry ) ) {
+ + nonZeroEntryCount ;
rowHadDiagonalEntry = true ;
// The actual read value is not needed here.
checked_strtod ( buf , & buf ) ;
// Compensate for missing diagonal entries if desired.
if ( insertDiagonalEntriesIfMissing ) {
if ( lastRow ! = row ) {
if ( ! rowHadDiagonalEntry ) {
+ + result . numberOfNonzeroEntries ;
}
}
for ( uint_fast64_t skippedRow = ( uint_fast64_t ) ( lastRow + 1 ) ; skippedRow < row ; + + skippedRow ) {
+ + nonZeroEntryCount ;
// Compensate for missing rows.
for ( uint_fast64_t skippedRow = lastRow + 1 ; skippedRow < row ; + + skippedRow ) {
+ + result . numberOfNonzeroEntries ;
}
}
lastRow = row ;
lastRow = row ;
rowHadDiagonalEntry = false ;
rowHadDiagonalEntry = false ;
@ -88,41 +82,36 @@ uint_fast64_t firstPass(char* buf, SupportedLineEndingsEnum lineEndings, uint_fa
if ( col = = row ) {
if ( col = = row ) {
rowHadDiagonalEntry = true ;
rowHadDiagonalEntry = true ;
} else if ( col > row & & ! rowHadDiagonalEntry ) {
}
if ( col > row & & ! rowHadDiagonalEntry ) {
rowHadDiagonalEntry = true ;
rowHadDiagonalEntry = true ;
+ + nonZeroEntryCount ;
+ + result . numberOfNonzeroEntries ;
}
}
}
}
/*
* Check if one is larger than the current maximum id .
*/
if ( row > maxnode ) maxnode = row ;
if ( col > maxnode ) maxnode = col ;
// Check if a higher state id was found.
if ( row > result . highestStateIndex ) result . highestStateIndex = row ;
if ( col > result . highestStateIndex ) result . highestStateIndex = col ;
/*
* Read probability of this transition .
* Check , if the value is a probability , i . e . if it is between 0 and 1.
*/
val = checked_strtod ( buf , & buf ) ;
if ( ( val < 0.0 ) | | ( val > 1.0 ) ) {
LOG4CPLUS_ERROR ( logger , " Expected a positive probability but got \" " < < val < < " \" . " ) ;
return 0 ;
}
+ + nonZeroEntryCount ;
+ + readTransitionCount ;
+ + result . numberOfNonzeroEntries ;
buf = trimWhitespaces ( buf ) ;
buf = trimWhitespaces ( buf ) ;
}
}
if ( ! rowHadDiagonalEntry & & ! isRewardMatrix ) {
+ + nonZeroEntryCount ;
if ( insertDiagonalEntriesIfMissing ) {
if ( ! rowHadDiagonalEntry ) {
+ + result . numberOfNonzeroEntries ;
}
//Compensate for missing rows at the end of the file.
for ( uint_fast64_t skippedRow = ( uint_fast64_t ) ( lastRow + 1 ) ; skippedRow < = result . highestStateIndex ; + + skippedRow ) {
+ + result . numberOfNonzeroEntries ;
}
}
}
return nonZeroEntryCount ;
return resul t;
}
}
/*!
/*!
* Reads a . tra file and produces a sparse matrix representing the described Markov Chain .
* Reads a . tra file and produces a sparse matrix representing the described Markov Chain .
*
*
@ -131,122 +120,99 @@ uint_fast64_t firstPass(char* buf, SupportedLineEndingsEnum lineEndings, uint_fa
* @ return a pointer to the created sparse matrix .
* @ return a pointer to the created sparse matrix .
*/
*/
storm : : storage : : SparseMatrix < double > DeterministicSparseTransitionParser ( std : : string const & filename , bool insertDiagonalEntriesIfMissing , RewardMatrixInformationStruct * rewardMatrixInformation ) {
/*
* Enforce locale where decimal point is ' . ' .
*/
setlocale ( LC_NUMERIC , " C " ) ;
storm : : storage : : SparseMatrix < double > DeterministicSparseTransitionParser : : parseDeterministicTransitions ( std : : string const & filename , bool insertDiagonalEntriesIfMissing ) {
bool isRewardMatrix = rewardMatrixInformation ! = nullptr ;
// Enforce locale where decimal point is '.'.
setlocale ( LC_NUMERIC , " C " ) ;
if ( ! fileExistsAndIsReadable ( filename . c_str ( ) ) ) {
if ( ! fileExistsAndIsReadable ( filename . c_str ( ) ) ) {
LOG4CPLUS_ERROR ( logger , " Error while parsing " < < filename < < " : File does not exist or is not readable. " ) ;
LOG4CPLUS_ERROR ( logger , " Error while parsing " < < filename < < " : File does not exist or is not readable. " ) ;
throw storm : : exceptions : : FileIoException ( ) < < " The supplied Transition input file \" " < < filename < < " \" does not exist or is not readable by this process. " ;
throw storm : : exceptions : : FileIoException ( ) < < " The supplied Transition input file \" " < < filename < < " \" does not exist or is not readable by this process. " ;
}
}
/*
* Find out about the used line endings .
*/
// Find out about the used line endings.
SupportedLineEndingsEnum lineEndings = findUsedLineEndings ( filename , true ) ;
SupportedLineEndingsEnum lineEndings = findUsedLineEndings ( filename , true ) ;
/*
* Open file .
*/
// Open file.
MappedFile file ( filename . c_str ( ) ) ;
MappedFile file ( filename . c_str ( ) ) ;
char * buf = file . data ;
char * buf = file . data ;
/*
* Perform first pass , i . e . count entries that are not zero .
*/
uint_fast64_t maxStateId ;
uint_fast64_t nonZeroEntryCount = firstPass ( file . data , lineEndings , maxStateId , rewardMatrixInformation ) ;
// Perform first pass, i.e. count entries that are not zero.
LOG4CPLUS_INFO ( logger , " First pass on " < < filename < < " shows " < < nonZeroEntryCount < < " NonZeros. " ) ;
DeterministicSparseTransitionParser : : FirstPassResult firstPass = DeterministicSparseTransitionParser : : firstPass ( file . data , lineEndings , insertDiagonalEntriesIfMissing ) ;
/*
* If first pass returned zero , the file format was wrong .
*/
if ( nonZeroEntryCount = = 0 ) {
LOG4CPLUS_ERROR ( logger , " Error while parsing " < < filename < < " : erroneous file format. " ) ;
LOG4CPLUS_INFO ( logger , " First pass on " < < filename < < " shows " < < firstPass . numberOfNonzeroEntries < < " NonZeros. " ) ;
// If first pass returned zero, the file format was wrong.
if ( firstPass . numberOfNonzeroEntries = = 0 ) {
LOG4CPLUS_ERROR ( logger , " Error while parsing " < < filename < < " : empty or e rroneous file format. " ) ;
throw storm : : exceptions : : WrongFormatException ( ) ;
throw storm : : exceptions : : WrongFormatException ( ) ;
}
}
/*
* Perform second pass -
*
* From here on , we already know that the file header is correct .
*/
/*
* Read file header , extract number of states .
*/
if ( ! isRewardMatrix ) {
// skip format hint
buf = storm : : parser : : forwardToNextLine ( buf , lineEndings ) ;
}
// Perform second pass.
// If the matrix that is being parsed is a reward matrix, it should match the size of the
// transition matrix.
if ( isRewardMatrix ) {
if ( maxStateId + 1 > rewardMatrixInformation - > rowCount | | maxStateId + 1 > rewardMatrixInformation - > columnCount ) {
LOG4CPLUS_ERROR ( logger , " Reward matrix has more rows or columns than transition matrix. " ) ;
throw storm : : exceptions : : WrongFormatException ( ) < < " Reward matrix has more rows or columns than transition matrix. " ;
} else {
maxStateId = rewardMatrixInformation - > rowCount - 1 ;
}
// Skip the format hint if it is there.
buf = trimWhitespaces ( buf ) ;
if ( buf [ 0 ] ! = ' 0 ' ) {
buf = storm : : parser : : forwardToNextLine ( buf , lineEndings ) ;
}
}
/*
* Creating matrix here .
* The number of non - zero elements is computed by firstPass ( ) .
*/
LOG4CPLUS_INFO ( logger , " Attempting to create matrix of size " < < ( maxStateId + 1 ) < < " x " < < ( maxStateId + 1 ) < < " . " ) ;
storm : : storage : : SparseMatrix < double > resultMatrix ( maxStateId + 1 ) ;
resultMatrix . initialize ( nonZeroEntryCount ) ;
// Creating matrix here.
// The number of non-zero elements is computed by firstPass().
LOG4CPLUS_INFO ( logger , " Attempting to create matrix of size " < < ( firstPass . highestStateIndex + 1 ) < < " x " < < ( firstPass . highestStateIndex + 1 ) < < " . " ) ;
storm : : storage : : SparseMatrix < double > resultMatrix ( firstPass . highestStateIndex + 1 ) ;
resultMatrix . initialize ( firstPass . numberOfNonzeroEntries ) ;
if ( ! resultMatrix . isInitialized ( ) ) {
if ( ! resultMatrix . isInitialized ( ) ) {
LOG4CPLUS_ERROR ( logger , " Could not create matrix of size " < < ( maxStateId + 1 ) < < " x " < < ( maxStateId + 1 ) < < " . " ) ;
LOG4CPLUS_ERROR ( logger , " Could not create matrix of size " < < ( firstPass . highestStateIndex + 1 ) < < " x " < < ( firstPass . highestStateIndex + 1 ) < < " . " ) ;
throw std : : bad_alloc ( ) ;
throw std : : bad_alloc ( ) ;
}
}
int_fast64_t row , lastRow = - 1 , col ;
u int_fast64_t row , col , lastRow = 0 ;
double val ;
double val ;
bool fixDeadlocks = storm : : settings : : Settings : : getInstance ( ) - > isSet ( " fixDeadlocks " ) ;
bool fixDeadlocks = storm : : settings : : Settings : : getInstance ( ) - > isSet ( " fixDeadlocks " ) ;
bool hadDeadlocks = false ;
bool hadDeadlocks = false ;
bool rowHadDiagonalEntry = false ;
bool rowHadDiagonalEntry = false ;
/*
* Read all transitions from file . Note that we assume that the
* transitions are listed in canonical order , otherwise this will not
* work , i . e . the values in the matrix will be at wrong places .
*/
// Read all transitions from file. Note that we assume that the
// transitions are listed in canonical order, otherwise this will not
// work, i.e. the values in the matrix will be at wrong places.
while ( buf [ 0 ] ! = ' \0 ' ) {
while ( buf [ 0 ] ! = ' \0 ' ) {
/*
* Read row , col and value .
*/
// Read next transition.
row = checked_strtol ( buf , & buf ) ;
row = checked_strtol ( buf , & buf ) ;
col = checked_strtol ( buf , & buf ) ;
col = checked_strtol ( buf , & buf ) ;
val = checked_strtod ( buf , & buf ) ;
val = checked_strtod ( buf , & buf ) ;
// Read probability of this transition.
// Check, if the value is a probability, i.e. if it is between 0 and 1.
if ( ( val < 0.0 ) | | ( val > 1.0 ) ) {
LOG4CPLUS_ERROR ( logger , " Expected a positive probability but got \" " < < val < < " \" . " ) ;
throw storm : : exceptions : : WrongFormatException ( ) ;
}
// Test if we moved to a new row.
// Handle all incomplete or skipped rows.
if ( lastRow ! = row ) {
if ( lastRow ! = row ) {
if ( ( lastRow ! = - 1 ) & & ( ! rowHadDiagonalEntry ) ) {
if ( insertDiagonalEntriesIfMissing & & ! isRewardMatrix ) {
if ( ! rowHadDiagonalEntry ) {
if ( insertDiagonalEntriesIfMissing ) {
resultMatrix . addNextValue ( lastRow , lastRow , storm : : utility : : constGetZero < double > ( ) ) ;
resultMatrix . addNextValue ( lastRow , lastRow , storm : : utility : : constGetZero < double > ( ) ) ;
LOG4CPLUS_DEBUG ( logger , " While parsing " < < filename < < " : state " < < lastRow < < " has no transition to itself. Inserted a 0-transition. (1) " ) ;
LOG4CPLUS_DEBUG ( logger , " While parsing " < < filename < < " : state " < < lastRow < < " has no transition to itself. Inserted a 0-transition. (1) " ) ;
} else if ( ! isRewardMatrix ) {
} else {
LOG4CPLUS_WARN ( logger , " Warning while parsing " < < filename < < " : state " < < lastRow < < " has no transition to itself. " ) ;
LOG4CPLUS_WARN ( logger , " Warning while parsing " < < filename < < " : state " < < lastRow < < " has no transition to itself. " ) ;
}
}
// No increment for lastRow
// No increment for lastRow.
rowHadDiagonalEntry = true ;
rowHadDiagonalEntry = true ;
}
}
for ( int_fast64_t skippedRow = lastRow + 1 ; skippedRow < row ; + + skippedRow ) {
for ( u int_fast64_t skippedRow = lastRow + 1 ; skippedRow < row ; + + skippedRow ) {
hadDeadlocks = true ;
hadDeadlocks = true ;
if ( fixDeadlocks & & ! isRewardMatrix ) {
if ( fixDeadlocks ) {
resultMatrix . addNextValue ( skippedRow , skippedRow , storm : : utility : : constGetOne < double > ( ) ) ;
resultMatrix . addNextValue ( skippedRow , skippedRow , storm : : utility : : constGetOne < double > ( ) ) ;
rowHadDiagonalEntry = true ;
rowHadDiagonalEntry = true ;
LOG4CPLUS_WARN ( logger , " Warning while parsing " < < filename < < " : state " < < skippedRow < < " has no outgoing transitions. A self-loop was inserted. " ) ;
LOG4CPLUS_WARN ( logger , " Warning while parsing " < < filename < < " : state " < < skippedRow < < " has no outgoing transitions. A self-loop was inserted. " ) ;
} else if ( ! isRewardMatrix ) {
} else {
LOG4CPLUS_ERROR ( logger , " Error while parsing " < < filename < < " : state " < < skippedRow < < " has no outgoing transitions. " ) ;
LOG4CPLUS_ERROR ( logger , " Error while parsing " < < filename < < " : state " < < skippedRow < < " has no outgoing transitions. " ) ;
// FIXME Why no exception at this point? This will break the App .
// Before throwing the appropriate exception we will give notice of all deadlock states .
}
}
}
}
lastRow = row ;
lastRow = row ;
@ -255,14 +221,16 @@ storm::storage::SparseMatrix<double> DeterministicSparseTransitionParser(std::st
if ( col = = row ) {
if ( col = = row ) {
rowHadDiagonalEntry = true ;
rowHadDiagonalEntry = true ;
} else if ( col > row & & ! rowHadDiagonalEntry ) {
rowHadDiagonalEntry = true ;
if ( insertDiagonalEntriesIfMissing & & ! isRewardMatrix ) {
}
if ( col > row & & ! rowHadDiagonalEntry ) {
if ( insertDiagonalEntriesIfMissing ) {
resultMatrix . addNextValue ( row , row , storm : : utility : : constGetZero < double > ( ) ) ;
resultMatrix . addNextValue ( row , row , storm : : utility : : constGetZero < double > ( ) ) ;
LOG4CPLUS_DEBUG ( logger , " While parsing " < < filename < < " : state " < < row < < " has no transition to itself. Inserted a 0-transition. (2) " ) ;
LOG4CPLUS_DEBUG ( logger , " While parsing " < < filename < < " : state " < < row < < " has no transition to itself. Inserted a 0-transition. (2) " ) ;
} else if ( ! isRewardMatrix ) {
} else {
LOG4CPLUS_WARN ( logger , " Warning while parsing " < < filename < < " : state " < < row < < " has no transition to itself. " ) ;
LOG4CPLUS_WARN ( logger , " Warning while parsing " < < filename < < " : state " < < row < < " has no transition to itself. " ) ;
}
}
rowHadDiagonalEntry = true ;
}
}
resultMatrix . addNextValue ( row , col , val ) ;
resultMatrix . addNextValue ( row , col , val ) ;
@ -270,23 +238,110 @@ storm::storage::SparseMatrix<double> DeterministicSparseTransitionParser(std::st
}
}
if ( ! rowHadDiagonalEntry ) {
if ( ! rowHadDiagonalEntry ) {
if ( insertDiagonalEntriesIfMissing & & ! isRewardMatrix ) {
if ( insertDiagonalEntriesIfMissing ) {
resultMatrix . addNextValue ( lastRow , lastRow , storm : : utility : : constGetZero < double > ( ) ) ;
resultMatrix . addNextValue ( lastRow , lastRow , storm : : utility : : constGetZero < double > ( ) ) ;
LOG4CPLUS_DEBUG ( logger , " While parsing " < < filename < < " : state " < < lastRow < < " has no transition to itself. Inserted a 0-transition. (3) " ) ;
LOG4CPLUS_DEBUG ( logger , " While parsing " < < filename < < " : state " < < lastRow < < " has no transition to itself. Inserted a 0-transition. (3) " ) ;
} else if ( ! isRewardMatrix ) {
} else {
LOG4CPLUS_WARN ( logger , " Warning while parsing " < < filename < < " : state " < < lastRow < < " has no transition to itself. " ) ;
LOG4CPLUS_WARN ( logger , " Warning while parsing " < < filename < < " : state " < < lastRow < < " has no transition to itself. " ) ;
}
}
}
}
// If we encountered deadlock and did not fix them, now is the time to throw the exception.
if ( ! fixDeadlocks & & hadDeadlocks ) throw storm : : exceptions : : WrongFormatException ( ) < < " Some of the nodes had deadlocks. You can use --fixDeadlocks to insert self-loops on the fly. " ;
if ( ! fixDeadlocks & & hadDeadlocks ) throw storm : : exceptions : : WrongFormatException ( ) < < " Some of the nodes had deadlocks. You can use --fixDeadlocks to insert self-loops on the fly. " ;
/*
* Finalize Matrix .
*/
// Finalize Matrix.
resultMatrix . finalize ( ) ;
return resultMatrix ;
}
/*!
* Reads a . tra file and produces a sparse matrix representing the described Markov Chain .
*
* Matrices created with this method have to be freed with the delete operator .
* @ param filename input . tra file ' s name .
* @ return a pointer to the created sparse matrix .
*/
storm : : storage : : SparseMatrix < double > DeterministicSparseTransitionParser : : parseDeterministicTransitionRewards ( std : : string const & filename , RewardMatrixInformationStruct const & rewardMatrixInformation ) {
// Enforce locale where decimal point is '.'.
setlocale ( LC_NUMERIC , " C " ) ;
if ( ! fileExistsAndIsReadable ( filename . c_str ( ) ) ) {
LOG4CPLUS_ERROR ( logger , " Error while parsing " < < filename < < " : File does not exist or is not readable. " ) ;
throw storm : : exceptions : : FileIoException ( ) < < " The supplied Transition input file \" " < < filename < < " \" does not exist or is not readable by this process. " ;
}
// Find out about the used line endings.
SupportedLineEndingsEnum lineEndings = findUsedLineEndings ( filename , true ) ;
// Open file.
MappedFile file ( filename . c_str ( ) ) ;
char * buf = file . data ;
// Perform first pass, i.e. count entries that are not zero.
DeterministicSparseTransitionParser : : FirstPassResult firstPass = DeterministicSparseTransitionParser : : firstPass ( file . data , lineEndings , false ) ;
LOG4CPLUS_INFO ( logger , " First pass on " < < filename < < " shows " < < firstPass . numberOfNonzeroEntries < < " NonZeros. " ) ;
// If first pass returned zero, the file format was wrong.
if ( firstPass . numberOfNonzeroEntries = = 0 ) {
LOG4CPLUS_ERROR ( logger , " Error while parsing " < < filename < < " : empty or erroneous file format. " ) ;
throw storm : : exceptions : : WrongFormatException ( ) ;
}
// Perform second pass.
// Skip the format hint if it is there.
buf = trimWhitespaces ( buf ) ;
if ( buf [ 0 ] ! = ' 0 ' ) {
buf = storm : : parser : : forwardToNextLine ( buf , lineEndings ) ;
}
// The reward matrix should match the size of the transition matrix.
if ( firstPass . highestStateIndex + 1 > rewardMatrixInformation . rowCount | | firstPass . highestStateIndex + 1 > rewardMatrixInformation . columnCount ) {
LOG4CPLUS_ERROR ( logger , " Reward matrix has more rows or columns than transition matrix. " ) ;
throw storm : : exceptions : : WrongFormatException ( ) < < " Reward matrix has more rows or columns than transition matrix. " ;
} else {
// If we found the right number of states or less, we set it to the number of states represented by the transition matrix.
firstPass . highestStateIndex = rewardMatrixInformation . rowCount - 1 ;
}
// Creating matrix here.
// The number of non-zero elements is computed by firstPass().
LOG4CPLUS_INFO ( logger , " Attempting to create matrix of size " < < ( firstPass . highestStateIndex + 1 ) < < " x " < < ( firstPass . highestStateIndex + 1 ) < < " . " ) ;
storm : : storage : : SparseMatrix < double > resultMatrix ( firstPass . highestStateIndex + 1 ) ;
resultMatrix . initialize ( firstPass . numberOfNonzeroEntries ) ;
if ( ! resultMatrix . isInitialized ( ) ) {
LOG4CPLUS_ERROR ( logger , " Could not create matrix of size " < < ( firstPass . highestStateIndex + 1 ) < < " x " < < ( firstPass . highestStateIndex + 1 ) < < " . " ) ;
throw std : : bad_alloc ( ) ;
}
uint_fast64_t row , col ;
double val ;
// Read all transitions from file. Note that we assume that the
// transitions are listed in canonical order, otherwise this will not
// work, i.e. the values in the matrix will be at wrong places.
while ( buf [ 0 ] ! = ' \0 ' ) {
// Read next transition.
row = checked_strtol ( buf , & buf ) ;
col = checked_strtol ( buf , & buf ) ;
val = checked_strtod ( buf , & buf ) ;
resultMatrix . addNextValue ( row , col , val ) ;
buf = trimWhitespaces ( buf ) ;
}
// Finalize Matrix.
resultMatrix . finalize ( ) ;
resultMatrix . finalize ( ) ;
return resultMatrix ;
return resultMatrix ;
}
}
} // namespace parser
} // namespace parser
} // namespace storm
} // namespace storm