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.r590-smll-171734924900077.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 ltsminxred
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 r590-smll-171734924900077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 89K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717352478746

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:21:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:21:21] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-06-02 18:21:21] [INFO ] Transformed 196 places.
[2024-06-02 18:21:21] [INFO ] Transformed 392 transitions.
[2024-06-02 18:21:21] [INFO ] Found NUPN structural information;
[2024-06-02 18:21:21] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 409 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 11 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 5 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 2 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 3 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 3 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 262 ms. Remains 52 /196 variables (removed 144) and now considering 485/392 (removed -93) transitions.
[2024-06-02 18:21:22] [INFO ] Flow matrix only has 360 transitions (discarded 125 similar events)
// Phase 1: matrix 360 rows 52 cols
[2024-06-02 18:21:22] [INFO ] Computed 7 invariants in 35 ms
[2024-06-02 18:21:22] [INFO ] Implicit Places using invariants in 490 ms returned [19, 34]
[2024-06-02 18:21:22] [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 657 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 1 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 9 ms. Remains 48 /51 variables (removed 3) and now considering 440/483 (removed 43) transitions.
[2024-06-02 18:21:22] [INFO ] Flow matrix only has 307 transitions (discarded 133 similar events)
// Phase 1: matrix 307 rows 48 cols
[2024-06-02 18:21:22] [INFO ] Computed 6 invariants in 8 ms
[2024-06-02 18:21:22] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-02 18:21:22] [INFO ] Flow matrix only has 307 transitions (discarded 133 similar events)
[2024-06-02 18:21:22] [INFO ] Invariant cache hit.
[2024-06-02 18:21:23] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-02 18:21:23] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 742 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 1727 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 (6056 resets) in 4234 ms. (9 steps per ms) remains 30/121 properties
BEST_FIRST walk for 4004 steps (168 resets) in 51 ms. (77 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4000 steps (400 resets) in 54 ms. (72 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (400 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (145 resets) in 37 ms. (105 steps per ms) remains 24/27 properties
BEST_FIRST walk for 4003 steps (151 resets) in 44 ms. (88 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (148 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (144 resets) in 35 ms. (111 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (156 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (158 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (149 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (168 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (142 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (170 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (147 resets) in 37 ms. (105 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (151 resets) in 18 ms. (210 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (135 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (139 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (151 resets) in 31 ms. (125 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4003 steps (139 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (166 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (149 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (157 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (153 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (160 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
[2024-06-02 18:21:25] [INFO ] Flow matrix only has 307 transitions (discarded 133 similar events)
[2024-06-02 18:21:25] [INFO ] Invariant cache hit.
[2024-06-02 18:21:25] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 16/26 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 22/48 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 18:21:25] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 11 ms to minimize.
[2024-06-02 18:21:26] [INFO ] Deduced a trap composed of 9 places in 138 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, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 306/354 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 73/177 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 18:21:26] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 3 ms to minimize.
[2024-06-02 18:21:26] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 1/355 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/355 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 180 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2746 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: 17/17 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 16/26 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 22/48 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 306/354 variables, 48/107 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 73/180 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 17/197 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 1/355 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/355 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 198 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2256 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: 17/17 constraints, Known Traps: 5/5 constraints]
After SMT, in 5165ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 1165 ms.
Support contains 10 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 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 197 place count 45 transition count 234
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 203 place count 45 transition count 228
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 214 place count 39 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 39 transition count 222
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 38 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 37 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 3 with 44 rules applied. Total rules applied 261 place count 37 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 261 place count 37 transition count 176
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 36 transition count 176
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 36 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 35 transition count 175
Applied a total of 265 rules in 103 ms. Remains 35 /48 variables (removed 13) and now considering 175/440 (removed 265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 35/48 places, 175/440 transitions.
RANDOM walk for 4000000 steps (163 resets) in 19243 ms. (207 steps per ms) remains 8/17 properties
BEST_FIRST walk for 4000002 steps (30 resets) in 4215 ms. (948 steps per ms) remains 4/8 properties
BEST_FIRST walk for 4000000 steps (175 resets) in 8756 ms. (456 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000001 steps (128 resets) in 5802 ms. (689 steps per ms) remains 2/3 properties
BEST_FIRST walk for 3002508 steps (224 resets) in 7453 ms. (402 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 122 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 24873 ms.
ITS solved all properties within timeout

BK_STOP 1717352506228

--------------------
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="MedleyA-PT-16"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
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 r590-smll-171734924900077"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;