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.r140-smll-174876533500137.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 MedleyA-PT-16, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533500137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K 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 1748928543017

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:29:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-03 05:29:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:29:05] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2025-06-03 05:29:05] [INFO ] Transformed 196 places.
[2025-06-03 05:29:05] [INFO ] Transformed 392 transitions.
[2025-06-03 05:29:05] [INFO ] Found NUPN structural information;
[2025-06-03 05:29:05] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 307 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 196/196 places, 392/392 transitions.
Graph (trivial) has 229 edges and 196 vertex of which 13 / 196 are part of one of the 3 SCC in 7 ms
Free SCC test removed 10 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 186 transition count 341
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 43 rules applied. Total rules applied 83 place count 147 transition count 337
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 145 transition count 337
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 85 place count 145 transition count 333
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 93 place count 141 transition count 333
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 175 place count 100 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 182 place count 100 transition count 285
Performed 41 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 264 place count 59 transition count 443
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 307 place count 59 transition count 400
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 321 place count 52 transition count 491
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 327 place count 52 transition count 485
Applied a total of 327 rules in 154 ms. Remains 52 /196 variables (removed 144) and now considering 485/392 (removed -93) transitions.
[2025-06-03 05:29:05] [INFO ] Flow matrix only has 360 transitions (discarded 125 similar events)
// Phase 1: matrix 360 rows 52 cols
[2025-06-03 05:29:05] [INFO ] Computed 7 invariants in 37 ms
[2025-06-03 05:29:06] [INFO ] Implicit Places using invariants in 414 ms returned [19, 34]
[2025-06-03 05:29:06] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 465 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 51/196 places, 483/392 transitions.
Graph (trivial) has 50 edges and 51 vertex of which 6 / 51 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Applied a total of 1 rules in 6 ms. Remains 48 /51 variables (removed 3) and now considering 440/483 (removed 43) transitions.
[2025-06-03 05:29:06] [INFO ] Flow matrix only has 307 transitions (discarded 133 similar events)
// Phase 1: matrix 307 rows 48 cols
[2025-06-03 05:29:06] [INFO ] Computed 6 invariants in 6 ms
[2025-06-03 05:29:06] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-03 05:29:06] [INFO ] Flow matrix only has 307 transitions (discarded 133 similar events)
[2025-06-03 05:29:06] [INFO ] Invariant cache hit.
[2025-06-03 05:29:06] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-03 05:29:06] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 48/196 places, 440/392 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1159 ms. Remains : 48/196 places, 440/392 transitions.
Discarding 318 transitions out of 440. Remains 122
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (6034 resets) in 3530 ms. (11 steps per ms) remains 23/121 properties
BEST_FIRST walk for 4004 steps (158 resets) in 66 ms. (59 steps per ms) remains 19/23 properties
BEST_FIRST walk for 4004 steps (154 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (151 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (158 resets) in 59 ms. (66 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (156 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (161 resets) in 49 ms. (80 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4003 steps (148 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (164 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (153 resets) in 18 ms. (210 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (138 resets) in 18 ms. (210 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4003 steps (152 resets) in 33 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (148 resets) in 46 ms. (85 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (139 resets) in 16 ms. (235 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (162 resets) in 33 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (147 resets) in 36 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (152 resets) in 20 ms. (190 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (159 resets) in 17 ms. (222 steps per ms) remains 11/11 properties
[2025-06-03 05:29:08] [INFO ] Flow matrix only has 307 transitions (discarded 133 similar events)
[2025-06-03 05:29:08] [INFO ] Invariant cache hit.
[2025-06-03 05:29:08] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 15/26 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 22/48 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-03 05:29:08] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 11 ms to minimize.
[2025-06-03 05:29:08] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 306/354 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 73/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-03 05:29:09] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/355 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/355 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 179 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1641 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 15/26 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 22/48 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-03 05:29:09] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 306/354 variables, 48/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 73/179 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 11/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1/355 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/355 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 191 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1356 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints]
After SMT, in 3090ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 10 properties in 549 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 440/440 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 48 transition count 411
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 46 transition count 383
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 46 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 1 with 162 rules applied. Total rules applied 195 place count 46 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 199 place count 44 transition count 240
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 208 place count 44 transition count 231
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 222 place count 35 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 240 place count 35 transition count 208
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 35 transition count 207
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 244 place count 34 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 245 place count 34 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 33 transition count 203
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 12 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 248 place count 31 transition count 203
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 258 place count 31 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 289 place count 31 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 289 place count 31 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 291 place count 30 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 293 place count 29 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 294 place count 29 transition count 159
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 296 place count 28 transition count 158
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 297 place count 28 transition count 157
Applied a total of 297 rules in 125 ms. Remains 28 /48 variables (removed 20) and now considering 157/440 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 28/48 places, 157/440 transitions.
RANDOM walk for 4000000 steps (95 resets) in 7898 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2333855 steps (22 resets) in 3731 ms. (625 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 122 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 10077 ms.
ITS solved all properties within timeout

BK_STOP 1748928555229

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyA-PT-16"
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 MedleyA-PT-16, 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 r140-smll-174876533500137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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