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.r106-tall-167814483100742.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DLCround-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100742
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 18:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 18:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 18:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 DLCround-PT-10b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678465513585

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 16:25:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 16:25:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:25:15] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-10 16:25:15] [INFO ] Transformed 3924 places.
[2023-03-10 16:25:15] [INFO ] Transformed 6192 transitions.
[2023-03-10 16:25:15] [INFO ] Found NUPN structural information;
[2023-03-10 16:25:15] [INFO ] Parsed PT model containing 3924 places and 6192 transitions and 17304 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-10b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 14) seen :8
FORMULA DLCround-PT-10b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6192 rows 3924 cols
[2023-03-10 16:25:16] [INFO ] Computed 213 place invariants in 61 ms
[2023-03-10 16:25:18] [INFO ] After 1825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 16:25:19] [INFO ] [Nat]Absence check using 213 positive place invariants in 190 ms returned sat
[2023-03-10 16:25:23] [INFO ] After 3423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 16:25:25] [INFO ] Deduced a trap composed of 283 places in 757 ms of which 10 ms to minimize.
[2023-03-10 16:25:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1195 ms
[2023-03-10 16:25:26] [INFO ] After 6676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 939 ms.
[2023-03-10 16:25:27] [INFO ] After 8971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
FORMULA DLCround-PT-10b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 184 ms.
Support contains 39 out of 3924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3924/3924 places, 6192/6192 transitions.
Graph (trivial) has 3550 edges and 3924 vertex of which 633 / 3924 are part of one of the 47 SCC in 13 ms
Free SCC test removed 586 places
Drop transitions removed 656 transitions
Reduce isomorphic transitions removed 656 transitions.
Drop transitions removed 1391 transitions
Trivial Post-agglo rules discarded 1391 transitions
Performed 1391 trivial Post agglomeration. Transition count delta: 1391
Iterating post reduction 0 with 1391 rules applied. Total rules applied 1392 place count 3338 transition count 4145
Reduce places removed 1391 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 1468 rules applied. Total rules applied 2860 place count 1947 transition count 4068
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 40 rules applied. Total rules applied 2900 place count 1914 transition count 4061
Reduce places removed 3 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 3 with 16 rules applied. Total rules applied 2916 place count 1911 transition count 4048
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 2929 place count 1898 transition count 4048
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2929 place count 1898 transition count 4027
Deduced a syphon composed of 21 places in 22 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 2971 place count 1877 transition count 4027
Discarding 506 places :
Symmetric choice reduction at 5 with 506 rule applications. Total rules 3477 place count 1371 transition count 3521
Iterating global reduction 5 with 506 rules applied. Total rules applied 3983 place count 1371 transition count 3521
Performed 212 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 212 Pre rules applied. Total rules applied 3983 place count 1371 transition count 3309
Deduced a syphon composed of 212 places in 17 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 5 with 424 rules applied. Total rules applied 4407 place count 1159 transition count 3309
Discarding 79 places :
Symmetric choice reduction at 5 with 79 rule applications. Total rules 4486 place count 1080 transition count 2221
Iterating global reduction 5 with 79 rules applied. Total rules applied 4565 place count 1080 transition count 2221
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 4591 place count 1080 transition count 2195
Performed 288 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 288 places in 2 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 6 with 576 rules applied. Total rules applied 5167 place count 792 transition count 1898
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 5177 place count 792 transition count 1888
Renaming transitions due to excessive name length > 1024 char.
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5178 place count 791 transition count 1874
Iterating global reduction 7 with 1 rules applied. Total rules applied 5179 place count 791 transition count 1874
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -560
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 5283 place count 739 transition count 2434
Drop transitions removed 32 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 5319 place count 739 transition count 2398
Discarding 25 places :
Symmetric choice reduction at 8 with 25 rule applications. Total rules 5344 place count 714 transition count 1710
Iterating global reduction 8 with 25 rules applied. Total rules applied 5369 place count 714 transition count 1710
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 5392 place count 714 transition count 1687
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 5398 place count 711 transition count 1715
Drop transitions removed 195 transitions
Redundant transition composition rules discarded 195 transitions
Iterating global reduction 9 with 195 rules applied. Total rules applied 5593 place count 711 transition count 1520
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 5604 place count 700 transition count 1361
Iterating global reduction 9 with 11 rules applied. Total rules applied 5615 place count 700 transition count 1361
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 5625 place count 700 transition count 1351
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 5633 place count 696 transition count 1385
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 5637 place count 696 transition count 1381
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 5639 place count 696 transition count 1379
Free-agglomeration rule applied 394 times with reduction of 195 identical transitions.
Iterating global reduction 11 with 394 rules applied. Total rules applied 6033 place count 696 transition count 790
Reduce places removed 394 places and 0 transitions.
Drop transitions removed 384 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 397 transitions.
Graph (complete) has 641 edges and 302 vertex of which 224 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.1 ms
Discarding 78 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 11 with 792 rules applied. Total rules applied 6825 place count 224 transition count 392
Drop transitions removed 5 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 6833 place count 224 transition count 384
Discarding 79 places :
Symmetric choice reduction at 13 with 79 rule applications. Total rules 6912 place count 145 transition count 255
Iterating global reduction 13 with 79 rules applied. Total rules applied 6991 place count 145 transition count 255
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 13 with 27 rules applied. Total rules applied 7018 place count 145 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 7019 place count 144 transition count 228
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 7020 place count 143 transition count 227
Iterating global reduction 14 with 1 rules applied. Total rules applied 7021 place count 143 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 7023 place count 142 transition count 235
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 7028 place count 142 transition count 230
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 7029 place count 142 transition count 230
Applied a total of 7029 rules in 1017 ms. Remains 142 /3924 variables (removed 3782) and now considering 230/6192 (removed 5962) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1017 ms. Remains : 142/3924 places, 230/6192 transitions.
Finished random walk after 481 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=80 )
FORMULA DLCround-PT-10b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13464 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCround_PT_10b
(NrP: 3924 NrTr: 6192 NrArc: 17304)

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

net check time: 0m 0.002sec

init dd package: 0m 2.747sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8677036 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103508 kB

BK_TIME_CONFINEMENT_REACHED

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

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="DLCround-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DLCround-PT-10b, 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 r106-tall-167814483100742"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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