Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 10K Feb 26 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 07:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 07:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 08:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m002-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678711042121

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=BugTracking-PT-q3m002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 12:37:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 12:37:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 12:37:24] [INFO ] Load time of PNML (sax parser for PT used): 710 ms
[2023-03-13 12:37:24] [INFO ] Transformed 754 places.
[2023-03-13 12:37:24] [INFO ] Transformed 27370 transitions.
[2023-03-13 12:37:24] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 922 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 109 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 240 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 7) seen :2
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 12:37:25] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-13 12:37:26] [INFO ] Computed 10 place invariants in 25 ms
[2023-03-13 12:37:26] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 12:37:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-13 12:37:26] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 12:37:26] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-13 12:37:27] [INFO ] After 618ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 12:37:27] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 6 ms to minimize.
[2023-03-13 12:37:28] [INFO ] Deduced a trap composed of 27 places in 514 ms of which 2 ms to minimize.
[2023-03-13 12:37:28] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2023-03-13 12:37:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1295 ms
[2023-03-13 12:37:29] [INFO ] Deduced a trap composed of 44 places in 451 ms of which 2 ms to minimize.
[2023-03-13 12:37:29] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 1 ms to minimize.
[2023-03-13 12:37:30] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 14 ms to minimize.
[2023-03-13 12:37:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1465 ms
[2023-03-13 12:37:30] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 0 ms to minimize.
[2023-03-13 12:37:31] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 1 ms to minimize.
[2023-03-13 12:37:31] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2023-03-13 12:37:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 917 ms
[2023-03-13 12:37:31] [INFO ] After 4718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 558 ms.
[2023-03-13 12:37:32] [INFO ] After 5996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 553 ms.
Support contains 15 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 236 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 236 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 17 place count 230 transition count 2747
Applied a total of 17 rules in 382 ms. Remains 230 /240 variables (removed 10) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 230/240 places, 2747/2769 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 170079 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170079 steps, saw 78967 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 12:37:36] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2023-03-13 12:37:36] [INFO ] Computed 8 place invariants in 33 ms
[2023-03-13 12:37:36] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 12:37:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 12:37:38] [INFO ] After 1356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 12:37:38] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 12:37:39] [INFO ] After 637ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 12:37:39] [INFO ] Deduced a trap composed of 17 places in 639 ms of which 1 ms to minimize.
[2023-03-13 12:37:40] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-13 12:37:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1014 ms
[2023-03-13 12:37:40] [INFO ] Deduced a trap composed of 14 places in 627 ms of which 1 ms to minimize.
[2023-03-13 12:37:41] [INFO ] Deduced a trap composed of 16 places in 389 ms of which 1 ms to minimize.
[2023-03-13 12:37:41] [INFO ] Deduced a trap composed of 12 places in 434 ms of which 1 ms to minimize.
[2023-03-13 12:37:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1704 ms
[2023-03-13 12:37:42] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2023-03-13 12:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-13 12:37:42] [INFO ] After 4249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-13 12:37:42] [INFO ] After 6066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 9 ms.
Support contains 15 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 96 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 230/230 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 108 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-13 12:37:43] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2023-03-13 12:37:43] [INFO ] Invariant cache hit.
[2023-03-13 12:37:43] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-13 12:37:43] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2023-03-13 12:37:43] [INFO ] Invariant cache hit.
[2023-03-13 12:37:44] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 12:37:44] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-13 12:37:45] [INFO ] Redundant transitions in 220 ms returned []
[2023-03-13 12:37:45] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2023-03-13 12:37:45] [INFO ] Invariant cache hit.
[2023-03-13 12:37:46] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3135 ms. Remains : 230/230 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 230 transition count 2618
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 229 transition count 2617
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 229 transition count 2612
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 142 place count 224 transition count 2611
Applied a total of 142 rules in 398 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2747 (removed 136) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 2611 rows 224 cols
[2023-03-13 12:37:46] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-13 12:37:46] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 12:37:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 12:37:47] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 12:37:47] [INFO ] After 1026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-13 12:37:48] [INFO ] After 1379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-13 12:37:48] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-13 12:37:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 230 places, 2747 transitions and 13481 arcs took 17 ms.
[2023-03-13 12:37:48] [INFO ] Flatten gal took : 363 ms
Total runtime 25053 ms.
There are residual formulas that ITS could not solve within timeout
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: BugTracking_PT_q3
(NrP: 230 NrTr: 2747 NrArc: 13481)

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

net check time: 0m 0.002sec

init dd package: 0m 3.094sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10341640 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16083812 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.056sec

6934 12208 17023 24364 30542 38553 43034 49179 55810 56871 68424 77778 77078 78578 90989 97202 106188 117474 119838 122492 121964 136414 148628 155999 140133 157614 163808 174698 185705 187636 189637 185599 186751 219478 226053 201794 207370 230411 243208 256035 250667 256813 254589 248826

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="BugTracking-PT-q3m002"
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 BugTracking-PT-q3m002, 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 r042-tajo-167813695600326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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