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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 460K 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 1748741214885

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:26:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 01:26:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:26:56] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-06-01 01:26:56] [INFO ] Transformed 295 places.
[2025-06-01 01:26:56] [INFO ] Transformed 800 transitions.
[2025-06-01 01:26:56] [INFO ] Found NUPN structural information;
[2025-06-01 01:26:56] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 252 ms.
RANDOM walk for 40000 steps (8 resets) in 2279 ms. (17 steps per ms) remains 79/295 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 78/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 77/77 properties
[2025-06-01 01:26:57] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2025-06-01 01:26:57] [INFO ] Computed 16 invariants in 19 ms
[2025-06-01 01:26:57] [INFO ] State equation strengthened by 196 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 203/280 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 203/290 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 10/290 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 10/305 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 465/755 variables, 290/595 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 196/791 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/755 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 5/760 variables, 5/796 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 5/801 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 1/802 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/760 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/760 variables, and 802 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5057 ms.
Refiners :[Domain max(s): 295/295 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 295/295 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 203/280 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 203/290 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 10/290 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 10/305 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 34 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 3 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 3 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 5/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 465/755 variables, 290/620 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/755 variables, 196/816 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/760 variables, and 856 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5021 ms.
Refiners :[Domain max(s): 290/295 constraints, Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 290/295 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 40/77 constraints, Known Traps: 25/25 constraints]
After SMT, in 10196ms problems are : Problem set: 0 solved, 77 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 10 place count 290 transition count 735
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 130 place count 230 transition count 735
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 150 place count 210 transition count 635
Iterating global reduction 2 with 20 rules applied. Total rules applied 170 place count 210 transition count 635
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 190 transition count 615
Applied a total of 210 rules in 100 ms. Remains 190 /295 variables (removed 105) and now considering 615/800 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 190/295 places, 615/800 transitions.
RANDOM walk for 4000000 steps (8 resets) in 32581 ms. (122 steps per ms) remains 73/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 603 ms. (662 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 599 ms. (666 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 72/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 70/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 69/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 581 ms. (687 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 586 ms. (681 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 593 ms. (673 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 575 ms. (694 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 588 ms. (679 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 719 ms. (555 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 594 ms. (672 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 661 ms. (604 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 602 ms. (663 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 576 ms. (693 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 629 ms. (634 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 572 ms. (698 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 576 ms. (693 steps per ms) remains 68/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 581 ms. (687 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 582 ms. (686 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 575 ms. (694 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 576 ms. (693 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 576 ms. (693 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 632 ms. (631 steps per ms) remains 65/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 741 ms. (539 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 571 ms. (699 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 566 ms. (705 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 571 ms. (699 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 568 ms. (702 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 566 ms. (705 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 570 ms. (700 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 701 ms. (569 steps per ms) remains 65/65 properties
[2025-06-01 01:27:27] [INFO ] Flow matrix only has 280 transitions (discarded 335 similar events)
// Phase 1: matrix 280 rows 190 cols
[2025-06-01 01:27:27] [INFO ] Computed 16 invariants in 2 ms
[2025-06-01 01:27:27] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 110/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 10/185 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 280/465 variables, 185/200 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 116/316 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 5/470 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/470 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 322 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2650 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 190/190 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 110/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 10/185 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 2 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 280/465 variables, 185/221 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 116/337 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 38/375 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 5/470 variables, 5/380 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/470 variables, 27/408 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2025-06-01 01:27:34] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:27:34] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:27:34] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 4 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/470 variables, 14/422 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/470 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 16 (OVERLAPS) 0/470 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 422 constraints, problems are : Problem set: 0 solved, 65 unsolved in 9061 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 190/190 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 35/35 constraints]
After SMT, in 11736ms problems are : Problem set: 0 solved, 65 unsolved
Parikh walk visited 12 properties in 4787 ms.
Support contains 53 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 615/615 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 190 transition count 610
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 185 transition count 610
Applied a total of 10 rules in 31 ms. Remains 185 /190 variables (removed 5) and now considering 610/615 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 185/190 places, 610/615 transitions.
RANDOM walk for 4000000 steps (8 resets) in 28139 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 542 ms. (736 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 530 ms. (753 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 530 ms. (753 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 534 ms. (747 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 527 ms. (757 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 533 ms. (749 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 527 ms. (757 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 537 ms. (743 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 545 ms. (732 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 540 ms. (739 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 533 ms. (749 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 537 ms. (743 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 534 ms. (747 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 539 ms. (740 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 538 ms. (742 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 534 ms. (747 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 530 ms. (753 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 530 ms. (753 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 531 ms. (751 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 531 ms. (751 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 530 ms. (753 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 525 ms. (760 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 528 ms. (756 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 527 ms. (757 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 531 ms. (751 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 547 ms. (729 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 543 ms. (735 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 539 ms. (740 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 526 ms. (759 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 531 ms. (751 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 531 ms. (751 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 537 ms. (743 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 531 ms. (751 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 528 ms. (756 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 527 ms. (757 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 528 ms. (756 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 526 ms. (759 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 537 ms. (743 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 533 ms. (749 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 539 ms. (740 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 547 ms. (729 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 544 ms. (733 steps per ms) remains 53/53 properties
Interrupted probabilistic random walk after 10671678 steps, run timeout after 42001 ms. (steps per millisecond=254 ) properties seen :50 out of 53
Probabilistic random walk after 10671678 steps, saw 1793443 distinct states, run finished after 42006 ms. (steps per millisecond=254 ) properties seen :50
[2025-06-01 01:28:40] [INFO ] Flow matrix only has 275 transitions (discarded 335 similar events)
// Phase 1: matrix 275 rows 185 cols
[2025-06-01 01:28:40] [INFO ] Computed 16 invariants in 2 ms
[2025-06-01 01:28:40] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 55/91 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 37/128 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 64/192 variables, 28/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 108/300 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/300 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/308 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 152/460 variables, 116/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/460 variables, 93/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/460 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/460 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 317 constraints, problems are : Problem set: 0 solved, 3 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-01 01:28:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 55/91 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 37/128 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 64/192 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 108/300 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/300 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 8/308 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/308 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-01 01:28:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/308 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/308 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 152/460 variables, 116/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/460 variables, 93/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 3 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 8 ms.
Able to resolve query StableMarking after proving 295 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 104846 ms.
ITS solved all properties within timeout

BK_STOP 1748741321205

--------------------
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-05"
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-05, 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-174860080700483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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