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.r394-oct2-167903718100623.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718100623
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 185K Mar 5 18:23 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 ShieldPPPt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679525568819

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:52:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:52:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:52:51] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-22 22:52:51] [INFO ] Transformed 783 places.
[2023-03-22 22:52:51] [INFO ] Transformed 713 transitions.
[2023-03-22 22:52:51] [INFO ] Found NUPN structural information;
[2023-03-22 22:52:51] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 16) seen :12
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 713 rows 783 cols
[2023-03-22 22:52:51] [INFO ] Computed 111 place invariants in 16 ms
[2023-03-22 22:52:52] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 22:52:52] [INFO ] [Nat]Absence check using 111 positive place invariants in 41 ms returned sat
[2023-03-22 22:52:52] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 22:52:53] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 8 ms to minimize.
[2023-03-22 22:52:53] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2023-03-22 22:52:53] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2023-03-22 22:52:53] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 14 ms to minimize.
[2023-03-22 22:52:54] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 24 ms to minimize.
[2023-03-22 22:52:54] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 0 ms to minimize.
[2023-03-22 22:52:54] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 1 ms to minimize.
[2023-03-22 22:52:55] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2023-03-22 22:52:55] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2023-03-22 22:52:55] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2023-03-22 22:52:55] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 1 ms to minimize.
[2023-03-22 22:52:56] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 11 ms to minimize.
[2023-03-22 22:52:56] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2023-03-22 22:52:56] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 1 ms to minimize.
[2023-03-22 22:52:56] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2023-03-22 22:52:56] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2023-03-22 22:52:56] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 1 ms to minimize.
[2023-03-22 22:52:57] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2023-03-22 22:52:57] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2023-03-22 22:52:57] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2023-03-22 22:52:57] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2023-03-22 22:52:57] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 7 ms to minimize.
[2023-03-22 22:52:57] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2023-03-22 22:52:58] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2023-03-22 22:52:58] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2023-03-22 22:52:58] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2023-03-22 22:52:58] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5428 ms
[2023-03-22 22:52:58] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 1 ms to minimize.
[2023-03-22 22:52:59] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 2 ms to minimize.
[2023-03-22 22:52:59] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 0 ms to minimize.
[2023-03-22 22:52:59] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2023-03-22 22:52:59] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2023-03-22 22:53:00] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2023-03-22 22:53:00] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2023-03-22 22:53:00] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 1 ms to minimize.
[2023-03-22 22:53:00] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2023-03-22 22:53:00] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 1 ms to minimize.
[2023-03-22 22:53:01] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-22 22:53:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2505 ms
[2023-03-22 22:53:01] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2023-03-22 22:53:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-22 22:53:01] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 4 ms to minimize.
[2023-03-22 22:53:01] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2023-03-22 22:53:01] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2023-03-22 22:53:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 568 ms
[2023-03-22 22:53:02] [INFO ] After 9594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-22 22:53:02] [INFO ] After 10201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 170 ms.
Support contains 27 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 783 transition count 544
Reduce places removed 169 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 176 rules applied. Total rules applied 345 place count 614 transition count 537
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 352 place count 607 transition count 537
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 352 place count 607 transition count 493
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 440 place count 563 transition count 493
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 509 place count 494 transition count 424
Iterating global reduction 3 with 69 rules applied. Total rules applied 578 place count 494 transition count 424
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 578 place count 494 transition count 398
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 630 place count 468 transition count 398
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 940 place count 313 transition count 243
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 992 place count 287 transition count 243
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 1019 place count 287 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1020 place count 286 transition count 242
Applied a total of 1020 rules in 137 ms. Remains 286 /783 variables (removed 497) and now considering 242/713 (removed 471) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 286/783 places, 242/713 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :3
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 1950 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=487 )
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 11995 ms.
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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldPPPt_PT_010B
(NrP: 783 NrTr: 713 NrArc: 1786)

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

net check time: 0m 0.000sec

init dd package: 0m 2.944sec


before gc: list nodes free: 1028744

after gc: idd nodes used:62977124, unused:1022876; list nodes free:5455778

RS generation: 34m 6.451sec


-> last computed set: #nodes 62976343 (6.3e+07) #states 2,978,770,844,706,380,962,383 (21)


CANNOT_COMPUTE


BK_STOP 1679527685888

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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.001sec

idd.cc:820: DD Exception: No free nodes

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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPt-PT-010B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903718100623"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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