Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399600503.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:42 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-07-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225311539

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:01:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:01:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:01:53] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 07:01:53] [INFO ] Transformed 386 places.
[2024-06-01 07:01:53] [INFO ] Transformed 360 transitions.
[2024-06-01 07:01:53] [INFO ] Found NUPN structural information;
[2024-06-01 07:01:53] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (436 resets) in 1543 ms. (25 steps per ms) remains 6/16 properties
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (83 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (89 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (90 resets) in 543 ms. (73 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (82 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (85 resets) in 1089 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (81 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
// Phase 1: matrix 360 rows 386 cols
[2024-06-01 07:01:54] [INFO ] Computed 62 invariants in 56 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 221/300 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 221/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 16/316 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 16/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 70/386 variables, 29/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 70/448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BusinessProcesses-PT-07-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-07-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-07-ReachabilityFireability-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 360/746 variables, 386/834 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/746 variables, 0/834 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/746 variables, 0/834 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 834 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1255 ms.
Refiners :[Domain max(s): 386/386 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 386/386 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 190/211 variables, 17/38 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 190/228 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 25 ms to minimize.
Problem BusinessProcesses-PT-07-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 2/230 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 80/291 variables, 16/246 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 80/326 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 78 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 14 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 20/346 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 4 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 20/366 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
SMT process timed out in 6533ms, After SMT, problems are : Problem set: 4 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (complete) has 813 edges and 386 vertex of which 384 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 384 transition count 307
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 332 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 330 transition count 305
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 109 place count 330 transition count 225
Deduced a syphon composed of 80 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 277 place count 242 transition count 225
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 322 place count 197 transition count 180
Iterating global reduction 3 with 45 rules applied. Total rules applied 367 place count 197 transition count 180
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 367 place count 197 transition count 176
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 376 place count 192 transition count 176
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 484 place count 137 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 486 place count 136 transition count 126
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 491 place count 136 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 492 place count 135 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 134 transition count 125
Applied a total of 493 rules in 153 ms. Remains 134 /386 variables (removed 252) and now considering 125/360 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 134/386 places, 125/360 transitions.
RANDOM walk for 35642 steps (2402 resets) in 328 ms. (108 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8541 ms.
ITS solved all properties within timeout

BK_STOP 1717225321576

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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-07"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-07, 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 r472-tajo-171620399600503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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