Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482800478.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DES-PT-50a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482800478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 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 DES-PT-50a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678405028096

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 23:37:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 23:37:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:37:09] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-09 23:37:09] [INFO ] Transformed 314 places.
[2023-03-09 23:37:09] [INFO ] Transformed 271 transitions.
[2023-03-09 23:37:09] [INFO ] Found NUPN structural information;
[2023-03-09 23:37:09] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 221 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 11) seen :5
FORMULA DES-PT-50a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 257 rows 314 cols
[2023-03-09 23:37:10] [INFO ] Computed 59 place invariants in 30 ms
[2023-03-09 23:37:10] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:37:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-09 23:37:10] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:37:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 23:37:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 71 ms returned sat
[2023-03-09 23:37:13] [INFO ] After 2285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 23:37:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:37:14] [INFO ] After 1046ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 23:37:14] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 3 ms to minimize.
[2023-03-09 23:37:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-09 23:37:16] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2023-03-09 23:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-09 23:37:17] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2023-03-09 23:37:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 23:37:17] [INFO ] After 3666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 5999 ms.
[2023-03-09 23:37:23] [INFO ] After 12296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA DES-PT-50a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 191 ms.
Support contains 20 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 313 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 313 transition count 255
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 313 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 312 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 311 transition count 254
Applied a total of 9 rules in 94 ms. Remains 311 /314 variables (removed 3) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 311/314 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1637415 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :{}
Probabilistic random walk after 1637415 steps, saw 211030 distinct states, run finished after 3003 ms. (steps per millisecond=545 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 311 cols
[2023-03-09 23:37:26] [INFO ] Computed 59 place invariants in 14 ms
[2023-03-09 23:37:26] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:37:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:37:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 63 ms returned sat
[2023-03-09 23:37:27] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:37:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:27] [INFO ] After 94ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:37:27] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-09 23:37:27] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 20 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 254/254 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 311/311 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 254/254 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-09 23:37:27] [INFO ] Invariant cache hit.
[2023-03-09 23:37:27] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-09 23:37:27] [INFO ] Invariant cache hit.
[2023-03-09 23:37:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:28] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2023-03-09 23:37:28] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-09 23:37:28] [INFO ] Invariant cache hit.
[2023-03-09 23:37:28] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 815 ms. Remains : 311/311 places, 254/254 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 23:37:28] [INFO ] Invariant cache hit.
[2023-03-09 23:37:28] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:37:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:37:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 41 ms returned sat
[2023-03-09 23:37:29] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:37:29] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-09 23:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 23:37:29] [INFO ] After 626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-09 23:37:29] [INFO ] After 893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:37:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-09 23:37:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 311 places, 254 transitions and 1210 arcs took 4 ms.
[2023-03-09 23:37:29] [INFO ] Flatten gal took : 56 ms
Total runtime 19960 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DES_PT_50a
(NrP: 311 NrTr: 254 NrArc: 1210)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec

net check time: 0m 0.000sec

init dd package: 0m 2.776sec


before gc: list nodes free: 711715

after gc: idd nodes used:788141, unused:63211859; list nodes free:287907069
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6163588 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098752 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

610171 1212868 1240259

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="DES-PT-50a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is DES-PT-50a, 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 r106-tall-167814482800478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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