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.r084-tall-174860080700488.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 EisenbergMcGuire-PT-06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700488
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 753K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748741330997

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 01:28:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:28:52] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2025-06-01 01:28:52] [INFO ] Transformed 414 places.
[2025-06-01 01:28:52] [INFO ] Transformed 1296 transitions.
[2025-06-01 01:28:52] [INFO ] Found NUPN structural information;
[2025-06-01 01:28:52] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 263 ms.
RANDOM walk for 40000 steps (8 resets) in 2136 ms. (18 steps per ms) remains 119/414 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 19 ms. (20 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 15 ms. (25 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 4 ms. (80 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 4 ms. (80 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 4 ms. (80 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 4 ms. (80 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 4 ms. (80 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 4 ms. (80 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
[2025-06-01 01:28:53] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2025-06-01 01:28:53] [INFO ] Computed 19 invariants in 22 ms
[2025-06-01 01:28:53] [INFO ] State equation strengthened by 314 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 277/396 variables, 12/131 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 277/408 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 12/408 variables, 6/414 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 12/426 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 702/1110 variables, 408/834 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 314/1148 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1110/1116 variables, and 1148 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5049 ms.
Refiners :[Domain max(s): 408/414 constraints, Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 408/414 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 277/396 variables, 12/131 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 277/408 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 12/408 variables, 6/414 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 12/426 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2025-06-01 01:29:00] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 44 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 3 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 3 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 0 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1116 variables, and 452 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5010 ms.
Refiners :[Domain max(s): 408/414 constraints, Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/414 constraints, ReadFeed: 0/314 constraints, PredecessorRefiner: 0/119 constraints, Known Traps: 26/26 constraints]
After SMT, in 10193ms problems are : Problem set: 0 solved, 119 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 12 place count 408 transition count 1206
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 180 place count 324 transition count 1206
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 210 place count 294 transition count 1026
Iterating global reduction 2 with 30 rules applied. Total rules applied 240 place count 294 transition count 1026
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 264 transition count 996
Applied a total of 300 rules in 140 ms. Remains 264 /414 variables (removed 150) and now considering 996/1296 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 264/414 places, 996/1296 transitions.
RANDOM walk for 4000000 steps (8 resets) in 66635 ms. (60 steps per ms) remains 113/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 112/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 111/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
Probabilistic random walk after 10000001 steps, saw 1607139 distinct states, run finished after 41725 ms. (steps per millisecond=239 ) properties seen :110
[2025-06-01 01:30:14] [INFO ] Flow matrix only has 402 transitions (discarded 594 similar events)
// Phase 1: matrix 402 rows 264 cols
[2025-06-01 01:30:14] [INFO ] Computed 19 invariants in 7 ms
[2025-06-01 01:30:14] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/110 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/166 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/256 variables, 40/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 165/421 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/431 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 235/666 variables, 175/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 137/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 264/264 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/110 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/166 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/256 variables, 40/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 165/421 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/431 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:30:15] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/431 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/431 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 235/666 variables, 175/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 137/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/666 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/666 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 449 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 264/264 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 29 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 17 ms.
Able to resolve query StableMarking after proving 414 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 83115 ms.
ITS solved all properties within timeout

BK_STOP 1748741415503

--------------------
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="EisenbergMcGuire-PT-06"
export BK_EXAMINATION="StableMarking"
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 EisenbergMcGuire-PT-06, 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 r084-tall-174860080700488"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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