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-165251918500455.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-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.2K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:58 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.3K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 29 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 29 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 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 161K 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-17-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654200926963

Running Version 202205111006
[2022-06-02 20:15:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:15:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:15:28] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2022-06-02 20:15:28] [INFO ] Transformed 650 places.
[2022-06-02 20:15:28] [INFO ] Transformed 580 transitions.
[2022-06-02 20:15:28] [INFO ] Found NUPN structural information;
[2022-06-02 20:15:28] [INFO ] Parsed PT model containing 650 places and 580 transitions in 249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 576 rows 646 cols
[2022-06-02 20:15:29] [INFO ] Computed 108 place invariants in 33 ms
[2022-06-02 20:15:30] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-02 20:15:30] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2022-06-02 20:15:30] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 16 ms returned sat
[2022-06-02 20:15:32] [INFO ] After 1285ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2022-06-02 20:15:32] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 4 ms to minimize.
[2022-06-02 20:15:33] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 1 ms to minimize.
[2022-06-02 20:15:33] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2022-06-02 20:15:33] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 2 ms to minimize.
[2022-06-02 20:15:33] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 2 ms to minimize.
[2022-06-02 20:15:34] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2022-06-02 20:15:34] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:15:34] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:15:34] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:15:34] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:15:35] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:15:35] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:15:35] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:15:35] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:15:35] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 0 ms to minimize.
[2022-06-02 20:15:35] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:15:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3091 ms
[2022-06-02 20:15:36] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:15:36] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2022-06-02 20:15:36] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-06-02 20:15:36] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2022-06-02 20:15:36] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2022-06-02 20:15:36] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2022-06-02 20:15:36] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:15:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 878 ms
[2022-06-02 20:15:37] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:15:37] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:15:37] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2022-06-02 20:15:37] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2022-06-02 20:15:37] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:15:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 688 ms
[2022-06-02 20:15:38] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:15:38] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:15:38] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:15:38] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:15:38] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:15:39] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:15:39] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:15:39] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:15:39] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2022-06-02 20:15:39] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:15:39] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:15:39] [INFO ] Deduced a trap composed of 153 places in 136 ms of which 2 ms to minimize.
[2022-06-02 20:15:40] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 0 ms to minimize.
[2022-06-02 20:15:40] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:15:40] [INFO ] Deduced a trap composed of 142 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:15:40] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:15:40] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 0 ms to minimize.
[2022-06-02 20:15:40] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:15:41] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:15:41] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:15:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3373 ms
[2022-06-02 20:15:41] [INFO ] After 10692ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 974 ms.
[2022-06-02 20:15:42] [INFO ] After 12106ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 6043 ms.
Support contains 89 out of 646 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 642 transition count 509
Reduce places removed 66 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 79 rules applied. Total rules applied 146 place count 576 transition count 496
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 159 place count 563 transition count 496
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 159 place count 563 transition count 376
Deduced a syphon composed of 120 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 411 place count 431 transition count 376
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 477 place count 365 transition count 310
Iterating global reduction 3 with 66 rules applied. Total rules applied 543 place count 365 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 543 place count 365 transition count 308
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 548 place count 362 transition count 308
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 692 place count 290 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 693 place count 290 transition count 235
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 698 place count 290 transition count 235
Applied a total of 698 rules in 135 ms. Remains 290 /646 variables (removed 356) and now considering 235/576 (removed 341) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/646 places, 235/576 transitions.
Incomplete random walk after 1000000 steps, including 19808 resets, run finished after 18987 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 846555 steps, including 3852 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 0
Interrupted Best-First random walk after 857075 steps, including 4531 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Interrupted Best-First random walk after 913297 steps, including 4102 resets, run timeout after 5001 ms. (steps per millisecond=182 ) properties seen 0
Interrupted Best-First random walk after 853622 steps, including 3689 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 961574 steps, including 4322 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen 0
Incomplete Best-First random walk after 1000000 steps, including 4481 resets, run finished after 4802 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Finished probabilistic random walk after 111623 steps, run visited all 6 properties in 325 ms. (steps per millisecond=343 )
Probabilistic random walk after 111623 steps, saw 17446 distinct states, run finished after 326 ms. (steps per millisecond=342 ) properties seen :6
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 69818 ms.

BK_STOP 1654200998011

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-17"
export BK_EXAMINATION="ReachabilityFireability"
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-17, 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 r024-tall-165251918500455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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