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.r098-smll-174860112200188.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 FireWire-PT-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112200188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 97K 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 1748679136048

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 08:12:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 08:12:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:12:19] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-05-31 08:12:19] [INFO ] Transformed 127 places.
[2025-05-31 08:12:19] [INFO ] Transformed 397 transitions.
[2025-05-31 08:12:19] [INFO ] Found NUPN structural information;
[2025-05-31 08:12:19] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 383 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 14 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
RANDOM walk for 40000 steps (2244 resets) in 3175 ms. (12 steps per ms) remains 50/117 properties
BEST_FIRST walk for 4002 steps (62 resets) in 41 ms. (95 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (63 resets) in 70 ms. (56 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (66 resets) in 55 ms. (71 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (48 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (62 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (55 resets) in 34 ms. (114 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (46 resets) in 37 ms. (105 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (47 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (71 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (59 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (60 resets) in 38 ms. (102 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (66 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (63 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (53 resets) in 22 ms. (173 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4003 steps (66 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (64 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (55 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (41 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (48 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (57 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (61 resets) in 39 ms. (100 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (60 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (60 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (50 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (55 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (73 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (59 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (51 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (56 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (60 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (59 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (50 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (65 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (49 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (66 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (57 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (67 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (69 resets) in 50 ms. (78 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (51 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (51 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (68 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (57 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (60 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (53 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (57 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
[2025-05-31 08:12:20] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
// Phase 1: matrix 312 rows 127 cols
[2025-05-31 08:12:20] [INFO ] Computed 8 invariants in 28 ms
[2025-05-31 08:12:20] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 71/120 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 71/126 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 311/435 variables, 124/256 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 44/300 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 3/438 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 1/439 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 16 (OVERLAPS) 0/439 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 307 constraints, problems are : Problem set: 0 solved, 49 unsolved in 3937 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 71/120 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 71/126 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-31 08:12:25] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 34 ms to minimize.
[2025-05-31 08:12:25] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
[2025-05-31 08:12:25] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2025-05-31 08:12:26] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 4/124 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 311/435 variables, 124/260 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 44/304 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 49/353 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-31 08:12:27] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2025-05-31 08:12:27] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-31 08:12:28] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2025-05-31 08:12:28] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 15 (OVERLAPS) 3/438 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 49 unsolved
SMT process timed out in 9090ms, After SMT, problems are : Problem set: 0 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 344/344 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 341
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 125 transition count 337
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 125 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 125 transition count 335
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 122 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 122 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 30 place count 122 transition count 326
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 121 transition count 325
Applied a total of 31 rules in 163 ms. Remains 121 /127 variables (removed 6) and now considering 325/344 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 121/127 places, 325/344 transitions.
RANDOM walk for 4000000 steps (231934 resets) in 26796 ms. (149 steps per ms) remains 31/49 properties
BEST_FIRST walk for 400003 steps (5695 resets) in 551 ms. (724 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5645 resets) in 584 ms. (683 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5592 resets) in 537 ms. (743 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (5725 resets) in 548 ms. (728 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5669 resets) in 663 ms. (602 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5588 resets) in 750 ms. (532 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5687 resets) in 604 ms. (661 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5544 resets) in 551 ms. (724 steps per ms) remains 29/31 properties
BEST_FIRST walk for 400002 steps (5579 resets) in 537 ms. (743 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (5531 resets) in 535 ms. (746 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5708 resets) in 535 ms. (746 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (5607 resets) in 530 ms. (753 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5634 resets) in 540 ms. (739 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (5579 resets) in 538 ms. (742 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5617 resets) in 551 ms. (724 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (5681 resets) in 552 ms. (723 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (5737 resets) in 572 ms. (698 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5698 resets) in 544 ms. (733 steps per ms) remains 26/29 properties
BEST_FIRST walk for 400001 steps (5609 resets) in 608 ms. (656 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5681 resets) in 540 ms. (739 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5568 resets) in 535 ms. (746 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5449 resets) in 534 ms. (747 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5646 resets) in 658 ms. (606 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (5604 resets) in 674 ms. (592 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (5782 resets) in 771 ms. (518 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5620 resets) in 767 ms. (520 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5816 resets) in 546 ms. (731 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5584 resets) in 523 ms. (763 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5776 resets) in 528 ms. (756 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5620 resets) in 549 ms. (727 steps per ms) remains 26/26 properties
[2025-05-31 08:12:43] [INFO ] Flow matrix only has 297 transitions (discarded 28 similar events)
// Phase 1: matrix 297 rows 121 cols
[2025-05-31 08:12:43] [INFO ] Computed 8 invariants in 3 ms
[2025-05-31 08:12:43] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 36/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 164/226 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 99/325 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 23/102 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 86/412 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 22/168 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 6/418 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (OVERLAPS) 0/418 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 174 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 36/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2025-05-31 08:12:45] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 2 ms to minimize.
[2025-05-31 08:12:45] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 164/226 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 99/325 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 24/130 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 86/412 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 22/196 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2025-05-31 08:12:46] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 19 (OVERLAPS) 6/418 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/418 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 203 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 3/3 constraints]
After SMT, in 4676ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 2353 ms.
Support contains 26 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 325/325 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 319
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 319
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 117 transition count 315
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 117 transition count 315
Applied a total of 8 rules in 28 ms. Remains 117 /121 variables (removed 4) and now considering 315/325 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 117/121 places, 315/325 transitions.
RANDOM walk for 4000000 steps (231634 resets) in 18747 ms. (213 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5587 resets) in 523 ms. (763 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5820 resets) in 512 ms. (779 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5597 resets) in 509 ms. (784 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5639 resets) in 516 ms. (773 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5715 resets) in 516 ms. (773 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5609 resets) in 508 ms. (785 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5641 resets) in 512 ms. (779 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5588 resets) in 506 ms. (788 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5872 resets) in 511 ms. (781 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (5469 resets) in 509 ms. (784 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5651 resets) in 505 ms. (790 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5723 resets) in 512 ms. (779 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5633 resets) in 509 ms. (784 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5679 resets) in 500 ms. (798 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5744 resets) in 522 ms. (764 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (5731 resets) in 557 ms. (716 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5827 resets) in 524 ms. (761 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5649 resets) in 518 ms. (770 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5493 resets) in 511 ms. (781 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5499 resets) in 501 ms. (796 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5584 resets) in 527 ms. (757 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (5721 resets) in 514 ms. (776 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5671 resets) in 511 ms. (781 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5583 resets) in 506 ms. (788 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5620 resets) in 508 ms. (785 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5564 resets) in 508 ms. (785 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 6007989 steps, run timeout after 27001 ms. (steps per millisecond=222 ) properties seen :24 out of 26
Probabilistic random walk after 6007989 steps, saw 1147696 distinct states, run finished after 27010 ms. (steps per millisecond=222 ) properties seen :24
[2025-05-31 08:13:26] [INFO ] Flow matrix only has 287 transitions (discarded 28 similar events)
// Phase 1: matrix 287 rows 117 cols
[2025-05-31 08:13:26] [INFO ] Computed 8 invariants in 2 ms
[2025-05-31 08:13:26] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/112 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 40/152 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 165/317 variables, 48/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 23/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/318 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 80/398 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/398 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/398 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/398 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/404 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/404 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/112 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/152 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 165/317 variables, 48/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/318 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/318 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 80/398 variables, 36/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/398 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/398 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/398 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 6/404 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/404 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/404 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/404 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 315/315 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 311
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 106 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 105 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 105 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 104 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 104 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 103 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 103 transition count 281
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 103 transition count 283
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 102 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 102 transition count 279
Applied a total of 35 rules in 109 ms. Remains 102 /117 variables (removed 15) and now considering 279/315 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 102/117 places, 279/315 transitions.
RANDOM walk for 4000000 steps (231602 resets) in 12057 ms. (331 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (56781 resets) in 2405 ms. (1662 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (56599 resets) in 2434 ms. (1642 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 5298581 steps, run timeout after 15001 ms. (steps per millisecond=353 ) properties seen :0 out of 2
Probabilistic random walk after 5298581 steps, saw 1032615 distinct states, run finished after 15002 ms. (steps per millisecond=353 ) properties seen :0
[2025-05-31 08:13:48] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
// Phase 1: matrix 250 rows 102 cols
[2025-05-31 08:13:48] [INFO ] Computed 8 invariants in 2 ms
[2025-05-31 08:13:48] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/28 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 73/101 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/128 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 137/265 variables, 35/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/266 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 80/346 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/352 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/352 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/28 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 73/101 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/128 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 137/265 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/266 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 80/346 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/346 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 6/352 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/352 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/352 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/352 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 477ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 25 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 102/102 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2025-05-31 08:13:49] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:13:49] [INFO ] Invariant cache hit.
[2025-05-31 08:13:49] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-31 08:13:49] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:13:49] [INFO ] Invariant cache hit.
[2025-05-31 08:13:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 08:13:49] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2025-05-31 08:13:49] [INFO ] Redundant transitions in 27 ms returned []
Running 277 sub problems to find dead transitions.
[2025-05-31 08:13:49] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:13:49] [INFO ] Invariant cache hit.
[2025-05-31 08:13:49] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:13:51] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2025-05-31 08:13:51] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2025-05-31 08:13:51] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2025-05-31 08:13:51] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 5 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:13:54] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:13:54] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 159 constraints, problems are : Problem set: 0 solved, 277 unsolved in 14540 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 250/351 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 277/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 436 constraints, problems are : Problem set: 0 solved, 277 unsolved in 20247 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
After SMT, in 35232ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 35246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35846 ms. Remains : 102/102 places, 279/279 transitions.
RANDOM walk for 400000 steps (23131 resets) in 3425 ms. (116 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
[2025-05-31 08:14:25] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:14:25] [INFO ] Invariant cache hit.
[2025-05-31 08:14:25] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 08:14:25] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 08:14:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 08:14:25] [INFO ] After 18ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:14:25] [INFO ] After 56ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 08:14:25] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 08:14:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 08:14:26] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 08:14:26] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:14:26] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 08:14:26] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 4000000 steps (231866 resets) in 9252 ms. (432 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (56360 resets) in 2595 ms. (1540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (55835 resets) in 2832 ms. (1411 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3840503 steps, run timeout after 12001 ms. (steps per millisecond=320 ) properties seen :0 out of 2
Probabilistic random walk after 3840503 steps, saw 743377 distinct states, run finished after 12001 ms. (steps per millisecond=320 ) properties seen :0
[2025-05-31 08:14:42] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:14:42] [INFO ] Invariant cache hit.
[2025-05-31 08:14:42] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/28 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 73/101 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/128 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 137/265 variables, 35/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/266 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 80/346 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/352 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/352 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/28 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 73/101 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/128 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 137/265 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/266 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 80/346 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/346 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 6/352 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/352 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/352 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/352 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 102/102 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2025-05-31 08:14:43] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:14:43] [INFO ] Invariant cache hit.
[2025-05-31 08:14:43] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-31 08:14:43] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:14:43] [INFO ] Invariant cache hit.
[2025-05-31 08:14:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 08:14:43] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2025-05-31 08:14:43] [INFO ] Redundant transitions in 5 ms returned []
Running 277 sub problems to find dead transitions.
[2025-05-31 08:14:43] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:14:43] [INFO ] Invariant cache hit.
[2025-05-31 08:14:43] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:14:44] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2025-05-31 08:14:44] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2025-05-31 08:14:45] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2025-05-31 08:14:45] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2025-05-31 08:14:45] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2025-05-31 08:14:45] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2025-05-31 08:14:45] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2025-05-31 08:14:45] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2025-05-31 08:14:46] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:14:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:14:47] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 159 constraints, problems are : Problem set: 0 solved, 277 unsolved in 15182 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 250/351 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 277/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 436 constraints, problems are : Problem set: 0 solved, 277 unsolved in 17849 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
After SMT, in 33231ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 33235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33600 ms. Remains : 102/102 places, 279/279 transitions.
RANDOM walk for 400000 steps (23054 resets) in 762 ms. (524 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
[2025-05-31 08:15:17] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:15:17] [INFO ] Invariant cache hit.
[2025-05-31 08:15:17] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 08:15:17] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 08:15:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 08:15:17] [INFO ] After 17ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:15:17] [INFO ] After 52ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 08:15:17] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 08:15:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 08:15:17] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 08:15:17] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:15:17] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 08:15:17] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 40000 steps (2370 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (562 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1615790 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :0 out of 1
Probabilistic random walk after 1615790 steps, saw 348504 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
[2025-05-31 08:15:20] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:15:20] [INFO ] Invariant cache hit.
[2025-05-31 08:15:20] [INFO ] State equation strengthened by 38 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/56 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/93 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 172/265 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/266 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 80/346 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/352 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/352 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/56 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/93 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/265 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/266 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 80/346 variables, 36/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/352 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/352 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/352 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/352 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 278
Applied a total of 2 rules in 11 ms. Remains 101 /102 variables (removed 1) and now considering 278/279 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 101/102 places, 278/279 transitions.
RANDOM walk for 40000 steps (2280 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (579 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1645030 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :0 out of 1
Probabilistic random walk after 1645030 steps, saw 355732 distinct states, run finished after 3001 ms. (steps per millisecond=548 ) properties seen :0
[2025-05-31 08:15:23] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
// Phase 1: matrix 249 rows 101 cols
[2025-05-31 08:15:23] [INFO ] Computed 8 invariants in 3 ms
[2025-05-31 08:15:23] [INFO ] State equation strengthened by 38 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/57 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/93 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 08:15:23] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 170/263 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/264 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 80/344 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/344 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/350 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/350 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/350 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/350 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/57 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/93 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 170/263 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/264 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 80/344 variables, 36/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/344 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/350 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/350 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 278/278 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 278/278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 278/278 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-05-31 08:15:24] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2025-05-31 08:15:24] [INFO ] Invariant cache hit.
[2025-05-31 08:15:24] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-31 08:15:24] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2025-05-31 08:15:24] [INFO ] Invariant cache hit.
[2025-05-31 08:15:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 08:15:24] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2025-05-31 08:15:24] [INFO ] Redundant transitions in 5 ms returned []
Running 276 sub problems to find dead transitions.
[2025-05-31 08:15:24] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2025-05-31 08:15:24] [INFO ] Invariant cache hit.
[2025-05-31 08:15:24] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2025-05-31 08:15:25] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 4 ms to minimize.
[2025-05-31 08:15:26] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2025-05-31 08:15:26] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2025-05-31 08:15:26] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2025-05-31 08:15:26] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2025-05-31 08:15:26] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-31 08:15:26] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2025-05-31 08:15:27] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2025-05-31 08:15:27] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2025-05-31 08:15:27] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2025-05-31 08:15:28] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 249/349 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 158 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15553 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/349 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 276/433 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 434 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22668 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 38412ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 38416ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38768 ms. Remains : 101/101 places, 278/278 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 101 vertex of which 29 / 101 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 75 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 74 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 74 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 73 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 72 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 72 transition count 124
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 72 transition count 119
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 118
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 69 transition count 118
Applied a total of 22 rules in 32 ms. Remains 69 /101 variables (removed 32) and now considering 118/278 (removed 160) transitions.
Running SMT prover for 1 properties.
[2025-05-31 08:16:03] [INFO ] Flow matrix only has 116 transitions (discarded 2 similar events)
// Phase 1: matrix 116 rows 69 cols
[2025-05-31 08:16:03] [INFO ] Computed 8 invariants in 1 ms
[2025-05-31 08:16:03] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:16:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 08:16:03] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:16:03] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 08:16:03] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 179 ms.
RANDOM walk for 40000 steps (2369 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (577 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1646316 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :0 out of 1
Probabilistic random walk after 1646316 steps, saw 355830 distinct states, run finished after 3001 ms. (steps per millisecond=548 ) properties seen :0
[2025-05-31 08:16:06] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
// Phase 1: matrix 250 rows 102 cols
[2025-05-31 08:16:06] [INFO ] Computed 8 invariants in 1 ms
[2025-05-31 08:16:06] [INFO ] State equation strengthened by 38 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/20 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/85 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/117 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 148/265 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/266 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 80/346 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/352 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/352 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/20 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/85 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/117 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 148/265 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/266 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 80/346 variables, 36/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/352 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/352 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/352 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/352 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 279/279 transitions.
RANDOM walk for 40000 steps (2324 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (614 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1502637 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :0 out of 1
Probabilistic random walk after 1502637 steps, saw 326055 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
[2025-05-31 08:16:09] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:16:09] [INFO ] Invariant cache hit.
[2025-05-31 08:16:09] [INFO ] State equation strengthened by 38 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/20 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/85 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/117 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 148/265 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/266 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 80/346 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/352 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/352 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/20 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/85 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/117 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 148/265 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/266 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 80/346 variables, 36/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/352 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/352 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/352 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/352 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 102/102 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2025-05-31 08:16:09] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:16:09] [INFO ] Invariant cache hit.
[2025-05-31 08:16:10] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-31 08:16:10] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:16:10] [INFO ] Invariant cache hit.
[2025-05-31 08:16:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 08:16:10] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2025-05-31 08:16:10] [INFO ] Redundant transitions in 3 ms returned []
Running 277 sub problems to find dead transitions.
[2025-05-31 08:16:10] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2025-05-31 08:16:10] [INFO ] Invariant cache hit.
[2025-05-31 08:16:10] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:16:12] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 2 ms to minimize.
[2025-05-31 08:16:12] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2025-05-31 08:16:12] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2025-05-31 08:16:12] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2025-05-31 08:16:12] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 08:16:13] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2025-05-31 08:16:13] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2025-05-31 08:16:13] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2025-05-31 08:16:14] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:16:15] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 08:16:16] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 159 constraints, problems are : Problem set: 0 solved, 277 unsolved in 19908 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 250/351 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 277/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 436 constraints, problems are : Problem set: 0 solved, 277 unsolved in 21397 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
After SMT, in 41533ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 41537ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41949 ms. Remains : 102/102 places, 279/279 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 102 vertex of which 29 / 102 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 76 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 75 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 75 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 74 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 73 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 73 transition count 125
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 73 transition count 120
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 70 transition count 119
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 70 transition count 119
Applied a total of 22 rules in 17 ms. Remains 70 /102 variables (removed 32) and now considering 119/279 (removed 160) transitions.
Running SMT prover for 1 properties.
[2025-05-31 08:16:51] [INFO ] Flow matrix only has 117 transitions (discarded 2 similar events)
// Phase 1: matrix 117 rows 70 cols
[2025-05-31 08:16:51] [INFO ] Computed 8 invariants in 1 ms
[2025-05-31 08:16:51] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:16:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 08:16:52] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:16:52] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 08:16:52] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 102 vertex of which 29 / 102 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 76 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 75 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 75 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 74 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 73 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 73 transition count 125
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 73 transition count 120
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 70 transition count 119
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 70 transition count 119
Applied a total of 22 rules in 15 ms. Remains 70 /102 variables (removed 32) and now considering 119/279 (removed 160) transitions.
Running SMT prover for 2 properties.
[2025-05-31 08:16:52] [INFO ] Flow matrix only has 117 transitions (discarded 2 similar events)
[2025-05-31 08:16:52] [INFO ] Invariant cache hit.
[2025-05-31 08:16:52] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 08:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 08:16:52] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:16:52] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 08:16:52] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 188 ms.
Unable to solve all queries for examination StableMarking. Remains :2 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 2 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 273614 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-08

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 127
TRANSITIONS: 397
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1475
NUPN UNITS: 10
LOADING TIME: 0.552

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.063
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.104
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 877
MODEL NAME: /home/mcc/execution/model
127 places, 397 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StableMarking FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1748679414468

--------------------
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="FireWire-PT-08"
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 FireWire-PT-08, 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 r098-smll-174860112200188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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