About the Execution of 2024-gold for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15689.090 | 533807.00 | 1053418.00 | 1007.70 | F | normal |
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.r154-tall-174876825600383.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 Peterson-PT-4, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825600383
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 234K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 469K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 298K 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 1748844431155
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 06:07:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 06:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:07:12] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-02 06:07:12] [INFO ] Transformed 480 places.
[2025-06-02 06:07:12] [INFO ] Transformed 690 transitions.
[2025-06-02 06:07:12] [INFO ] Found NUPN structural information;
[2025-06-02 06:07:12] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 198 ms.
RANDOM walk for 40000 steps (8 resets) in 2073 ms. (19 steps per ms) remains 216/480 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 216/216 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 216/216 properties
[2025-06-02 06:07:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2025-06-02 06:07:13] [INFO ] Computed 19 invariants in 20 ms
[2025-06-02 06:07:13] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 234/450 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 234/455 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 (/ 1.0 96.0))
(s22 0.0)
(s23 (/ 1.0 96.0))
(s24 (/ 1.0 96.0))
(s25 0.0)
(s26 0.0)
(s27 (/ 1.0 96.0))
(s28 (/ 1.0 96.0))
(s29 0.0)
(s30 (/ 1.0 96.0))
(s31 (/ 1.0 96.0))
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 (/ 1.0 96.0))
(s36 (/ 1.0 96.0))
(s37 (/ 1.0 96.0))
(s38 (/ 1.0 96.0))
(s39 (/ 1.0 96.0))
(s40 (/ 1.0 96.0))
(s41 (/ 1.0 96.0))
(s42 (/ 1.0 96.0))
(s43 (/ 1.0 96.0))
(s44 (/ 1.0 96.0))
(s45 (/ 1.0 96.0))
(s46 (/ 1.0 96.0))
(s47 (/ 1.0 96.0))
(s48 (/ 1.0 96.0))
(s49 (/ 1.0 96.0))
(s50 (/ 1.0 96.0))
(s51 (/ 1.0 96.0))
(s52 (/ 1.0 96.0))
(s53 (/ 1.0 96.0))
(s54 (/ 1.0 96.0))
(s55 (/ 1.0 96.0))
(s56 (/ 1.0 96.0))
(s57 (/ 1.0 96.0))
(s58 (/ 1.0 96.0))
(s59 (/ 1.0 96.0))
(s60 (/ 1.0 96.0))
(s61 (/ 1.0 96.0))
(s62 (/ 1.0 96.0))
(s63 (/ 1.0 96.0))
(s64 (/ 1.0 96.0))
(s65 (/ 1.0 96.0))
(s66 (/ 1.0 96.0))
(s67 (/ 1.0 96.0))
(s68 (/ 1.0 96.0))
(s69 (/ 1.0 96.0))
(s70 (/ 1.0 96.0))
(s71 (/ 1.0 96.0))
(s72 (/ 1.0 96.0))
(s73 (/ 1.0 96.0))
(s74 (/ 1.0 96.0))
(s75 (/ 1.0 96.0))
(s76 (/ 1.0 96.0))
(s77 (/ 1.0 96.0))
(s78 (/ 1.0 96.0))
(s79 (/ 1.0 96.0))
(s80 (/ 1.0 96.0))
(s81 (/ 1.0 96.0))
(s82 (/ 1.0 96.0))
(s83 (/ 1.0 96.0))
(s84 (/ 1.0 96.0))
(s85 (/ 1.0 96.0))
(s86 (/ 1.0 96.0))
(s87 (/ 1.0 96.0))
(s88 (/ 1.0 96.0))
(s89 (/ 1.0 96.0))
(s90 (/ 1.0 96.0))
(s91 (/ 1.0 96.0))
(s92 (/ 1.0 96.0))
(s93 (/ 1.0 96.0))
(s94 0.0)
(s95 (/ 1.0 96.0))
(s96 (/ 1.0 96.0))
(s97 (/ 1.0 96.0))
(s98 (/ 1.0 96.0))
(s99 (/ 1.0 96.0))
(s100 (/ 1.0 96.0))
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 (/ 1.0 96.0))
(s158 (/ 1.0 96.0))
(s159 0.0)
(s160 0.0)
(s161 (/ 1.0 96.0))
(s162 0.0)
(s163 0.0)
(s164 (/ 1.0 96.0))
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 (/ 49.0 96.0))
(s170 (/ 1.0 96.0))
(s171 (/ 1.0 96.0))
(s172 0.0)
(s173 (/ 1.0 96.0))
(s174 (/ 1.0 96.0))
(s175 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/1110 variables, and 455 constraints, problems are : Problem set: 0 solved, 216 unsolved in 5188 ms.
Refiners :[Domain max(s): 450/480 constraints, Positive P Invariants (semi-flows): 5/14 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 234/450 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 234/455 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 5/455 variables, 5/460 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 5/465 constraints. Problems are: Problem set: 0 solved, 216 unsolved
(s81 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0timeout
)
(s82 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1110 variables, and 465 constraints, problems are : Problem set: 0 solved, 216 unsolved in 5011 ms.
Refiners :[Domain max(s): 455/480 constraints, Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 10334ms problems are : Problem set: 0 solved, 216 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 216 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 480 transition count 606
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 396 transition count 606
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 168 place count 396 transition count 546
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 288 place count 336 transition count 546
Applied a total of 288 rules in 67 ms. Remains 336 /480 variables (removed 144) and now considering 546/690 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 336/480 places, 546/690 transitions.
RANDOM walk for 4000000 steps (8 resets) in 51842 ms. (77 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 212/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 201/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 190/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 186/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 182/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 178/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 178/178 properties
[2025-06-02 06:07:40] [INFO ] Flow matrix only has 486 transitions (discarded 60 similar events)
// Phase 1: matrix 486 rows 336 cols
[2025-06-02 06:07:40] [INFO ] Computed 19 invariants in 4 ms
[2025-06-02 06:07:40] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 128/306 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 5/311 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 5/316 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (OVERLAPS) 486/802 variables, 316/647 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 116/763 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/802 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (OVERLAPS) 20/822 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/822 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/822 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 18 (OVERLAPS) 0/822 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 807 constraints, problems are : Problem set: 0 solved, 178 unsolved in 18259 ms.
Refiners :[Domain max(s): 336/336 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 336/336 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 128/306 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 5/311 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 5/316 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2025-06-02 06:08:01] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 20 ms to minimize.
[2025-06-02 06:08:01] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:08:01] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:08:01] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2025-06-02 06:08:02] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:08:02] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 2 ms to minimize.
[2025-06-02 06:08:02] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:08:02] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:08:02] [INFO ] Deduced a trap composed of 112 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:08:02] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (OVERLAPS) 486/802 variables, 316/657 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/802 variables, 116/773 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 178/951 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/802 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (OVERLAPS) 20/822 variables, 20/971 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/822 variables, 20/991 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/822 variables, 4/995 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2025-06-02 06:08:26] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2025-06-02 06:08:26] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:08:26] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:08:27] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:08:28] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:08:28] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:08:28] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2025-06-02 06:08:28] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:08:28] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 3 ms to minimize.
[2025-06-02 06:08:28] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2025-06-02 06:08:28] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:08:28] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/822 variables, 20/1015 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2025-06-02 06:08:34] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:08:34] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:08:34] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:08:34] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 3 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 3 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:08:35] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:08:36] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:08:36] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:08:36] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2025-06-02 06:08:36] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:08:36] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:08:36] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:08:36] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/822 variables, 20/1035 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/822 variables, and 1035 constraints, problems are : Problem set: 0 solved, 178 unsolved in 45031 ms.
Refiners :[Domain max(s): 336/336 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 336/336 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 50/50 constraints]
After SMT, in 63351ms problems are : Problem set: 0 solved, 178 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 178 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 546/546 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 336 transition count 524
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 314 transition count 524
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 44 place count 314 transition count 516
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 60 place count 306 transition count 516
Applied a total of 60 rules in 32 ms. Remains 306 /336 variables (removed 30) and now considering 516/546 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 306/336 places, 516/546 transitions.
RANDOM walk for 4000000 steps (8 resets) in 47353 ms. (84 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 174/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 173/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 169/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 169/169 properties
Interrupted probabilistic random walk after 7865964 steps, run timeout after 57001 ms. (steps per millisecond=137 ) properties seen :85 out of 169
Probabilistic random walk after 7865964 steps, saw 1311194 distinct states, run finished after 57007 ms. (steps per millisecond=137 ) properties seen :85
[2025-06-02 06:09:59] [INFO ] Flow matrix only has 456 transitions (discarded 60 similar events)
// Phase 1: matrix 456 rows 306 cols
[2025-06-02 06:09:59] [INFO ] Computed 19 invariants in 3 ms
[2025-06-02 06:09:59] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 96/180 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 96/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 3/183 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 3/186 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 288/474 variables, 186/381 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 48/429 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 52/526 variables, 20/449 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 20/469 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 18 (OVERLAPS) 80/606 variables, 16/489 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 16/505 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 68/573 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 22 (OVERLAPS) 80/686 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/686 variables, 80/655 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/686 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 25 (OVERLAPS) 2/688 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/688 variables, 2/659 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/688 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 28 (OVERLAPS) 2/690 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/690 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/690 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 31 (OVERLAPS) 72/762 variables, 84/747 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/762 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 33 (OVERLAPS) 0/762 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 747 constraints, problems are : Problem set: 0 solved, 84 unsolved in 11580 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 306/306 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 96/180 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 96/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 3/183 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 3/186 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:12] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 3 ms to minimize.
[2025-06-02 06:10:12] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:10:12] [INFO ] Deduced a trap composed of 100 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 288/474 variables, 186/384 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 48/432 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 81/513 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 16 (OVERLAPS) 52/526 variables, 20/533 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 20/553 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:15] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:10:15] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:10:15] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:10:15] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 5 ms to minimize.
[2025-06-02 06:10:15] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:10:15] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:10:16] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 7/564 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 21 (OVERLAPS) 80/606 variables, 16/580 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 16/596 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 68/664 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:10:20] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 0 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:10:21] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 19/683 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:24] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/606 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:25] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:10:25] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/606 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/606 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 28 (OVERLAPS) 80/686 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/686 variables, 80/768 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:10:31] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2025-06-02 06:10:32] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2025-06-02 06:10:33] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/686 variables, 20/788 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:35] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:10:35] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:10:35] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:10:36] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:10:36] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:10:36] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2025-06-02 06:10:37] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:10:37] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:10:38] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/686 variables, 9/797 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:42] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/686 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:10:46] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:10:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2025-06-02 06:10:47] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/686 variables, 3/801 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/686 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 35 (OVERLAPS) 2/688 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/688 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:11:00] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/688 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:11:04] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/688 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/688 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 40 (OVERLAPS) 2/690 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/690 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/690 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-02 06:11:18] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:11:19] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:11:19] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:11:19] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2025-06-02 06:11:19] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:11:19] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:11:19] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:11:19] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:11:20] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:11:20] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:11:20] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:11:20] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:11:20] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2025-06-02 06:11:20] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:11:21] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-06-02 06:11:21] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:11:21] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:11:21] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:11:21] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2025-06-02 06:11:21] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/690 variables, 20/834 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/762 variables, and 834 constraints, problems are : Problem set: 0 solved, 84 unsolved in 75007 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 222/306 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 87/87 constraints]
After SMT, in 86609ms problems are : Problem set: 0 solved, 84 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 516/516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 306 transition count 470
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 260 transition count 470
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 92 place count 260 transition count 450
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 132 place count 240 transition count 450
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 148 place count 232 transition count 442
Applied a total of 148 rules in 37 ms. Remains 232 /306 variables (removed 74) and now considering 442/516 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 232/306 places, 442/516 transitions.
RANDOM walk for 4000000 steps (8 resets) in 44752 ms. (89 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 859 ms. (465 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 976 ms. (409 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1191 ms. (335 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 878 ms. (455 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 879 ms. (454 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 975 ms. (409 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 900 ms. (443 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 886 ms. (450 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 935 ms. (427 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 799 ms. (500 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 897 ms. (445 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 858 ms. (465 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 968 ms. (412 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 878 ms. (455 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 966 ms. (413 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 829 ms. (481 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 878 ms. (455 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 910 ms. (439 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 949 ms. (421 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 847 ms. (471 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 941 ms. (424 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 927 ms. (431 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 882 ms. (453 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 955 ms. (418 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 781 ms. (511 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 910 ms. (439 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 882 ms. (453 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1315 ms. (303 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 964 ms. (414 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 960 ms. (416 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 956 ms. (417 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 944 ms. (423 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 873 ms. (457 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 953 ms. (419 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 849 ms. (470 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 930 ms. (429 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 955 ms. (418 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1001 ms. (399 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 871 ms. (458 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1201 ms. (332 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 832 ms. (480 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 895 ms. (446 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 957 ms. (417 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 838 ms. (476 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 842 ms. (474 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 867 ms. (460 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 809 ms. (493 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 816 ms. (489 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 795 ms. (502 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 797 ms. (501 steps per ms) remains 84/84 properties
Interrupted probabilistic random walk after 13297260 steps, run timeout after 87001 ms. (steps per millisecond=152 ) properties seen :57 out of 84
Probabilistic random walk after 13297260 steps, saw 2216586 distinct states, run finished after 87001 ms. (steps per millisecond=152 ) properties seen :57
[2025-06-02 06:13:22] [INFO ] Flow matrix only has 382 transitions (discarded 60 similar events)
// Phase 1: matrix 382 rows 232 cols
[2025-06-02 06:13:22] [INFO ] Computed 19 invariants in 2 ms
[2025-06-02 06:13:22] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 69/96 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 2/98 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 2/100 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 168/268 variables, 100/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 24/230 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 68/336 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 120/456 variables, 24/298 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/456 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/456 variables, 92/414 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/456 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (OVERLAPS) 82/538 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/538 variables, 82/499 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/538 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 25 (OVERLAPS) 3/541 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/541 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 28 (OVERLAPS) 3/544 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/544 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/544 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 31 (OVERLAPS) 70/614 variables, 88/599 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/614 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 33 (OVERLAPS) 0/614 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 599 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2203 ms.
Refiners :[Domain max(s): 232/232 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 232/232 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 69/96 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 2/98 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 2/100 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:13:25] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 168/268 variables, 100/207 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 24/231 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 18/249 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 68/336 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:13:25] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:13:26] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:13:26] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:13:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/336 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (OVERLAPS) 120/456 variables, 24/321 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/456 variables, 24/345 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/456 variables, 92/437 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/456 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 25 (OVERLAPS) 82/538 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/538 variables, 82/522 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/538 variables, 13/535 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/538 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 6 ms to minimize.
[2025-06-02 06:13:29] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/538 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/538 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 31 (OVERLAPS) 3/541 variables, 3/543 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/541 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/541 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 34 (OVERLAPS) 3/544 variables, 3/549 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/544 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/544 variables, 9/561 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:13:30] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:30] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:13:30] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:13:30] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-06-02 06:13:32] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:13:32] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:13:32] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:13:32] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:13:32] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/544 variables, 20/581 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/544 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 39 (OVERLAPS) 70/614 variables, 88/669 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:13:33] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/614 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/614 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 42 (OVERLAPS) 0/614 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 670 constraints, problems are : Problem set: 0 solved, 27 unsolved in 11980 ms.
Refiners :[Domain max(s): 232/232 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 232/232 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 44/44 constraints]
After SMT, in 14193ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 0 properties in 856 ms.
Support contains 27 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 442/442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 232 transition count 408
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 198 transition count 408
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 68 place count 198 transition count 400
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 84 place count 190 transition count 400
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 183 transition count 393
Applied a total of 98 rules in 19 ms. Remains 183 /232 variables (removed 49) and now considering 393/442 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 183/232 places, 393/442 transitions.
RANDOM walk for 4000000 steps (8 resets) in 24882 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 704 ms. (567 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 625 ms. (638 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 714 ms. (559 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 725 ms. (550 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 686 ms. (582 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 587 ms. (680 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 670 ms. (596 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 697 ms. (573 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 745 ms. (536 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 769 ms. (519 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 726 ms. (550 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 754 ms. (529 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 666 ms. (599 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 791 ms. (505 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 583 ms. (684 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 780 ms. (512 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 721 ms. (554 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 862 ms. (463 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 644 ms. (620 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 660 ms. (605 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 805 ms. (496 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 719 ms. (555 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 601 ms. (664 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 908 ms. (440 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 6729066 steps, run timeout after 42001 ms. (steps per millisecond=160 ) properties seen :0 out of 27
Probabilistic random walk after 6729066 steps, saw 1121827 distinct states, run finished after 42001 ms. (steps per millisecond=160 ) properties seen :0
[2025-06-02 06:14:34] [INFO ] Flow matrix only has 333 transitions (discarded 60 similar events)
// Phase 1: matrix 333 rows 183 cols
[2025-06-02 06:14:34] [INFO ] Computed 19 invariants in 1 ms
[2025-06-02 06:14:34] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 48/75 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 48/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 2/77 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 2/79 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 147/226 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 24/188 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 68/294 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/294 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/294 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/294 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 120/414 variables, 24/256 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/414 variables, 24/280 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 92/372 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/414 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (OVERLAPS) 54/468 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/468 variables, 54/429 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/468 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 25 (OVERLAPS) 3/471 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/471 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/471 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 28 (OVERLAPS) 3/474 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/474 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/474 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 31 (OVERLAPS) 42/516 variables, 60/501 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/516 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 33 (OVERLAPS) 0/516 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 501 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1891 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 48/75 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 48/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 2/77 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 2/79 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 147/226 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 18/207 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 68/294 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/294 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/294 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/294 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/294 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (OVERLAPS) 120/414 variables, 24/279 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/414 variables, 24/303 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/414 variables, 92/395 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:38] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2025-06-02 06:14:38] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:14:38] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2025-06-02 06:14:38] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 26 (OVERLAPS) 54/468 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/468 variables, 54/456 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/468 variables, 12/468 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:39] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/468 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:40] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:40] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/468 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/468 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 32 (OVERLAPS) 3/471 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/471 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/471 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 35 (OVERLAPS) 3/474 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/474 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/474 variables, 9/492 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:41] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:14:41] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:14:41] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2025-06-02 06:14:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2025-06-02 06:14:41] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:14:42] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/474 variables, 15/507 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:43] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:14:43] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:43] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:14:43] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:14:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/474 variables, 5/512 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:14:43] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2025-06-02 06:14:44] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2025-06-02 06:14:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/474 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:44] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/474 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-06-02 06:14:44] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:45] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:14:45] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2025-06-02 06:14:45] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2025-06-02 06:14:45] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:14:45] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:14:45] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/474 variables, 7/524 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/474 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 44 (OVERLAPS) 42/516 variables, 60/584 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/516 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 46 (OVERLAPS) 0/516 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 584 constraints, problems are : Problem set: 0 solved, 27 unsolved in 11291 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 56/56 constraints]
After SMT, in 13193ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 0 properties in 403 ms.
Support contains 27 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 393/393 transitions.
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 183/183 places, 393/393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 393/393 transitions.
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2025-06-02 06:14:48] [INFO ] Flow matrix only has 333 transitions (discarded 60 similar events)
[2025-06-02 06:14:48] [INFO ] Invariant cache hit.
[2025-06-02 06:14:48] [INFO ] Implicit Places using invariants in 315 ms returned [173, 174, 175, 176, 177]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 337 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 178/183 places, 393/393 transitions.
Applied a total of 0 rules in 7 ms. Remains 178 /178 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 353 ms. Remains : 178/183 places, 393/393 transitions.
RANDOM walk for 4000000 steps (8 resets) in 29696 ms. (134 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 693 ms. (576 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 825 ms. (484 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 638 ms. (625 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 771 ms. (518 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 630 ms. (633 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 869 ms. (459 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 682 ms. (585 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 693 ms. (576 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 706 ms. (565 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 660 ms. (605 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 619 ms. (645 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 610 ms. (654 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 861 ms. (464 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 693 ms. (576 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 675 ms. (591 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 691 ms. (578 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 543 ms. (735 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 621 ms. (643 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 708 ms. (564 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 818 ms. (488 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 893 ms. (447 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 658 ms. (606 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 644 ms. (620 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 637 ms. (626 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 696 ms. (573 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 654 ms. (610 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 9088278 steps, run timeout after 54001 ms. (steps per millisecond=168 ) properties seen :8 out of 27
Probabilistic random walk after 9088278 steps, saw 1515101 distinct states, run finished after 54001 ms. (steps per millisecond=168 ) properties seen :8
[2025-06-02 06:16:01] [INFO ] Flow matrix only has 333 transitions (discarded 60 similar events)
// Phase 1: matrix 333 rows 178 cols
[2025-06-02 06:16:01] [INFO ] Computed 14 invariants in 2 ms
[2025-06-02 06:16:01] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 23/42 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 78/121 variables, 43/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 84/205 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 160/365 variables, 32/172 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 32/204 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 108/312 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 79/444 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/444 variables, 79/395 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/444 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 4/448 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/448 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/448 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (OVERLAPS) 63/511 variables, 83/486 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/511 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (OVERLAPS) 0/511 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 486 constraints, problems are : Problem set: 0 solved, 19 unsolved in 958 ms.
Refiners :[Domain max(s): 178/178 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 178/178 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 23/42 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 78/121 variables, 43/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 84/205 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 160/365 variables, 32/181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 32/213 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 108/321 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/365 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 79/444 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/444 variables, 79/404 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/444 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-02 06:16:03] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:16:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-06-02 06:16:03] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2025-06-02 06:16:03] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:16:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2025-06-02 06:16:03] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/444 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/444 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (OVERLAPS) 4/448 variables, 4/421 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/448 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/448 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/448 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 29 (OVERLAPS) 63/511 variables, 83/511 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-02 06:16:04] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/511 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/511 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 32 (OVERLAPS) 0/511 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 512 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2528 ms.
Refiners :[Domain max(s): 178/178 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 178/178 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 7/7 constraints]
After SMT, in 3496ms problems are : Problem set: 0 solved, 19 unsolved
Finished Parikh walk after 51 steps, including 1 resets, run visited all 19 properties in 3 ms. (steps per millisecond=17 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 19 properties in 11 ms.
Able to resolve query StableMarking after proving 480 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 532492 ms.
ITS solved all properties within timeout
BK_STOP 1748844964962
--------------------
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="Peterson-PT-4"
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 Peterson-PT-4, 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 r154-tall-174876825600383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 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 '
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 ;