.\" Manual page for lpsconfcheck version 201409.0 (Release). .\"
.\" Generated from lpsconfcheck --generate-man-page. .\"
.TH LPSCONFCHECK "1" "September 2017" "lpsconfcheck mCRL2 toolset 201409.0 (Release)" "User Commands"
.SH NAME
lpsconfcheck \- mark confluent tau-summands of an LPS
.SH SYNOPSIS
.B lpsconfcheck
[\fIOPTION\fR]... [\fIINFILE\fR [\fIOUTFILE\fR]]
.SH DESCRIPTION
Checks which tau-summands of the mCRL2 LPS in INFILE are confluent, marks them 
by renaming them to ctau, and write the result to OUTFILE. If INFILE is not 
present stdin is used. If OUTFILE is not present, stdout is used.
.SH OPTIONS
.TP
\fIOPTION\fR can be any of the following:
.TP
\fB-a\fR, \fB--check-all\fR
check the confluence of tau-summands regarding all other summands, instead of 
continuing with the next tau-summand as soon as a summand is encountered that 
is not confluent with the current tau-summand
.TP
\fB-c\fR, \fB--counter-example\fR
display a valuation for which the confluence condition does not hold, in case 
the encountered condition is neither a contradiction nor a tautolgy
.TP
\fB-g\fR, \fB--generate-invariants\fR
try to prove that the reduced confluence condition is an invariant of the LPS, 
in case the confluence condition is not a tautology
.TP
\fB-o\fR, \fB--induction\fR
apply induction on lists
.TP
\fB-i\fR\fIINVFILE\fR, \fB--invariant\fR=\fIINVFILE\fR
use the boolean formula (an mCRL2 data expression of sort Bool) in INVFILE as 
invariant
.TP
\fB-n\fR, \fB--no-check\fR
do not check if the invariant holds before checking for for confluence
.TP
\fB-m\fR, \fB--no-marking\fR
do not mark the confluent tau-summands; since there are no changes made to the 
LPS, nothing is written to OUTFILE
.TP
\fB-p\fR\fIPREFIX\fR, \fB--print-dot\fR=\fIPREFIX\fR
save a \&.dot file of the resulting BDD in case two summands cannot be proven 
confluent; PREFIX will be used as prefix of the output files
.TP
\fB-Q\fR\fINUM\fR, \fB--qlimit\fR=\fINUM\fR
limit enumeration of quantifiers to NUM variables\&. (Default NUM=1000, NUM=0 for 
unlimited)\&.
.TP
\fB-r\fR\fINAME\fR, \fB--rewriter\fR=\fINAME\fR
use rewrite strategy NAME:
\&'jitty\&' jitty rewriting (default)
\&'jittyc\&' compiled jitty rewriting
\&'jittyp\&' jitty rewriting with prover
.TP
\fB-z\fR\fISOLVER\fR, \fB--smt-solver\fR=\fISOLVER\fR
use SOLVER to remove inconsistent paths from the internally used BDDs (by 
default, no path elimination is applied):
\&'cvc\&' the SMT solver CVC3
.TP
\fB-s\fR\fINUM\fR, \fB--summand\fR=\fINUM\fR
eliminate or simplify the summand with number NUM only
.TP
\fB-t\fR\fILIMIT\fR, \fB--time-limit\fR=\fILIMIT\fR
spend at most LIMIT seconds on proving a single formula
.TP
\fB--timings\fR[=\fIFILE\fR]
append timing measurements to FILE\&. Measurements are written to standard error 
if no FILE is provided
.TP
Standard options:
.TP
\fB-q\fR, \fB--quiet\fR
do not display warning messages
.TP
\fB-v\fR, \fB--verbose\fR
display short intermediate messages
.TP
\fB-d\fR, \fB--debug\fR
display detailed intermediate messages
.TP
\fB--log-level\fR=\fILEVEL\fR
display intermediate messages up to and including level
.TP
\fB-h\fR, \fB--help\fR
display help information
.TP
\fB--version\fR
display version information

.SH AUTHOR
Written by Luc Engelen.
.SH "REPORTING BUGS"
Report bugs at <http://www.mcrl2.org/issuetracker>.
.SH COPYRIGHT
Copyright \(co 2014 Technische Universiteit Eindhoven.
.br
This is free software.  You may redistribute copies of it under the
terms of the Boost Software License <http://www.boost.org/LICENSE_1_0.txt>.
There is NO WARRANTY, to the extent permitted by law.
.SH "SEE ALSO"
See also the manual at <http://www.mcrl2.org/release/user_manual/tools/lpsconfcheck.html>.