Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913900454.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 47K Mar 24 05:37 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 BusinessProcesses-PT-01-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591156241853

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:50:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:50:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:50:46] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2020-06-03 03:50:46] [INFO ] Transformed 200 places.
[2020-06-03 03:50:46] [INFO ] Transformed 178 transitions.
[2020-06-03 03:50:46] [INFO ] Found NUPN structural information;
[2020-06-03 03:50:46] [INFO ] Parsed PT model containing 200 places and 178 transitions in 102 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 112 resets, run finished after 72 ms. (steps per millisecond=138 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0]
// Phase 1: matrix 177 rows 199 cols
[2020-06-03 03:50:46] [INFO ] Computed 30 place invariants in 10 ms
[2020-06-03 03:50:47] [INFO ] [Real]Absence check using 20 positive place invariants in 37 ms returned sat
[2020-06-03 03:50:47] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 16 ms returned sat
[2020-06-03 03:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:47] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2020-06-03 03:50:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:50:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 43 ms returned sat
[2020-06-03 03:50:47] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 8 ms returned sat
[2020-06-03 03:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:47] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2020-06-03 03:50:48] [INFO ] Deduced a trap composed of 24 places in 182 ms
[2020-06-03 03:50:48] [INFO ] Deduced a trap composed of 9 places in 237 ms
[2020-06-03 03:50:48] [INFO ] Deduced a trap composed of 25 places in 292 ms
[2020-06-03 03:50:48] [INFO ] Deduced a trap composed of 53 places in 214 ms
[2020-06-03 03:50:49] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2020-06-03 03:50:49] [INFO ] Deduced a trap composed of 57 places in 543 ms
[2020-06-03 03:50:49] [INFO ] Deduced a trap composed of 14 places in 92 ms
[2020-06-03 03:50:49] [INFO ] Deduced a trap composed of 51 places in 72 ms
[2020-06-03 03:50:49] [INFO ] Deduced a trap composed of 51 places in 82 ms
[2020-06-03 03:50:50] [INFO ] Deduced a trap composed of 24 places in 113 ms
[2020-06-03 03:50:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2140 ms
[2020-06-03 03:50:50] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 16 ms.
[2020-06-03 03:50:50] [INFO ] Added : 126 causal constraints over 26 iterations in 661 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 03:50:50] [INFO ] [Real]Absence check using 20 positive place invariants in 38 ms returned sat
[2020-06-03 03:50:50] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 37 ms returned sat
[2020-06-03 03:50:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:51] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-06-03 03:50:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:50:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 34 ms returned sat
[2020-06-03 03:50:51] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-06-03 03:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:51] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-06-03 03:50:51] [INFO ] Deduced a trap composed of 9 places in 264 ms
[2020-06-03 03:50:51] [INFO ] Deduced a trap composed of 24 places in 155 ms
[2020-06-03 03:50:51] [INFO ] Deduced a trap composed of 56 places in 182 ms
[2020-06-03 03:50:52] [INFO ] Deduced a trap composed of 8 places in 117 ms
[2020-06-03 03:50:52] [INFO ] Deduced a trap composed of 52 places in 76 ms
[2020-06-03 03:50:52] [INFO ] Deduced a trap composed of 15 places in 108 ms
[2020-06-03 03:50:52] [INFO ] Deduced a trap composed of 50 places in 106 ms
[2020-06-03 03:50:52] [INFO ] Deduced a trap composed of 25 places in 118 ms
[2020-06-03 03:50:52] [INFO ] Deduced a trap composed of 26 places in 115 ms
[2020-06-03 03:50:52] [INFO ] Deduced a trap composed of 25 places in 125 ms
[2020-06-03 03:50:52] [INFO ] Deduced a trap composed of 24 places in 109 ms
[2020-06-03 03:50:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1650 ms
[2020-06-03 03:50:52] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 11 ms.
[2020-06-03 03:50:53] [INFO ] Added : 116 causal constraints over 24 iterations in 415 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 03:50:53] [INFO ] [Real]Absence check using 20 positive place invariants in 131 ms returned sat
[2020-06-03 03:50:53] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 28 ms returned sat
[2020-06-03 03:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:53] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-03 03:50:53] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-06-03 03:50:53] [INFO ] Deduced a trap composed of 15 places in 102 ms
[2020-06-03 03:50:54] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2020-06-03 03:50:54] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-06-03 03:50:54] [INFO ] Deduced a trap composed of 14 places in 48 ms
[2020-06-03 03:50:54] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2020-06-03 03:50:54] [INFO ] Deduced a trap composed of 12 places in 139 ms
[2020-06-03 03:50:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 608 ms
[2020-06-03 03:50:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:50:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 91 ms returned sat
[2020-06-03 03:50:54] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 6 ms returned sat
[2020-06-03 03:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:54] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-06-03 03:50:54] [INFO ] Deduced a trap composed of 9 places in 174 ms
[2020-06-03 03:50:54] [INFO ] Deduced a trap composed of 8 places in 103 ms
[2020-06-03 03:50:55] [INFO ] Deduced a trap composed of 53 places in 162 ms
[2020-06-03 03:50:55] [INFO ] Deduced a trap composed of 32 places in 35 ms
[2020-06-03 03:50:55] [INFO ] Deduced a trap composed of 14 places in 36 ms
[2020-06-03 03:50:55] [INFO ] Deduced a trap composed of 40 places in 59 ms
[2020-06-03 03:50:55] [INFO ] Deduced a trap composed of 21 places in 59 ms
[2020-06-03 03:50:55] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-06-03 03:50:55] [INFO ] Deduced a trap composed of 14 places in 125 ms
[2020-06-03 03:50:56] [INFO ] Deduced a trap composed of 28 places in 712 ms
[2020-06-03 03:50:56] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2020-06-03 03:50:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1806 ms
[2020-06-03 03:50:56] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 19 ms.
[2020-06-03 03:50:57] [INFO ] Added : 126 causal constraints over 26 iterations in 567 ms. Result :sat
[2020-06-03 03:50:57] [INFO ] Deduced a trap composed of 54 places in 44 ms
[2020-06-03 03:50:57] [INFO ] Deduced a trap composed of 55 places in 599 ms
[2020-06-03 03:50:57] [INFO ] Deduced a trap composed of 51 places in 82 ms
[2020-06-03 03:50:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 803 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 15000 steps, including 226 resets, run finished after 26 ms. (steps per millisecond=576 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11500 steps, including 149 resets, run finished after 16 ms. (steps per millisecond=718 ) properties seen :[0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 13700 steps, including 241 resets, run finished after 18 ms. (steps per millisecond=761 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 199/199 places, 177/177 transitions.
Graph (trivial) has 121 edges and 199 vertex of which 8 / 199 are part of one of the 1 SCC in 22 ms
Free SCC test removed 7 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 372 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.18 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 189 transition count 121
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 102 place count 144 transition count 121
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 102 place count 144 transition count 95
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 160 place count 112 transition count 95
Symmetric choice reduction at 2 with 25 rule applications. Total rules 185 place count 112 transition count 95
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 25 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 235 place count 87 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 235 place count 87 transition count 68
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 239 place count 85 transition count 68
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 299 place count 55 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 301 place count 54 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 302 place count 54 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 53 transition count 40
Applied a total of 303 rules in 119 ms. Remains 53 /199 variables (removed 146) and now considering 40/177 (removed 137) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/199 places, 40/177 transitions.
Finished random walk after 15553 steps, including 1303 resets, run visited all 1 properties in 27 ms. (steps per millisecond=576 )
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="BusinessProcesses-PT-01"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-01, 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 r182-oct2-158987913900454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 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 ;