Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918400342.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 29 23:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 29 23:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 29 23:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 23:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 29 23:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 29 23:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 63K May 10 09:33 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 BusinessProcesses-PT-03-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200402634

Running Version 202205111006
[2022-06-02 20:06:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:06:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:06:44] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2022-06-02 20:06:44] [INFO ] Transformed 274 places.
[2022-06-02 20:06:44] [INFO ] Transformed 237 transitions.
[2022-06-02 20:06:44] [INFO ] Found NUPN structural information;
[2022-06-02 20:06:44] [INFO ] Parsed PT model containing 274 places and 237 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 117 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 236 rows 273 cols
[2022-06-02 20:06:45] [INFO ] Computed 43 place invariants in 20 ms
[2022-06-02 20:06:45] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 20:06:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-06-02 20:06:45] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2022-06-02 20:06:46] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 64 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 553 ms
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2022-06-02 20:06:46] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 0 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 0 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
[2022-06-02 20:06:47] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:06:48] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 5 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 3121 ms
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2022-06-02 20:06:49] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 559 ms
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 7 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 0 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2022-06-02 20:06:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 432 ms
[2022-06-02 20:06:50] [INFO ] After 5075ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 176 ms.
[2022-06-02 20:06:51] [INFO ] After 5421ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 328 ms.
Support contains 33 out of 273 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 273/273 places, 236/236 transitions.
Graph (trivial) has 133 edges and 273 vertex of which 8 / 273 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 512 edges and 266 vertex of which 263 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 263 transition count 183
Reduce places removed 41 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 48 rules applied. Total rules applied 92 place count 222 transition count 176
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 99 place count 215 transition count 176
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 99 place count 215 transition count 144
Deduced a syphon composed of 32 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 169 place count 177 transition count 144
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 196 place count 150 transition count 117
Iterating global reduction 3 with 27 rules applied. Total rules applied 223 place count 150 transition count 117
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 295 place count 114 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 113 transition count 80
Applied a total of 296 rules in 101 ms. Remains 113 /273 variables (removed 160) and now considering 80/236 (removed 156) transitions.
Finished structural reductions, in 1 iterations. Remains : 113/273 places, 80/236 transitions.
Incomplete random walk after 1000000 steps, including 19492 resets, run finished after 1617 ms. (steps per millisecond=618 ) properties (out of 1) seen :0
Finished Best-First random walk after 5651 steps, including 36 resets, run visited all 1 properties in 10 ms. (steps per millisecond=565 )
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 9336 ms.

BK_STOP 1654200413222

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BusinessProcesses-PT-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-03, 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 r024-tall-165251918400342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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