Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r210-tall-174894547300252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ShieldIIPs-PT-050B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tall-174894547300252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 846K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749025720247

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 08:28:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-04 08:28:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 08:28:41] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2025-06-04 08:28:41] [INFO ] Transformed 3003 places.
[2025-06-04 08:28:41] [INFO ] Transformed 2953 transitions.
[2025-06-04 08:28:41] [INFO ] Found NUPN structural information;
[2025-06-04 08:28:41] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 406 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 3003 transition count 2702
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2752 transition count 2702
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2752 transition count 2451
Deduced a syphon composed of 251 places in 33 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2501 transition count 2451
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 1200
Deduced a syphon composed of 1200 places in 6 ms
Reduce places removed 1200 places and 0 transitions.
Iterating global reduction 2 with 2400 rules applied. Total rules applied 3404 place count 1301 transition count 1251
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3404 rules in 411 ms. Remains 1301 /3003 variables (removed 1702) and now considering 1251/2953 (removed 1702) transitions.
// Phase 1: matrix 1251 rows 1301 cols
[2025-06-04 08:28:42] [INFO ] Computed 451 invariants in 29 ms
[2025-06-04 08:28:43] [INFO ] Implicit Places using invariants in 956 ms returned [1286]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 984 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1300/3003 places, 1251/2953 transitions.
Applied a total of 0 rules in 20 ms. Remains 1300 /1300 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1432 ms. Remains : 1300/3003 places, 1251/2953 transitions.
Discarding 300 transitions out of 1251. Remains 951
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (12 resets) in 4471 ms. (8 steps per ms) remains 5/950 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
// Phase 1: matrix 1251 rows 1300 cols
[2025-06-04 08:28:45] [INFO ] Computed 450 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 36/51 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 36/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1249/1300 variables, 435/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1300 variables, 1249/1750 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-04 08:28:45] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 17 ms to minimize.
[2025-06-04 08:28:45] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-06-04 08:28:46] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 20/1770 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-06-04 08:28:47] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 5/1775 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1300 variables, 0/1775 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1251/2551 variables, 1300/3075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-04 08:28:48] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 4 ms to minimize.
[2025-06-04 08:28:49] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 3 ms to minimize.
[2025-06-04 08:28:49] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 3 ms to minimize.
[2025-06-04 08:28:49] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2025-06-04 08:28:49] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 3 ms to minimize.
[2025-06-04 08:28:49] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 3 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2551/2551 variables, and 3082 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5012 ms.
Refiners :[Domain max(s): 1300/1300 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 36/51 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 36/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1249/1300 variables, 435/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1300 variables, 1249/1750 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 32/1782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
[2025-06-04 08:28:50] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-06-04 08:28:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2025-06-04 08:28:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-06-04 08:28:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2025-06-04 08:28:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 13/1795 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1300 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1251/2551 variables, 1300/3095 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2551 variables, 5/3100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-04 08:28:51] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 3 ms to minimize.
[2025-06-04 08:28:52] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 5 ms to minimize.
[2025-06-04 08:28:52] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2025-06-04 08:28:52] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
[2025-06-04 08:28:52] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 3 ms to minimize.
[2025-06-04 08:28:52] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2025-06-04 08:28:53] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2025-06-04 08:28:53] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 5 ms to minimize.
[2025-06-04 08:28:53] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2025-06-04 08:28:53] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2025-06-04 08:28:53] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 4 ms to minimize.
[2025-06-04 08:28:53] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2025-06-04 08:28:53] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 3 ms to minimize.
[2025-06-04 08:28:54] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2025-06-04 08:28:54] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2025-06-04 08:28:54] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2025-06-04 08:28:54] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2025-06-04 08:28:54] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2025-06-04 08:28:54] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2025-06-04 08:28:54] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2551 variables, 20/3120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-04 08:28:55] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2025-06-04 08:28:55] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
SMT process timed out in 10098ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1251/1251 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1250 transition count 1201
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1250 transition count 1201
Partial Free-agglomeration rule applied 338 times.
Drop transitions (Partial Free agglomeration) removed 338 transitions
Iterating global reduction 0 with 338 rules applied. Total rules applied 438 place count 1250 transition count 1201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 439 place count 1249 transition count 1200
Applied a total of 439 rules in 312 ms. Remains 1249 /1300 variables (removed 51) and now considering 1200/1251 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 1249/1300 places, 1200/1251 transitions.
RANDOM walk for 57993 steps (11 resets) in 930 ms. (62 steps per ms) remains 0/5 properties
Able to resolve query QuasiLiveness after proving 951 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 14473 ms.
ITS solved all properties within timeout

BK_STOP 1749025735825

--------------------
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 QuasiLiveness -timeout 180 -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="ShieldIIPs-PT-050B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is ShieldIIPs-PT-050B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tall-174894547300252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;