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.r047-tajo-171620398300455.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 greatspnxred
Input is BusinessProcesses-PT-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 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 47K 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-01-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716302359415

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:39:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:39:21] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-21 14:39:21] [INFO ] Transformed 200 places.
[2024-05-21 14:39:21] [INFO ] Transformed 178 transitions.
[2024-05-21 14:39:21] [INFO ] Found NUPN structural information;
[2024-05-21 14:39:21] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
RANDOM walk for 40000 steps (462 resets) in 1285 ms. (31 steps per ms) remains 4/16 properties
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (117 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (97 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (96 resets) in 423 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (98 resets) in 570 ms. (70 steps per ms) remains 4/4 properties
// Phase 1: matrix 177 rows 199 cols
[2024-05-21 14:39:22] [INFO ] Computed 30 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 118/176 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 118/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/179 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BusinessProcesses-PT-01-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 20/199 variables, 10/209 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 20/229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 177/376 variables, 199/428 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/428 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/376 variables, 0/428 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 428 constraints, problems are : Problem set: 1 solved, 3 unsolved in 715 ms.
Refiners :[Domain max(s): 199/199 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem BusinessProcesses-PT-01-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 133/164 variables, 18/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 133/182 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:39:23] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 15 ms to minimize.
[2024-05-21 14:39:23] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 3 ms to minimize.
[2024-05-21 14:39:24] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 7 ms to minimize.
[2024-05-21 14:39:26] [INFO ] Deduced a trap composed of 20 places in 1981 ms of which 28 ms to minimize.
[2024-05-21 14:39:26] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/202 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-21 14:39:27] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:39:28] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-05-21 14:39:28] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-21 14:39:28] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-21 14:39:28] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 1 ms to minimize.
[2024-05-21 14:39:28] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2024-05-21 14:39:28] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
SMT process timed out in 5848ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 177/177 transitions.
Graph (complete) has 382 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 196 transition count 151
Reduce places removed 25 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 29 rules applied. Total rules applied 55 place count 171 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 167 transition count 147
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 59 place count 167 transition count 114
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 128 place count 131 transition count 114
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 155 place count 104 transition count 87
Iterating global reduction 3 with 27 rules applied. Total rules applied 182 place count 104 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 184 place count 104 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 103 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 103 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 102 transition count 84
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 227 place count 82 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 82 transition count 63
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 6 with 2 rules applied. Total rules applied 230 place count 81 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 81 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 80 transition count 65
Applied a total of 232 rules in 126 ms. Remains 80 /199 variables (removed 119) and now considering 65/177 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 80/199 places, 65/177 transitions.
RANDOM walk for 40000 steps (1838 resets) in 539 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (587 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (446 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Probably explored full state space saw : 23582 states, properties seen :0
Probabilistic random walk after 114357 steps, saw 23582 distinct states, run finished after 570 ms. (steps per millisecond=200 ) properties seen :0
Explored full state space saw : 23582 states, properties seen :0
Exhaustive walk after 114357 steps, saw 23582 distinct states, run finished after 624 ms. (steps per millisecond=183 ) properties seen :0
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 9041 ms.
ITS solved all properties within timeout

BK_STOP 1716302370361

--------------------
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.202405141337.jar
+ 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-01"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-01, 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 r047-tajo-171620398300455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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