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.r586-smll-171734923800088.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 greatspnxred
Input is MedleyA-PT-18, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923800088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717352554149

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:22:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:22:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:22:36] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-06-02 18:22:37] [INFO ] Transformed 252 places.
[2024-06-02 18:22:37] [INFO ] Transformed 543 transitions.
[2024-06-02 18:22:37] [INFO ] Found NUPN structural information;
[2024-06-02 18:22:37] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 432 ms.
Graph (trivial) has 293 edges and 252 vertex of which 13 / 252 are part of one of the 3 SCC in 6 ms
Free SCC test removed 10 places
Structural test allowed to assert that 42 places are NOT stable. Took 42 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (1536 resets) in 4543 ms. (8 steps per ms) remains 203/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 23 ms. (16 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 27 ms. (14 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 203/203 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 203/203 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 203/203 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 203/203 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 203/203 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 203/203 properties
Probabilistic random walk after 100001 steps, saw 21150 distinct states, run finished after 1571 ms. (steps per millisecond=63 ) properties seen :187
[2024-06-02 18:22:40] [INFO ] Flow matrix only has 529 transitions (discarded 2 similar events)
// Phase 1: matrix 529 rows 242 cols
[2024-06-02 18:22:40] [INFO ] Computed 7 invariants in 40 ms
[2024-06-02 18:22:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 152/168 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 152/173 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 74/242 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 528/770 variables, 242/491 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/770 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/771 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/771 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/771 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 492 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1958 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 242/242 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 152/168 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 152/173 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:22:43] [INFO ] Deduced a trap composed of 37 places in 375 ms of which 49 ms to minimize.
[2024-06-02 18:22:43] [INFO ] Deduced a trap composed of 34 places in 332 ms of which 4 ms to minimize.
[2024-06-02 18:22:43] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 4 ms to minimize.
[2024-06-02 18:22:43] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 4 ms to minimize.
[2024-06-02 18:22:44] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 3 ms to minimize.
[2024-06-02 18:22:44] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 4 ms to minimize.
[2024-06-02 18:22:44] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-06-02 18:22:44] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 4 ms to minimize.
[2024-06-02 18:22:45] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-02 18:22:45] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 6 ms to minimize.
[2024-06-02 18:22:45] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 5 ms to minimize.
[2024-06-02 18:22:45] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 3 ms to minimize.
[2024-06-02 18:22:46] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 3 ms to minimize.
[2024-06-02 18:22:46] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 3 ms to minimize.
[2024-06-02 18:22:46] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:22:46] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 16/189 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:22:46] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2024-06-02 18:22:47] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:22:47] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:22:47] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 168/771 variables, and 193 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5024 ms.
Refiners :[Domain max(s): 168/242 constraints, Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/242 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 20/20 constraints]
After SMT, in 7140ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 531/531 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 242 transition count 471
Reduce places removed 57 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 61 rules applied. Total rules applied 121 place count 185 transition count 467
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 183 transition count 467
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 123 place count 183 transition count 459
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 139 place count 175 transition count 459
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 169 place count 145 transition count 404
Iterating global reduction 3 with 30 rules applied. Total rules applied 199 place count 145 transition count 404
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 3 with 2 rules applied. Total rules applied 201 place count 145 transition count 402
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 203 place count 143 transition count 402
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 203 place count 143 transition count 397
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 213 place count 138 transition count 397
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 216 place count 135 transition count 377
Iterating global reduction 5 with 3 rules applied. Total rules applied 219 place count 135 transition count 377
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 221 place count 133 transition count 373
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 133 transition count 373
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 267 place count 111 transition count 351
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 273 place count 111 transition count 345
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 275 place count 109 transition count 341
Iterating global reduction 6 with 2 rules applied. Total rules applied 277 place count 109 transition count 341
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 279 place count 107 transition count 333
Iterating global reduction 6 with 2 rules applied. Total rules applied 281 place count 107 transition count 333
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -118
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 317 place count 89 transition count 451
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 335 place count 89 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 354 place count 89 transition count 414
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 360 place count 86 transition count 411
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 381 place count 86 transition count 390
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 7 with 61 rules applied. Total rules applied 442 place count 65 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 476 place count 65 transition count 316
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 477 place count 65 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 478 place count 64 transition count 330
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 479 place count 63 transition count 329
Applied a total of 479 rules in 417 ms. Remains 63 /242 variables (removed 179) and now considering 329/531 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 63/242 places, 329/531 transitions.
RANDOM walk for 320216 steps (25779 resets) in 2939 ms. (108 steps per ms) remains 0/16 properties
Able to resolve query StableMarking after proving 212 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 12239 ms.
ITS solved all properties within timeout

BK_STOP 1717352568846

--------------------
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 StableMarking -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-18"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MedleyA-PT-18, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r586-smll-171734923800088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;