fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r508-tall-171654351300294
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Murphy-PT-D1N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
322.775 6723.00 15992.00 51.10 FTFFTFFTFFTFTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654351300294.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Murphy-PT-D1N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351300294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 8.4K Apr 11 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 11 22:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 22:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 23:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 23:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 23:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 23:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.6K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-00
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-01
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-02
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-03
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-04
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-05
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-06
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-07
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-08
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-09
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-10
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-11
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-12
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-13
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-14
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717235861155

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D1N010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:57:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:57:42] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-06-01 09:57:42] [INFO ] Transformed 12 places.
[2024-06-01 09:57:42] [INFO ] Transformed 14 transitions.
[2024-06-01 09:57:42] [INFO ] Parsed PT model containing 12 places and 14 transitions and 54 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40010 steps (8 resets) in 1352 ms. (29 steps per ms) remains 11/14 properties
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 299 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1138 ms. (35 steps per ms) remains 11/11 properties
// Phase 1: matrix 14 rows 12 cols
[2024-06-01 09:57:43] [INFO ] Computed 3 invariants in 7 ms
[2024-06-01 09:57:43] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem Murphy-PT-D1N010-ReachabilityCardinality-2024-02 is UNSAT
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/15 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 1 solved, 10 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/15 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/29 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 29 constraints, problems are : Problem set: 1 solved, 10 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 719ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 832 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Running 8 sub problems to find dead transitions.
[2024-06-01 09:57:45] [INFO ] Invariant cache hit.
[2024-06-01 09:57:45] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 12/12 places, 14/14 transitions.
RANDOM walk for 40010 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
Probably explored full state space saw : 39780 states, properties seen :0
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 970 ms. (steps per millisecond=317 ) properties seen :0
Explored full state space saw : 39780 states, properties seen :0
Exhaustive walk after 307764 steps, saw 39780 distinct states, run finished after 773 ms. (steps per millisecond=398 ) properties seen :0
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 5511 ms.
ITS solved all properties within timeout

BK_STOP 1717235867878

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D1N010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Murphy-PT-D1N010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654351300294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D1N010.tgz
mv Murphy-PT-D1N010 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;