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.r408-tall-171690546200108.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 StigmergyCommit-PT-07a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-tall-171690546200108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.4M May 18 16:43 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 1717100346244

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 20:19:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 20:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 20:19:07] [INFO ] Load time of PNML (sax parser for PT used): 445 ms
[2024-05-30 20:19:07] [INFO ] Transformed 292 places.
[2024-05-30 20:19:08] [INFO ] Transformed 7108 transitions.
[2024-05-30 20:19:08] [INFO ] Found NUPN structural information;
[2024-05-30 20:19:08] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 615 ms.
Structural test allowed to assert that 18 places are NOT stable. Took 25 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
RANDOM walk for 40000 steps (11 resets) in 3428 ms. (11 steps per ms) remains 76/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
[2024-05-30 20:19:09] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2024-05-30 20:19:09] [INFO ] Computed 9 invariants in 21 ms
[2024-05-30 20:19:09] [INFO ] State equation strengthened by 621 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 215/291 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 215/299 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 1/292 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 865/1157 variables, 292/593 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1157 variables, 620/1213 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1157 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 1/1158 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 1214 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5039 ms.
Refiners :[Domain max(s): 292/292 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 292/292 constraints, ReadFeed: 621/621 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 215/291 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 215/299 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 20:19:15] [INFO ] Deduced a trap composed of 16 places in 353 ms of which 21 ms to minimize.
[2024-05-30 20:19:15] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 2 ms to minimize.
[2024-05-30 20:19:15] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 2 ms to minimize.
[2024-05-30 20:19:15] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-05-30 20:19:16] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-05-30 20:19:16] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-05-30 20:19:16] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2024-05-30 20:19:16] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-30 20:19:16] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2024-05-30 20:19:16] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-30 20:19:16] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 16 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-30 20:19:17] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-30 20:19:18] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-30 20:19:19] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2024-05-30 20:19:19] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-05-30 20:19:19] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 5 ms to minimize.
[2024-05-30 20:19:19] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-05-30 20:19:19] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
SMT process timed out in 10249ms, After SMT, problems are : Problem set: 0 solved, 76 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 289 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 289 transition count 830
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 61 rules applied. Total rules applied 119 place count 257 transition count 801
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 249 transition count 801
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 127 place count 249 transition count 757
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 215 place count 205 transition count 757
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 241 place count 179 transition count 731
Iterating global reduction 3 with 26 rules applied. Total rules applied 267 place count 179 transition count 731
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 293 place count 153 transition count 705
Iterating global reduction 3 with 26 rules applied. Total rules applied 319 place count 153 transition count 705
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 575 place count 153 transition count 449
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 578 place count 150 transition count 446
Iterating global reduction 4 with 3 rules applied. Total rules applied 581 place count 150 transition count 446
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 584 place count 147 transition count 443
Iterating global reduction 4 with 3 rules applied. Total rules applied 587 place count 147 transition count 443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 589 place count 147 transition count 441
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 605 place count 139 transition count 433
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 612 place count 132 transition count 426
Iterating global reduction 5 with 7 rules applied. Total rules applied 619 place count 132 transition count 426
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 626 place count 125 transition count 419
Iterating global reduction 5 with 7 rules applied. Total rules applied 633 place count 125 transition count 419
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 640 place count 118 transition count 412
Iterating global reduction 5 with 7 rules applied. Total rules applied 647 place count 118 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 658 place count 118 transition count 401
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 672 place count 118 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 678 place count 118 transition count 395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 679 place count 117 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 680 place count 116 transition count 394
Performed 16 Post agglomeration using F-continuation condition with reduction of 241 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 712 place count 100 transition count 137
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 722 place count 100 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 728 place count 100 transition count 121
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 730 place count 100 transition count 121
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 732 place count 100 transition count 119
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 740 place count 92 transition count 111
Applied a total of 740 rules in 317 ms. Remains 92 /292 variables (removed 200) and now considering 111/890 (removed 779) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 92/292 places, 111/890 transitions.
RANDOM walk for 3608 steps (118 resets) in 27 ms. (128 steps per ms) remains 0/76 properties
Able to resolve query StableMarking after proving 275 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 12718 ms.
ITS solved all properties within timeout

BK_STOP 1717100360205

--------------------
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="StigmergyCommit-PT-07a"
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 StigmergyCommit-PT-07a, 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 r408-tall-171690546200108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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