Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r267-smll-171654405600047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ParamProductionCell-PT-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405600047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 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 ParamProductionCell-PT-4-ReachabilityFireability-2024-00
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-01
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-02
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-03
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-04
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-05
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-06
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-07
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-08
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-09
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-10
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-11
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-12
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-13
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-14
FORMULA_NAME ParamProductionCell-PT-4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716651367973

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:36:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:36:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:36:11] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-05-25 15:36:11] [INFO ] Transformed 231 places.
[2024-05-25 15:36:11] [INFO ] Transformed 202 transitions.
[2024-05-25 15:36:11] [INFO ] Found NUPN structural information;
[2024-05-25 15:36:11] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 49 ms.
Working with output stream class java.io.PrintStream
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2551 ms. (15 steps per ms) remains 6/15 properties
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1440 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1293 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
// Phase 1: matrix 202 rows 231 cols
[2024-05-25 15:36:13] [INFO ] Computed 59 invariants in 36 ms
[2024-05-25 15:36:13] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ParamProductionCell-PT-4-ReachabilityFireability-2024-09 is UNSAT
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem ParamProductionCell-PT-4-ReachabilityFireability-2024-14 is UNSAT
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 3/117 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/119 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem ParamProductionCell-PT-4-ReachabilityFireability-2024-00 is UNSAT
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ParamProductionCell-PT-4-ReachabilityFireability-2024-06 is UNSAT
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 99/213 variables, 29/148 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 99/247 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 11/258 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/258 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/215 variables, 2/260 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 2/262 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/262 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/229 variables, 11/273 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 14/287 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/229 variables, 0/287 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 200/429 variables, 229/516 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 65/581 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/581 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/431 variables, 3/584 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 0/584 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/433 variables, 2/586 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 2/588 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 1/589 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/433 variables, 0/589 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/433 variables, 0/589 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 589 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1264 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 231/231 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/68 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/69 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/69 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem ParamProductionCell-PT-4-ReachabilityFireability-2024-04 is UNSAT
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 135/201 variables, 28/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 135/232 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 7/239 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-25 15:36:15] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 34 ms to minimize.
[2024-05-25 15:36:15] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 4 ms to minimize.
[2024-05-25 15:36:15] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 3 ms to minimize.
[2024-05-25 15:36:15] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-25 15:36:15] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:36:16] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 6/245 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/245 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/206 variables, 3/248 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 5/253 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/253 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 21/227 variables, 16/269 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 21/290 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-25 15:36:16] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 1/291 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 0/291 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 198/425 variables, 227/518 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 62/580 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 1/581 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-25 15:36:17] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 1/582 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/582 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/429 variables, 6/588 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/588 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/433 variables, 4/592 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/433 variables, 4/596 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/433 variables, 2/598 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-25 15:36:17] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/433 variables, 1/599 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/433 variables, 0/599 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/433 variables, 0/599 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 599 constraints, problems are : Problem set: 5 solved, 1 unsolved in 2933 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 231/231 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 4460ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 42 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 231 transition count 191
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 220 transition count 191
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 214 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 214 transition count 185
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 62 place count 200 transition count 171
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 200 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 198 transition count 169
Applied a total of 66 rules in 162 ms. Remains 198 /231 variables (removed 33) and now considering 169/202 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 198/231 places, 169/202 transitions.
RANDOM walk for 40000 steps (8 resets) in 791 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 438545 steps, run visited all 1 properties in 1717 ms. (steps per millisecond=255 )
Probabilistic random walk after 438545 steps, saw 149323 distinct states, run finished after 1729 ms. (steps per millisecond=253 ) properties seen :1
FORMULA ParamProductionCell-PT-4-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 9808 ms.
ITS solved all properties within timeout

BK_STOP 1716651380380

--------------------
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="ParamProductionCell-PT-4"
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 ParamProductionCell-PT-4, 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 r267-smll-171654405600047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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