Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918400358.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 itstools
Input is BusinessProcesses-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 23:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 29 23:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 29 23:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 29 23:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 85K May 10 09:33 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-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200463707

Running Version 202205111006
[2022-06-02 20:07:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:07:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:07:45] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-06-02 20:07:45] [INFO ] Transformed 368 places.
[2022-06-02 20:07:45] [INFO ] Transformed 319 transitions.
[2022-06-02 20:07:45] [INFO ] Found NUPN structural information;
[2022-06-02 20:07:45] [INFO ] Parsed PT model containing 368 places and 319 transitions in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 94 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 13) seen :2
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 10) seen :3
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 318 rows 367 cols
[2022-06-02 20:07:47] [INFO ] Computed 57 place invariants in 18 ms
[2022-06-02 20:07:47] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-02 20:07:47] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned sat
[2022-06-02 20:07:47] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2022-06-02 20:07:47] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2022-06-02 20:07:47] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 5 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 268 ms
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2022-06-02 20:07:48] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:07:49] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2022-06-02 20:07:49] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 0 ms to minimize.
[2022-06-02 20:07:49] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 5 ms to minimize.
[2022-06-02 20:07:49] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2022-06-02 20:07:49] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
[2022-06-02 20:07:49] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 0 ms to minimize.
[2022-06-02 20:07:49] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 0 ms to minimize.
[2022-06-02 20:07:49] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 0 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 0 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 1 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 99 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:07:50] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 0 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 0 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 4 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2022-06-02 20:07:51] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 3658 ms
[2022-06-02 20:07:51] [INFO ] After 4233ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-06-02 20:07:51] [INFO ] After 4495ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 22 out of 367 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 210 edges and 367 vertex of which 7 / 367 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 702 edges and 361 vertex of which 358 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 358 transition count 232
Reduce places removed 76 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 82 rules applied. Total rules applied 161 place count 282 transition count 226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 167 place count 276 transition count 226
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 167 place count 276 transition count 183
Deduced a syphon composed of 43 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 262 place count 224 transition count 183
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 313 place count 173 transition count 132
Iterating global reduction 3 with 51 rules applied. Total rules applied 364 place count 173 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 364 place count 173 transition count 129
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 370 place count 170 transition count 129
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 480 place count 115 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 481 place count 114 transition count 73
Applied a total of 481 rules in 91 ms. Remains 114 /367 variables (removed 253) and now considering 73/318 (removed 245) transitions.
Finished structural reductions, in 1 iterations. Remains : 114/367 places, 73/318 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2075 ms. (steps per millisecond=481 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1202 ms. (steps per millisecond=831 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2549 steps, run visited all 1 properties in 16 ms. (steps per millisecond=159 )
Probabilistic random walk after 2549 steps, saw 710 distinct states, run finished after 16 ms. (steps per millisecond=159 ) properties seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 10370 ms.

BK_STOP 1654200475352

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-05"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-05, 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 r024-tall-165251918400358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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