Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r016-oct2-177944372500077.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is AirplaneLD-PT-1000, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-oct2-177944372500077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 795K Mar 4 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Mar 4 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 339K Mar 4 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Mar 4 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 327K Mar 15 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 842K Mar 15 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 238K Mar 15 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 1000K Mar 15 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 733K Mar 4 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Mar 4 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 609K Mar 4 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.2M Mar 4 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 48K Mar 15 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 91K Mar 15 07:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.3M Mar 3 18:30 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 1779686728953

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AirplaneLD-PT-1000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2026-05-25 05:25:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-25 05:25:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:25:31] [INFO ] Load time of PNML (sax parser for PT used): 670 ms
[2026-05-25 05:25:31] [INFO ] Transformed 7019 places.
[2026-05-25 05:25:31] [INFO ] Transformed 8008 transitions.
[2026-05-25 05:25:31] [INFO ] Found NUPN structural information;
[2026-05-25 05:25:31] [INFO ] Parsed PT model containing 7019 places and 8008 transitions and 30528 arcs in 858 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 7019/7019 places, 8008/8008 transitions.
Reduce places removed 3005 places and 0 transitions.
Iterating post reduction 0 with 3005 rules applied. Total rules applied 3005 place count 4014 transition count 8008
Applied a total of 3005 rules in 147 ms. Remains 4014 /7019 variables (removed 3005) and now considering 8008/8008 (removed 0) transitions.
// Phase 1: matrix 8008 rows 4014 cols
[2026-05-25 05:25:33] [INFO ] Computed 1 invariants in 1666 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:25:37] [INFO ] Implicit Places using invariants in 5366 ms returned [4013]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5410 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 4013/7019 places, 8008/8008 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4013 transition count 8006
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4011 transition count 8006
Applied a total of 4 rules in 121 ms. Remains 4011 /4013 variables (removed 2) and now considering 8006/8008 (removed 2) transitions.
// Phase 1: matrix 8006 rows 4011 cols
[2026-05-25 05:25:38] [INFO ] Computed 0 invariants in 1452 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:25:41] [INFO ] Implicit Places using invariants in 4516 ms returned []
[2026-05-25 05:25:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:25:56] [INFO ] Implicit Places using invariants and state equation in 14628 ms returned []
Implicit Place search using SMT with State Equation took 19169 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 4011/7019 places, 8006/8008 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 24868 ms. Remains : 4011/7019 places, 8006/8008 transitions.
Discarding 3999 transitions out of 8006. Remains 4007
Initial state reduction rules removed 5 formulas.
[2026-05-25 05:25:59] [INFO ] Flatten gal took : 1002 ms
[2026-05-25 05:25:59] [INFO ] Flatten gal took : 426 ms
[2026-05-25 05:25:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12858544839197438965.gal : 146 ms
[2026-05-25 05:25:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4851268285429575512.prop : 44 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12858544839197438965.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4851268285429575512.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4851268285429575512.prop.
RANDOM walk for 40000 steps (5748 resets) in 23428 ms. (1 steps per ms) remains 2106/4002 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 31 ms. (3 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 22 ms. (5 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 21 ms. (5 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 22 ms. (5 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 44 ms. (2 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 37 ms. (3 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 24 ms. (4 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 2106/2106 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 2106/2106 properties
[2026-05-25 05:26:03] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2109 variables, 2109/2109 constraints. Problems are: Problem set: 0 solved, 2106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2109/12017 variables, and 2109 constraints, problems are : Problem set: 0 solved, 2106 unsolved in 5178 ms.
Refiners :[Domain max(s): 2109/4011 constraints, State Equation: 0/4011 constraints, PredecessorRefiner: 2106/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2106 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2109 variables, 2109/2109 constraints. Problems are: Problem set: 0 solved, 2106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2109/12017 variables, and 2109 constraints, problems are : Problem set: 0 solved, 2106 unsolved in 5053 ms.
Refiners :[Domain max(s): 2109/4011 constraints, State Equation: 0/4011 constraints, PredecessorRefiner: 2106/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17922ms problems are : Problem set: 0 solved, 2106 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2109 out of 4011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4011/4011 places, 8006/8006 transitions.
Graph (complete) has 5509 edges and 4011 vertex of which 4010 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 4010 transition count 8003
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 4010 transition count 8001
Deduced a syphon composed of 2 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 4007 transition count 8001
Discarding 1889 places :
Symmetric choice reduction at 1 with 1889 rule applications. Total rules 1898 place count 2118 transition count 6112
Iterating global reduction 1 with 1889 rules applied. Total rules applied 3787 place count 2118 transition count 6112
Ensure Unique test removed 1889 transitions
Reduce isomorphic transitions removed 1889 transitions.
Iterating post reduction 1 with 1889 rules applied. Total rules applied 5676 place count 2118 transition count 4223
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 5681 place count 2118 transition count 4218
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 5686 place count 2113 transition count 4218
Applied a total of 5686 rules in 427 ms. Remains 2113 /4011 variables (removed 1898) and now considering 4218/8006 (removed 3788) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 2113/4011 places, 4218/8006 transitions.
SDD proceeding with computation,4002 properties remain. new max is 4
SDD size :1 after 561
RANDOM walk for 597855 steps (88786 resets) in 70116 ms. (8 steps per ms) remains 0/2106 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 4007 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 70081 ms.

BK_STOP 1779686800700

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="AirplaneLD-PT-1000"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is AirplaneLD-PT-1000, 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 r016-oct2-177944372500077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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