Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 18K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Apr 12 14:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 173K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 840K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 303K May 18 16:43 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716829919245

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-27 17:12:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 17:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 17:12:00] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-27 17:12:00] [INFO ] Transformed 144 places.
[2024-05-27 17:12:00] [INFO ] Transformed 451 transitions.
[2024-05-27 17:12:00] [INFO ] Found NUPN structural information;
[2024-05-27 17:12:00] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 216 ms.
Reduce places removed 6 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 138/138 places, 451/451 transitions.
[2024-05-27 17:12:00] [INFO ] Redundant transitions in 27 ms returned []
Running 445 sub problems to find dead transitions.
[2024-05-27 17:12:00] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 17:12:00] [INFO ] Computed 29 invariants in 20 ms
[2024-05-27 17:12:00] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:12:03] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 15 ms to minimize.
[2024-05-27 17:12:03] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-27 17:12:03] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 17:12:03] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-27 17:12:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-27 17:12:04] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-27 17:12:04] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-27 17:12:04] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-27 17:12:04] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-27 17:12:04] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:12:04] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:12:04] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-27 17:12:05] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:12:05] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-27 17:12:05] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2024-05-27 17:12:05] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:12:05] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:12:05] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-27 17:12:06] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-27 17:12:06] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:12:08] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:12:08] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:12:08] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:12:08] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-27 17:12:08] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-27 17:12:08] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-27 17:12:08] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:12:08] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:12:09] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-27 17:12:09] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 10/197 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/197 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/335 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/378 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/378 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 378 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30060 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 30/197 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:12:33] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2024-05-27 17:12:34] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-27 17:12:34] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-27 17:12:35] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:12:35] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:12:35] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:12:36] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2024-05-27 17:12:36] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:12:37] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-27 17:12:37] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-27 17:12:37] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-27 17:12:37] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 12/209 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:12:41] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 1/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:12:46] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:12:47] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/212 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:12:51] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:12:52] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-27 17:12:52] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:12:52] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 4/216 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:12:57] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/217 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/380 variables, and 217 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30029 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/138 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 50/50 constraints]
After SMT, in 60727ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60754ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 138/138 places, 415/451 transitions.
[2024-05-27 17:13:01] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 60936 ms. Remains : 138/138 places, 415/451 transitions.
Final net has 138 places and 415 transitions.
[2024-05-27 17:13:01] [INFO ] Flatten gal took : 82 ms
[2024-05-27 17:13:01] [INFO ] Applying decomposition
[2024-05-27 17:13:01] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10451600962712981145.txt' '-o' '/tmp/graph10451600962712981145.bin' '-w' '/tmp/graph10451600962712981145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10451600962712981145.bin' '-l' '-1' '-v' '-w' '/tmp/graph10451600962712981145.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:13:02] [INFO ] Decomposing Gal with order
[2024-05-27 17:13:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:13:02] [INFO ] Removed a total of 444 redundant transitions.
[2024-05-27 17:13:02] [INFO ] Flatten gal took : 138 ms
[2024-05-27 17:13:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 16 ms.
[2024-05-27 17:13:02] [INFO ] Time to serialize gal into /tmp/StateSpace3353281322242686369.gal : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace3353281322242686369.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
ITS-tools command line returned an error code 137
[2024-05-27 17:30:23] [INFO ] Applying decomposition
[2024-05-27 17:30:23] [INFO ] Flatten gal took : 35 ms
[2024-05-27 17:30:23] [INFO ] Decomposing Gal with order
[2024-05-27 17:30:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:30:23] [INFO ] Removed a total of 1117 redundant transitions.
[2024-05-27 17:30:23] [INFO ] Flatten gal took : 69 ms
[2024-05-27 17:30:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 11 ms.
[2024-05-27 17:30:23] [INFO ] Time to serialize gal into /tmp/StateSpace1044692308475388082.gal : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace1044692308475388082.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.81676e+06,37.0539,822424,11333,1045,1.35468e+06,1781,713,1.55915e+06,341,4684,0
Total reachable state count : 6816756

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 17
STATE_SPACE MAX_TOKEN_PER_MARKING 23 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 6816756
STATE_SPACE STATES 6816756 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1140137 ms.

BK_STOP 1716831060531

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SafeBus-PT-06"
export BK_EXAMINATION="StateSpace"
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-5568"
echo " Executing tool itstools"
echo " Input is SafeBus-PT-06, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679080300424"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;