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.r549-tall-171734898200286.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 FireWire-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16: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 FireWire-PT-15-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-15-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717371345002

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:35:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 23:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:35:46] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 23:35:46] [INFO ] Transformed 248 places.
[2024-06-02 23:35:46] [INFO ] Transformed 383 transitions.
[2024-06-02 23:35:46] [INFO ] Found NUPN structural information;
[2024-06-02 23:35:46] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (14 resets) in 1794 ms. (22 steps per ms) remains 10/13 properties
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (9 resets) in 351 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 314 ms. (126 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (13 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (10 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (15 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (10 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (15 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
// Phase 1: matrix 383 rows 248 cols
[2024-06-02 23:35:47] [INFO ] Computed 5 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 177/248 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 177/253 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:35:48] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 10 ms to minimize.
[2024-06-02 23:35:48] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:35:48] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
Problem FireWire-PT-15-ReachabilityCardinality-2024-04 is UNSAT
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-15-ReachabilityCardinality-2024-13 is UNSAT
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 3/256 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/256 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 383/631 variables, 248/504 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/504 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/631 variables, 0/504 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 504 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1161 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem FireWire-PT-15-ReachabilityCardinality-2024-10 is UNSAT
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 204/248 variables, 5/49 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 204/253 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 3/256 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/256 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 383/631 variables, 248/504 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 7/511 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 0/511 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-06-02 23:35:49] [INFO ] Deduced a trap composed of 139 places in 111 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/631 variables, 1/512 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/512 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/631 variables, 0/512 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 512 constraints, problems are : Problem set: 3 solved, 7 unsolved in 1330 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 2576ms problems are : Problem set: 3 solved, 7 unsolved
Parikh walk visited 0 properties in 5962 ms.
Support contains 29 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 383/383 transitions.
Graph (trivial) has 153 edges and 248 vertex of which 9 / 248 are part of one of the 2 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 670 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 236 transition count 341
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 205 transition count 339
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 204 transition count 336
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 201 transition count 336
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 74 place count 201 transition count 329
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 88 place count 194 transition count 329
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 122 place count 160 transition count 294
Iterating global reduction 4 with 34 rules applied. Total rules applied 156 place count 160 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 160 transition count 293
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 157 place count 160 transition count 291
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 161 place count 158 transition count 291
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 169 place count 150 transition count 255
Iterating global reduction 5 with 8 rules applied. Total rules applied 177 place count 150 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 179 place count 150 transition count 253
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 217 place count 131 transition count 234
Performed 11 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 239 place count 120 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 120 transition count 250
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 249 place count 120 transition count 241
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 258 place count 111 transition count 241
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 260 place count 109 transition count 239
Iterating global reduction 7 with 2 rules applied. Total rules applied 262 place count 109 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 267 place count 109 transition count 234
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 272 place count 109 transition count 234
Applied a total of 272 rules in 123 ms. Remains 109 /248 variables (removed 139) and now considering 234/383 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 109/248 places, 234/383 transitions.
RANDOM walk for 40000 steps (10 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (14 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (14 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (16 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (12 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (9 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 17262 steps, run visited all 7 properties in 110 ms. (steps per millisecond=156 )
Probabilistic random walk after 17262 steps, saw 5775 distinct states, run finished after 114 ms. (steps per millisecond=151 ) properties seen :7
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-15-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 11008 ms.
ITS solved all properties within timeout

BK_STOP 1717371357203

--------------------
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 ReachabilityCardinality -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="FireWire-PT-15"
export BK_EXAMINATION="ReachabilityCardinality"
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 FireWire-PT-15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898200286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;