Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800350.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 79K May 5 16:51 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-04-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620542698701

Running Version 0
[2021-05-09 06:45:00] [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]
[2021-05-09 06:45:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:45:00] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-09 06:45:00] [INFO ] Transformed 288 places.
[2021-05-09 06:45:00] [INFO ] Transformed 283 transitions.
[2021-05-09 06:45:00] [INFO ] Found NUPN structural information;
[2021-05-09 06:45:00] [INFO ] Parsed PT model containing 288 places and 283 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 111 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :7
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 281 rows 286 cols
[2021-05-09 06:45:00] [INFO ] Computed 44 place invariants in 24 ms
[2021-05-09 06:45:00] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-09 06:45:00] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 11 ms returned sat
[2021-05-09 06:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:45:00] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-09 06:45:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:45:01] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2021-05-09 06:45:01] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 5 ms returned sat
[2021-05-09 06:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:45:01] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-09 06:45:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:45:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-09 06:45:01] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 5 ms returned sat
[2021-05-09 06:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:45:01] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-09 06:45:01] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2021-05-09 06:45:01] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2021-05-09 06:45:01] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2021-05-09 06:45:01] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 0 ms to minimize.
[2021-05-09 06:45:01] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
[2021-05-09 06:45:01] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2021-05-09 06:45:01] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 0 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2021-05-09 06:45:02] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2021-05-09 06:45:03] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 7 ms to minimize.
[2021-05-09 06:45:03] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2021-05-09 06:45:03] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2021-05-09 06:45:03] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1952 ms
[2021-05-09 06:45:03] [INFO ] Computed and/alt/rep : 268/559/268 causal constraints (skipped 12 transitions) in 44 ms.
[2021-05-09 06:45:03] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:45:03] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 4 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2021-05-09 06:45:04] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2021-05-09 06:45:05] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2021-05-09 06:45:05] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
[2021-05-09 06:45:05] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 0 ms to minimize.
[2021-05-09 06:45:05] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1437 ms
[2021-05-09 06:45:05] [INFO ] Added : 109 causal constraints over 23 iterations in 1987 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-09 06:45:05] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-09 06:45:05] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 6 ms returned sat
[2021-05-09 06:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:45:05] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-09 06:45:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:45:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned unsat
[2021-05-09 06:45:05] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-09 06:45:05] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 6 ms returned sat
[2021-05-09 06:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:45:05] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-09 06:45:05] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
FORMULA BusinessProcesses-PT-04-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620542705980

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-04"
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-04, 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 r026-tajo-162038143800350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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