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.r154-tall-174876825200157.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 NoC3x3-PT-7A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825200157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 355K 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 1748841660158

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-7A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:21:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 05:21:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:21:01] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2025-06-02 05:21:01] [INFO ] Transformed 801 places.
[2025-06-02 05:21:01] [INFO ] Transformed 1544 transitions.
[2025-06-02 05:21:01] [INFO ] Found NUPN structural information;
[2025-06-02 05:21:01] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 228 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 801/801 places, 1544/1544 transitions.
Graph (trivial) has 860 edges and 801 vertex of which 110 / 801 are part of one of the 9 SCC in 6 ms
Free SCC test removed 101 places
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 320 transitions.
Performed 124 Post agglomeration using F-continuation condition with reduction of 40 identical transitions.
Deduced a syphon composed of 124 places in 2 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 0 with 248 rules applied. Total rules applied 249 place count 576 transition count 1060
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 349 place count 576 transition count 960
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 379 place count 561 transition count 939
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 390 place count 561 transition count 928
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 418 place count 547 transition count 936
Applied a total of 418 rules in 122 ms. Remains 547 /801 variables (removed 254) and now considering 936/1544 (removed 608) transitions.
[2025-06-02 05:21:01] [INFO ] Flow matrix only has 825 transitions (discarded 111 similar events)
// Phase 1: matrix 825 rows 547 cols
[2025-06-02 05:21:01] [INFO ] Computed 111 invariants in 41 ms
[2025-06-02 05:21:02] [INFO ] Implicit Places using invariants in 598 ms returned [13, 49, 51, 53, 54, 105, 107, 109, 110, 158, 160, 162, 163, 224, 226, 228, 230, 233, 235, 237, 239, 240, 316, 318, 320, 322, 325, 327, 329, 330, 383, 385, 388, 390, 392, 393, 428, 430, 432, 435, 437, 439, 442, 444, 446, 448, 449, 505, 507, 509, 512, 514, 516, 517]
Discarding 54 places :
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Implicit Place search using SMT only with invariants took 628 ms to find 54 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 493/801 places, 915/1544 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 493 transition count 775
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 1 with 179 rules applied. Total rules applied 319 place count 353 transition count 736
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 337 place count 344 transition count 748
Applied a total of 337 rules in 20 ms. Remains 344 /493 variables (removed 149) and now considering 748/915 (removed 167) transitions.
[2025-06-02 05:21:02] [INFO ] Flow matrix only has 658 transitions (discarded 90 similar events)
// Phase 1: matrix 658 rows 344 cols
[2025-06-02 05:21:02] [INFO ] Computed 57 invariants in 3 ms
[2025-06-02 05:21:02] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 05:21:02] [INFO ] Flow matrix only has 658 transitions (discarded 90 similar events)
[2025-06-02 05:21:02] [INFO ] Invariant cache hit.
[2025-06-02 05:21:03] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-02 05:21:03] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 344/801 places, 748/1544 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1592 ms. Remains : 344/801 places, 748/1544 transitions.
Discarding 303 transitions out of 748. Remains 445
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 3487 ms. (11 steps per ms) remains 18/444 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
[2025-06-02 05:21:04] [INFO ] Flow matrix only has 658 transitions (discarded 90 similar events)
[2025-06-02 05:21:04] [INFO ] Invariant cache hit.
[2025-06-02 05:21:04] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 122/149 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 122/168 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 195/344 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 195/404 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 657/1001 variables, 344/756 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1001 variables, 78/834 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1001 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 1/1002 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1002 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 0/1002 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 835 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3114 ms.
Refiners :[Domain max(s): 344/344 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 344/344 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 122/149 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 122/168 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 195/344 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 195/404 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 05:21:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2025-06-02 05:21:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2025-06-02 05:21:08] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-06-02 05:21:08] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2025-06-02 05:21:08] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 5/417 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 657/1001 variables, 344/761 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1001 variables, 78/839 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1001 variables, 18/857 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1001 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 1/1002 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1002 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/1002 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 858 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2301 ms.
Refiners :[Domain max(s): 344/344 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 344/344 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 16/16 constraints]
After SMT, in 5477ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 11 different solutions.
Parikh walk visited 15 properties in 6076 ms.
Support contains 5 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 748/748 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 344 transition count 739
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 76 place count 277 transition count 591
Iterating global reduction 1 with 67 rules applied. Total rules applied 143 place count 277 transition count 591
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 151 place count 277 transition count 583
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 2 with 83 rules applied. Total rules applied 234 place count 277 transition count 500
Free-agglomeration rule applied 40 times with reduction of 25 identical transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 274 place count 277 transition count 435
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 69 rules applied. Total rules applied 343 place count 237 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 350 place count 237 transition count 399
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 352 place count 237 transition count 397
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 356 place count 235 transition count 395
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 369 place count 235 transition count 421
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 389 place count 222 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 411 place count 222 transition count 392
Partial Free-agglomeration rule applied 33 times.
Drop transitions (Partial Free agglomeration) removed 33 transitions
Iterating global reduction 5 with 33 rules applied. Total rules applied 444 place count 222 transition count 392
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 445 place count 221 transition count 391
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 448 place count 218 transition count 391
Applied a total of 448 rules in 122 ms. Remains 218 /344 variables (removed 126) and now considering 391/748 (removed 357) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 218/344 places, 391/748 transitions.
RANDOM walk for 249723 steps (0 resets) in 1504 ms. (165 steps per ms) remains 0/3 properties
Able to resolve query QuasiLiveness after proving 445 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 15579 ms.
ITS solved all properties within timeout

BK_STOP 1748841677095

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="NoC3x3-PT-7A"
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 NoC3x3-PT-7A, 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 r154-tall-174876825200157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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