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-167903718100607.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-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718100607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 20:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 20:50 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.4K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 20:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 20:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 20:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:51 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 92K 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-005B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679524760037

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-005B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:39:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:39:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:39:22] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-22 22:39:22] [INFO ] Transformed 393 places.
[2023-03-22 22:39:22] [INFO ] Transformed 358 transitions.
[2023-03-22 22:39:22] [INFO ] Found NUPN structural information;
[2023-03-22 22:39:22] [INFO ] Parsed PT model containing 393 places and 358 transitions and 896 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 16) seen :12
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 358 rows 393 cols
[2023-03-22 22:39:23] [INFO ] Computed 56 place invariants in 15 ms
[2023-03-22 22:39:23] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 22:39:24] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2023-03-22 22:39:24] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 22:39:24] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 7 ms to minimize.
[2023-03-22 22:39:25] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2023-03-22 22:39:25] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 1 ms to minimize.
[2023-03-22 22:39:25] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2023-03-22 22:39:25] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 14 ms to minimize.
[2023-03-22 22:39:25] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 1 ms to minimize.
[2023-03-22 22:39:26] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2023-03-22 22:39:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1300 ms
[2023-03-22 22:39:26] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 27 ms to minimize.
[2023-03-22 22:39:26] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2023-03-22 22:39:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 487 ms
[2023-03-22 22:39:26] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-03-22 22:39:27] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2023-03-22 22:39:27] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2023-03-22 22:39:27] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2023-03-22 22:39:27] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2023-03-22 22:39:27] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2023-03-22 22:39:27] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 4 ms to minimize.
[2023-03-22 22:39:28] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2023-03-22 22:39:28] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2023-03-22 22:39:28] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2023-03-22 22:39:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1644 ms
[2023-03-22 22:39:28] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 1 ms to minimize.
[2023-03-22 22:39:28] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2023-03-22 22:39:28] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2023-03-22 22:39:29] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2023-03-22 22:39:29] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 1 ms to minimize.
[2023-03-22 22:39:29] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-22 22:39:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 991 ms
[2023-03-22 22:39:29] [INFO ] After 5227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-22 22:39:29] [INFO ] After 5781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 99 ms.
Support contains 71 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 358/358 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 393 transition count 310
Reduce places removed 48 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 65 rules applied. Total rules applied 113 place count 345 transition count 293
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 130 place count 328 transition count 293
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 130 place count 328 transition count 271
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 174 place count 306 transition count 271
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 200 place count 280 transition count 245
Iterating global reduction 3 with 26 rules applied. Total rules applied 226 place count 280 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 280 transition count 244
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 227 place count 280 transition count 237
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 241 place count 273 transition count 237
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 347 place count 220 transition count 184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 355 place count 216 transition count 184
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 359 place count 216 transition count 180
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 363 place count 212 transition count 180
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 370 place count 212 transition count 180
Applied a total of 370 rules in 73 ms. Remains 212 /393 variables (removed 181) and now considering 180/358 (removed 178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 212/393 places, 180/358 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :2
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 212 cols
[2023-03-22 22:39:30] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-22 22:39:30] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:39:30] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-22 22:39:30] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:39:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 22:39:30] [INFO ] After 37ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:39:30] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2023-03-22 22:39:30] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2023-03-22 22:39:30] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 0 ms to minimize.
[2023-03-22 22:39:30] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-22 22:39:30] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2023-03-22 22:39:31] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2023-03-22 22:39:31] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 10 ms to minimize.
[2023-03-22 22:39:31] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
[2023-03-22 22:39:31] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2023-03-22 22:39:31] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2023-03-22 22:39:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 993 ms
[2023-03-22 22:39:31] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-22 22:39:31] [INFO ] After 1342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 8979 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_005B
(NrP: 393 NrTr: 358 NrArc: 896)

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

net check time: 0m 0.000sec

init dd package: 0m 2.916sec


before gc: list nodes free: 670500

after gc: idd nodes used:53085741, unused:10914259; list nodes free:49180385

RS generation: 24m49.296sec


-> last computed set: #nodes 53085350 (5.3e+07) #states 12,195,613,575,323 (13)


CANNOT_COMPUTE


BK_STOP 1679526303436

--------------------
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.000sec

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-005B"
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-005B, 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-167903718100607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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