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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 406K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 380K 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 83K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 257K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 196K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 784K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 206K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 945K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K 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 535K 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 1748845277163

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-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 06:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 06:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:21:18] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2025-06-02 06:21:18] [INFO ] Transformed 834 places.
[2025-06-02 06:21:18] [INFO ] Transformed 1242 transitions.
[2025-06-02 06:21:18] [INFO ] Found NUPN structural information;
[2025-06-02 06:21:18] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 237 ms.
RANDOM walk for 40000 steps (8 resets) in 2457 ms. (16 steps per ms) remains 466/834 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 16 ms. (23 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 21 ms. (18 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 13 ms. (28 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
[2025-06-02 06:21:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2025-06-02 06:21:19] [INFO ] Computed 23 invariants in 27 ms
[2025-06-02 06:21:19] [INFO ] State equation strengthened by 205 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s8 (/ 1.0 2.0))
(s10 (/ 1.0 2.0))
(s13 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s43 (/ 1.0 2.0))
(s46 (/ 1.0 2.0))
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s53 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s67 (/ 1.0 2.0))
(s68 (/ 1.0 2.0))
(s69 (/ 1.0 2.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s76 (/ 1.0 2.0))
(s77 (/ 1.0 2.0))
(s78 (/ 1.0 2.0))
(s79 (/ 1.0 2.0))
(s80 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s86 (/ 1.0 2.0))
(s87 (/ 1.0 2.0))
(s88 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s91 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s95 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s98 (/ 1.0 2.0))
(s99 (/ 1.0 2.0))
(s100 (/ 1.0 2.0))
(s101 (/ 1.0 2.0))
(s102 (/ 1.0 2.0))
(s103 (/ 1.0 2.0))
(s104 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s136 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s138 (/ 1.0 2.0))
(s139 (/ 1.0 2.0))
(s140 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s143 (/ 1.0 2.0))
(s144 (/ 1.0 2.0))
(s145 (/ 1.0 2.0))
(s146 (/ 1.0 2.0))
(s147 (/ 1.0 2.0))
(s148 (/ 1.0 2.0))
(s149 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s154 (/ 1.0 2.0))
(s155 (/ 1.0 2.0))
(s156 (/ 1.0 2.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s181 (/ 1.0 2.0))
(s182 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s188 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s253 (/ 1.0 2.0))
(s256 (/ 1.0 2.0))
(s258 (/ 1.0 2.0)timeout
)
(s259 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 466/466 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1956 variables, and 466 constraints, problems are : Problem set: 0 solved, 466 unsolved in 5068 ms.
Refiners :[Domain max(s): 466/834 constraints, Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 466/466 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 328/794 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/794 variables, 328/802 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2025-06-02 06:21:29] [INFO ] Deduced a trap composed of 139 places in 349 ms of which 53 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/1956 variables, and 803 constraints, problems are : Problem set: 0 solved, 466 unsolved in 5013 ms.
Refiners :[Domain max(s): 794/834 constraints, Positive P Invariants (semi-flows): 8/17 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/466 constraints, Known Traps: 1/1 constraints]
After SMT, in 10285ms problems are : Problem set: 0 solved, 466 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 466 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 834 transition count 1130
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 224 place count 722 transition count 1130
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 224 place count 722 transition count 1044
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 396 place count 636 transition count 1044
Applied a total of 396 rules in 104 ms. Remains 636 /834 variables (removed 198) and now considering 1044/1242 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 636/834 places, 1044/1242 transitions.
RANDOM walk for 4000000 steps (8 resets) in 98055 ms. (40 steps per ms) remains 450/466 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 450/450 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 450/450 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 446/450 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 442/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 438/442 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 434/438 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 434/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 427/434 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 427/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 423/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
[2025-06-02 06:21:58] [INFO ] Flow matrix only has 924 transitions (discarded 120 similar events)
// Phase 1: matrix 924 rows 636 cols
[2025-06-02 06:21:58] [INFO ] Computed 23 invariants in 4 ms
[2025-06-02 06:21:58] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 423/423 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 171/594 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 171/600 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (OVERLAPS) 6/600 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 6/612 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 6/606 variables, 6/618 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 6/624 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 11 (OVERLAPS) 924/1530 variables, 606/1230 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1530 variables, 205/1435 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1530 variables, 0/1435 constraints. Problems are: Problem set: 0 solved, 423 unsolved
SMT process timed out in 45085ms, After SMT, problems are : Problem set: 0 solved, 423 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 423 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1044/1044 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 636 transition count 1021
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 613 transition count 1021
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 46 place count 613 transition count 1011
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 66 place count 603 transition count 1011
Applied a total of 66 rules in 52 ms. Remains 603 /636 variables (removed 33) and now considering 1011/1044 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 603/636 places, 1011/1044 transitions.
RANDOM walk for 4000000 steps (8 resets) in 87762 ms. (45 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 423/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 419/423 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 408/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 408/408 properties
Interrupted probabilistic random walk after 8849365 steps, run timeout after 78001 ms. (steps per millisecond=113 ) properties seen :0 out of 408
Probabilistic random walk after 8849365 steps, saw 1265212 distinct states, run finished after 78014 ms. (steps per millisecond=113 ) properties seen :0
[2025-06-02 06:24:29] [INFO ] Flow matrix only has 891 transitions (discarded 120 similar events)
// Phase 1: matrix 891 rows 603 cols
[2025-06-02 06:24:29] [INFO ] Computed 23 invariants in 7 ms
[2025-06-02 06:24:29] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 408/408 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 153/561 variables, 6/414 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 153/567 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 6/567 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 6/579 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (OVERLAPS) 6/573 variables, 6/585 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 6/591 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 11 (OVERLAPS) 891/1464 variables, 573/1164 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1464 variables, 205/1369 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1464 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 14 (OVERLAPS) 30/1494 variables, 30/1399 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1494 variables, 30/1429 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 1.0 306.0))
(t1 (/ 25.0 102.0))
(t2 (/ 4.0 153.0))
(t3 (/ 11.0 306.0))
(t4 (/ 5.0 306.0))
(t5 (/ 4.0 153.0))
(t6 (/ 1.0 306.0))
(t7 (/ 4.0 17.0))
(t8 (/ 2.0 153.0))
(t9 (/ 7.0 306.0))
(t10 (/ 2.0 153.0))
(t11 (/ 2.0 153.0))
(t12 (/ 1.0 306.0))
(t13 (/ 2.0 9.0))
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 (/ 32.0 153.0))
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 (/ 13.0 102.0))
(t43 0.0)
(t44 (/ 1.0 102.0))
(t45 (/ 2.0 153.0))
(t46 (/ 2.0 153.0))
(t47 (/ 2.0 153.0))
(t48 (/ 2.0 153.0))
(t49 (/ 4.0 153.0))
(t50 (/ 7.0 306.0))
(t51 (/ 7.0 306.0))
(t52 (/ 2.0 153.0))
(t53 (/ 11.0 306.0))
(t54 (/ 4.0 153.0))
(t55 (/ 4.0 153.0))
(t56 (/ 4.0 153.0))
(t57 (/ 2.0 51.0))
(t58 (/ 2.0 51.0))
(t59 (/ 11.0 306.0))
(t60 (/ 11.0 306.0))
(t61 (/ 5.0 102.0))
(t62 (/ 5.0 102.0))
(t63 (/ 2.0 51.0))
(t64 (/ 5.0 102.0))
(t65 (/ 5.0 102.0))
(t66 (/ 1.0 102.0))
(t67 (/ 2.0 153.0))
(t68 (/ 2.0 153.0))
(t69 (/ 43.0 306.0))
(t70 (/ 2.0 153.0))
(t71 (/ 7.0 306.0))
(t72 (/ 2.0 153.0))
(t73 (/ 4.0 153.0))
(t74 (/ 7.0 306.0))
(t75 (/ 47.0 306.0))
(t76 (/ 4.0 153.0))
(t77 (/ 11.0 306.0))
(t78 (/ 4.0 153.0))
(t79 (/ 11.0 306.0))
(t80 (/ 11.0 306.0))
(t81 (/ 2.0 51.0))
(t82 (/ 1.0 6.0))
(t83 (/ 2.0 51.0))
(t84 (/ 5.0 102.0))
(t85 (/ 5.0 102.0))
(t86 (/ 5.0 102.0))
(t87 (/ 5.0 102.0))
(t88 (/ 1.0 102.0))
(t89 (/ 1.0 102.0))
(t90 (/ 4.0 153.0))
(t91 (/ 7.0 306.0))
(t92 (/ 7.0 306.0))
(t93 (/ 2.0 153.0))
(t94 (/ 2.0 153.0))
(t95 (/ 2.0 153.0))
(t96 (/ 2.0 153.0))
(t97 (/ 2.0 153.0))
(t98 (/ 2.0 51.0))
(t99 (/ 2.0 51.0))
(t100 (/ 11.0 306.0))
(t101 (/ 11.0 306.0))
(t102 (/ 4.0 153.0))
(t103 (/ 11.0 306.0))
(t104 (/ 4.0 153.0))
(t105 (/ 4.0 153.0))
(t106 (/ 5.0 102.0))
(t107 (/ 5.0 102.0))
(t108 (/ 5.0 102.0))
(t109 (/ 2.0 51.0))
(t110 (/ 5.0 102.0))
(t111 (/ 1.0 102.0))
(t112 (/ 2.0 153.0))
(t113 (/ 2.0 153.0))
(t114 (/ 4.0 153.0))
(t115 (/ 7.0 306.0))
(t116 (/ 4.0 153.0))
(t117 (/ 4.0 153.0))
(t118 (/ 2.0 153.0))
(t119 (/ 2.0 153.0))
(t120 (/ 7.0 306.0))
(t121 (/ 2.0 153.0))
(t122 (/ 2.0 51.0))
(t123 (/ 2.0 51.0))
(t124 (/ 2.0 51.0))
(t125 (/ 5.0 102.0))
(t126 (/ 4.0 153.0))
(t127 (/ 11.0 306.0))
(t128 (/ 11.0 306.0))
(t129 (/ 11.0 306.0))
(t130 (/ 5.0 102.0))
(t131 (/ 5.0 102.0))
(t132 (/ 5.0 102.0))
(t133 (/ 5.0 306.0))
(t134 (/ 2.0 153.0))
(t135 (/ 1.0 306.0))
(t136 (/ 1.0 306.0))
(t137 (/ 4.0 153.0))
(t138 (/ 5.0 306.0))
(t139 (/ 5.0 306.0))
(t140 (/ 5.0 306.0))
(t141 (/ 1.0 34.0))
(t142 (/ 1.0 34.0))
(t143 (/ 1.0 34.0))
(t144 (/ 4.0 153.0))
(t145 (/ 2.0 51.0))
(t146 (/ 2.0 51.0))
(t147 (/ 2.0 51.0))
(t148 (/ 2.0 51.0))
(t149 (/ 1.0 306.0))
(t150 (/ 1.0 306.0))
(t151 (/ 1.0 306.0))
(t152 (/ 1.0 306.0))
(t153 (/ 1.0 306.0))
(t154 (/ 1.0 306.0))
(t155 (/ 1.0 306.0))
(t156 (/ 5.0 306.0))
(t157 (/ 2.0 153.0))
(t158 (/ 5.0 306.0))
(t159 (/ 5.0 306.0))
(t160 (/ 4.0 153.0))
(t161 (/ 5.0 306.0))
(t162 (/ 1.0 34.0))
(t163 (/ 4.0 153.0))
(t164 (/ 1.0 34.0))
(t165 (/ 1.0 34.0))
(t166 (/ 2.0 51.0))
(t167 (/ 2.0 51.0))
(t168 (/ 2.0 51.0))
(t169 (/ 2.0 51.0))
(t170 (/ 2.0 51.0))
(t171 (/ 1.0 306.0))
(t172 (/ 1.0 306.0))
(t173 (/ 4.0 153.0))
(t174 (/ 5.0 306.0))
(t175 (/ 5.0 306.0))
(t176 (/ 5.0 306.0))
(t177 (/ 2.0 153.0))
(t178 (/ 23.0 102.0))
(t179 (/ 1.0 306.0))
(t180 (/ 1.0 306.0))
(t181 (/ 65.0 306.0))
(t182 (/ 1.0 306.0))
(t183 (/ 1.0 306.0))
(t184 (/ 4.0 153.0))
(t185 (/ 5.0 306.0))
(t186 (/ 1.0 34.0))
(t187 (/ 4.0 153.0))
(t188 (/ 5.0 306.0))
(t189 (/ 2.0 153.0))
(t190 (/ 22.0 153.0))
(t191 (/ 5.0 306.0))
(t192 (/ 2.0 51.0))
(t193 (/ 1.0 34.0))
(t194 (/ 8.0 51.0))
(t195 (/ 2.0 51.0))
(t196 (/ 2.0 51.0))
(t197 (/ 1.0 306.0))
(t198 (/ 1.0 306.0))
(t199 (/ 20.0 153.0))
(t200 (/ 1.0 306.0))
(t201 (/ 1.0 306.0))
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 (/ 1.0 34.0))
(t243 (/ 1.0 34.0))
(t244 (/ 4.0 153.0))
(t245 (/ 1.0 34.0))
(t246 (/ 5.0 306.0))
(t247 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 75096ms, After SMT, problems are : Problem set: 0 solved, 408 unsolved
Fused 408 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 408 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 1011/1011 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 603 transition count 1002
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 594 transition count 1002
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 594 transition count 999
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 591 transition count 999
Applied a total of 24 rules in 41 ms. Remains 591 /603 variables (removed 12) and now considering 999/1011 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 591/603 places, 999/1011 transitions.
RANDOM walk for 4000000 steps (8 resets) in 85375 ms. (46 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 404/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 397/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 397/397 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 397/397 properties
Interrupted probabilistic random walk after 8922459 steps, run timeout after 81001 ms. (steps per millisecond=110 ) properties seen :0 out of 397
Probabilistic random walk after 8922459 steps, saw 1275604 distinct states, run finished after 81002 ms. (steps per millisecond=110 ) properties seen :0
[2025-06-02 06:27:32] [INFO ] Flow matrix only has 879 transitions (discarded 120 similar events)
// Phase 1: matrix 879 rows 591 cols
[2025-06-02 06:27:32] [INFO ] Computed 23 invariants in 6 ms
[2025-06-02 06:27:32] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 397/397 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 152/549 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 152/555 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 6/555 variables, 6/561 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (OVERLAPS) 6/561 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 6/579 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 11 (OVERLAPS) 879/1440 variables, 561/1140 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1440 variables, 205/1345 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1440 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 14 (OVERLAPS) 30/1470 variables, 30/1375 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1470 variables, 30/1405 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1470 variables, 5/1410 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1470 variables, 0/1410 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1470/1470 variables, and 1410 constraints, problems are : Problem set: 0 solved, 397 unsolved in 90021 ms.
Refiners :[Domain max(s): 591/591 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 591/591 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 397/397 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 152/549 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 152/555 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 6/555 variables, 6/561 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (OVERLAPS) 6/561 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 6/579 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2025-06-02 06:29:15] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 4 ms to minimize.
[2025-06-02 06:29:15] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2025-06-02 06:29:15] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:29:16] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2025-06-02 06:29:16] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:29:16] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:29:17] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:29:17] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:29:17] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:29:17] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:29:17] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:29:18] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:29:18] [INFO ] Deduced a trap composed of 127 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:29:18] [INFO ] Deduced a trap composed of 153 places in 72 ms of which 2 ms to minimize.
[2025-06-02 06:29:18] [INFO ] Deduced a trap composed of 164 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 15/594 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 12 (OVERLAPS) 879/1440 variables, 561/1155 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1440 variables, 205/1360 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1440 variables, 397/1757 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1440 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 397 unsolved
SMT process timed out in 180094ms, After SMT, problems are : Problem set: 0 solved, 397 unsolved
Fused 397 Parikh solutions to 40 different solutions.
Parikh walk visited 28 properties in 1243 ms.
Support contains 369 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 999/999 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 591 transition count 976
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 568 transition count 976
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 46 place count 568 transition count 969
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 60 place count 561 transition count 969
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 559 transition count 967
Applied a total of 64 rules in 42 ms. Remains 559 /591 variables (removed 32) and now considering 967/999 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 559/591 places, 967/999 transitions.
RANDOM walk for 4000000 steps (8 resets) in 78845 ms. (50 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 369/369 properties
Interrupted probabilistic random walk after 7521591 steps, run timeout after 72001 ms. (steps per millisecond=104 ) properties seen :0 out of 369
Probabilistic random walk after 7521591 steps, saw 1075461 distinct states, run finished after 72001 ms. (steps per millisecond=104 ) properties seen :0
[2025-06-02 06:32:10] [INFO ] Flow matrix only has 847 transitions (discarded 120 similar events)
// Phase 1: matrix 847 rows 559 cols
[2025-06-02 06:32:10] [INFO ] Computed 23 invariants in 3 ms
[2025-06-02 06:32:10] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 369/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 148/517 variables, 6/375 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 148/523 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 6/523 variables, 6/529 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 6/535 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (OVERLAPS) 6/529 variables, 6/541 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 6/547 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 11 (OVERLAPS) 847/1376 variables, 529/1076 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1376 variables, 205/1281 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1376 variables, 0/1281 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 14 (OVERLAPS) 30/1406 variables, 30/1311 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1406 variables, 30/1341 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1406 variables, 5/1346 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1406 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 18 (OVERLAPS) 0/1406 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1406/1406 variables, and 1346 constraints, problems are : Problem set: 0 solved, 369 unsolved in 102563 ms.
Refiners :[Domain max(s): 559/559 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 559/559 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 369/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 148/517 variables, 6/375 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 148/523 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 6/523 variables, 6/529 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 6/535 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (OVERLAPS) 6/529 variables, 6/541 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 6/547 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2025-06-02 06:34:04] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 4 ms to minimize.
[2025-06-02 06:34:04] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2025-06-02 06:34:04] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:34:05] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 3 ms to minimize.
[2025-06-02 06:34:05] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:34:05] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:34:05] [INFO ] Deduced a trap composed of 124 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:34:05] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:34:05] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:34:06] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:34:06] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:34:06] [INFO ] Deduced a trap composed of 98 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:34:06] [INFO ] Deduced a trap composed of 124 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:34:06] [INFO ] Deduced a trap composed of 138 places in 65 ms of which 1 ms to minimize.
[2025-06-02 06:34:06] [INFO ] Deduced a trap composed of 149 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 15/562 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 12 (OVERLAPS) 847/1376 variables, 529/1091 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1376 variables, 205/1296 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1376 variables, 369/1665 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1376 variables, 0/1665 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 16 (OVERLAPS) 30/1406 variables, 30/1695 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1406 variables, 30/1725 constraints. Problems are: Problem set: 0 solved, 369 unsolved
SMT process timed out in 207644ms, After SMT, problems are : Problem set: 0 solved, 369 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 369 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 967/967 transitions.
Applied a total of 0 rules in 29 ms. Remains 559 /559 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 559/559 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 967/967 transitions.
Applied a total of 0 rules in 16 ms. Remains 559 /559 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2025-06-02 06:35:38] [INFO ] Flow matrix only has 847 transitions (discarded 120 similar events)
[2025-06-02 06:35:38] [INFO ] Invariant cache hit.
[2025-06-02 06:35:38] [INFO ] Implicit Places using invariants in 350 ms returned [523, 535, 536, 537, 538, 539]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 359 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 553/559 places, 967/967 transitions.
Applied a total of 0 rules in 15 ms. Remains 553 /553 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 390 ms. Remains : 553/559 places, 967/967 transitions.
RANDOM walk for 4000000 steps (8 resets) in 89636 ms. (44 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 369/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 365/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 365/365 properties
Interrupted probabilistic random walk after 9713683 steps, run timeout after 93001 ms. (steps per millisecond=104 ) properties seen :0 out of 365
Probabilistic random walk after 9713683 steps, saw 1388683 distinct states, run finished after 93001 ms. (steps per millisecond=104 ) properties seen :0
[2025-06-02 06:37:43] [INFO ] Flow matrix only has 847 transitions (discarded 120 similar events)
// Phase 1: matrix 847 rows 553 cols
[2025-06-02 06:37:43] [INFO ] Computed 17 invariants in 5 ms
[2025-06-02 06:37:43] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 365/365 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 152/517 variables, 6/371 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 152/523 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 6/523 variables, 6/529 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 6/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 847/1370 variables, 523/1058 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1370 variables, 205/1263 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1370 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 11 (OVERLAPS) 30/1400 variables, 30/1293 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1400 variables, 30/1323 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1400 variables, 5/1328 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1400 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 15 (OVERLAPS) 0/1400 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1400/1400 variables, and 1328 constraints, problems are : Problem set: 0 solved, 365 unsolved in 96989 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 553/553 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 365/365 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 152/517 variables, 6/371 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 152/523 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2025-06-02 06:39:23] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 4 ms to minimize.
[2025-06-02 06:39:23] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2025-06-02 06:39:23] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2025-06-02 06:39:24] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 6 ms to minimize.
[2025-06-02 06:39:24] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:39:24] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2025-06-02 06:39:24] [INFO ] Deduced a trap composed of 124 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:39:24] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:39:24] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2025-06-02 06:39:24] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:39:25] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:39:25] [INFO ] Deduced a trap composed of 98 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:39:25] [INFO ] Deduced a trap composed of 124 places in 68 ms of which 2 ms to minimize.
[2025-06-02 06:39:25] [INFO ] Deduced a trap composed of 138 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:39:25] [INFO ] Deduced a trap composed of 149 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 15/538 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 6/523 variables, 6/544 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 6/550 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (OVERLAPS) 847/1370 variables, 523/1073 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1370 variables, 205/1278 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1370 variables, 365/1643 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1370 variables, 0/1643 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 13 (OVERLAPS) 30/1400 variables, 30/1673 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1400 variables, 30/1703 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1400 variables, 5/1708 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1400/1400 variables, and 1708 constraints, problems are : Problem set: 0 solved, 365 unsolved in 120016 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 553/553 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 15/15 constraints]
After SMT, in 217067ms problems are : Problem set: 0 solved, 365 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 365 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 967/967 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 553 transition count 965
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 551 transition count 965
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 551 transition count 964
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 550 transition count 964
Applied a total of 6 rules in 26 ms. Remains 550 /553 variables (removed 3) and now considering 964/967 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 550/553 places, 964/967 transitions.
RANDOM walk for 4000000 steps (8 resets) in 79710 ms. (50 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 365/365 properties
Interrupted probabilistic random walk after 6999986 steps, run timeout after 75001 ms. (steps per millisecond=93 ) properties seen :0 out of 365
Probabilistic random walk after 6999986 steps, saw 1000996 distinct states, run finished after 75001 ms. (steps per millisecond=93 ) properties seen :0
[2025-06-02 06:43:01] [INFO ] Flow matrix only has 844 transitions (discarded 120 similar events)
// Phase 1: matrix 844 rows 550 cols
[2025-06-02 06:43:01] [INFO ] Computed 17 invariants in 3 ms
[2025-06-02 06:43:01] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 365/365 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 149/514 variables, 6/371 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 149/520 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 6/520 variables, 6/526 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 6/532 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 844/1364 variables, 520/1052 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1364 variables, 205/1257 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1364 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 11 (OVERLAPS) 30/1394 variables, 30/1287 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1394 variables, 30/1317 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1394 variables, 5/1322 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1394 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 15 (OVERLAPS) 0/1394 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1394/1394 variables, and 1322 constraints, problems are : Problem set: 0 solved, 365 unsolved in 95639 ms.
Refiners :[Domain max(s): 550/550 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 550/550 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 365/365 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 149/514 variables, 6/371 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 149/520 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2025-06-02 06:44:39] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 4 ms to minimize.
[2025-06-02 06:44:39] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:44:39] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:44:40] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:44:40] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:44:40] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:44:40] [INFO ] Deduced a trap composed of 124 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:44:40] [INFO ] Deduced a trap composed of 107 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:44:40] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:44:41] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:44:41] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:44:41] [INFO ] Deduced a trap composed of 98 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:44:41] [INFO ] Deduced a trap composed of 124 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:44:41] [INFO ] Deduced a trap composed of 138 places in 66 ms of which 1 ms to minimize.
[2025-06-02 06:44:41] [INFO ] Deduced a trap composed of 149 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 15/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 6/520 variables, 6/541 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 6/547 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (OVERLAPS) 844/1364 variables, 520/1067 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1364 variables, 205/1272 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1364 variables, 365/1637 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1364 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 13 (OVERLAPS) 30/1394 variables, 30/1667 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1394 variables, 30/1697 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1394 variables, 5/1702 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1394/1394 variables, and 1702 constraints, problems are : Problem set: 0 solved, 365 unsolved in 135022 ms.
Refiners :[Domain max(s): 550/550 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 550/550 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 15/15 constraints]
After SMT, in 230725ms problems are : Problem set: 0 solved, 365 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 365 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 964/964 transitions.
Applied a total of 0 rules in 10 ms. Remains 550 /550 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 550/550 places, 964/964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 964/964 transitions.
Applied a total of 0 rules in 8 ms. Remains 550 /550 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2025-06-02 06:46:51] [INFO ] Flow matrix only has 844 transitions (discarded 120 similar events)
[2025-06-02 06:46:51] [INFO ] Invariant cache hit.
[2025-06-02 06:46:52] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-02 06:46:52] [INFO ] Flow matrix only has 844 transitions (discarded 120 similar events)
[2025-06-02 06:46:52] [INFO ] Invariant cache hit.
[2025-06-02 06:46:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 06:46:52] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2025-06-02 06:46:53] [INFO ] Redundant transitions in 53 ms returned []
Running 958 sub problems to find dead transitions.
[2025-06-02 06:46:53] [INFO ] Flow matrix only has 844 transitions (discarded 120 similar events)
[2025-06-02 06:46:53] [INFO ] Invariant cache hit.
[2025-06-02 06:46:53] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 550/550 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 17/567 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2025-06-02 06:47:00] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 4 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 4 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 20/587 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 4 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 3 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 2 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:47:08] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 20/607 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 3 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 2 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 3 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 3 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 4 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1394 variables, and 647 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30020 ms.
Refiners :[Domain max(s): 550/550 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/550 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 550/550 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 17/567 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 80/647 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 4 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 3 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 3 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2025-06-02 06:47:37] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 3 ms to minimize.
[2025-06-02 06:47:37] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:47:37] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 6 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 3 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 3 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:47:40] [INFO ] Deduced a trap composed of 107 places in 175 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2025-06-02 06:47:47] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 3 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 124 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 3 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 124 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 3 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1394 variables, and 727 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30028 ms.
Refiners :[Domain max(s): 550/550 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/550 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 160/160 constraints]
After SMT, in 60339ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61520 ms. Remains : 550/550 places, 964/964 transitions.
RANDOM walk for 400000 steps (8 resets) in 9097 ms. (43 steps per ms) remains 365/365 properties
Running SMT prover for 365 properties.
[2025-06-02 06:47:55] [INFO ] Flow matrix only has 844 transitions (discarded 120 similar events)
[2025-06-02 06:47:55] [INFO ] Invariant cache hit.
[2025-06-02 06:47:56] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 06:47:56] [INFO ] After 604ms SMT Verify possible using state equation in real domain returned unsat :0 sat :365
[2025-06-02 06:47:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 06:47:58] [INFO ] After 1570ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :365
TRAPS : Iteration 0
[2025-06-02 06:48:17] [INFO ] After 20165ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:365
[2025-06-02 06:48:17] [INFO ] After 21088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:365
[2025-06-02 06:48:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 06:48:17] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :365
[2025-06-02 06:48:19] [INFO ] After 1945ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :365
TRAPS : Iteration 0
[2025-06-02 06:48:19] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 4 ms to minimize.
[2025-06-02 06:48:20] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2025-06-02 06:48:20] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:48:20] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:48:20] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 4 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 4 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 4 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 3 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 3 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 84 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:48:25] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:48:25] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:48:25] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
[2025-06-02 06:48:25] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 4 ms to minimize.
[2025-06-02 06:48:25] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:48:25] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:48:26] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:48:26] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6394 ms
[2025-06-02 06:48:26] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:48:26] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:48:26] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:48:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 600 ms
[2025-06-02 06:48:26] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:48:27] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:48:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2025-06-02 06:48:27] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:48:27] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:48:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2025-06-02 06:48:27] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:48:28] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:48:28] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:48:28] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:48:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 586 ms
[2025-06-02 06:48:28] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2025-06-02 06:48:28] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:48:28] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:48:29] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:48:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 519 ms
[2025-06-02 06:48:29] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2025-06-02 06:48:29] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:48:29] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:48:29] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:48:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2025-06-02 06:48:29] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:48:30] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:48:30] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:48:30] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:48:30] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:48:30] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:48:31] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:48:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1255 ms
[2025-06-02 06:48:31] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:48:31] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:48:31] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:48:31] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:48:31] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:48:32] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:48:32] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:48:32] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 3 ms to minimize.
[2025-06-02 06:48:32] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2025-06-02 06:48:33] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:48:33] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:48:33] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:48:33] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2025-06-02 06:48:33] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:48:33] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:48:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2798 ms
[2025-06-02 06:48:34] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:48:34] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:48:34] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:48:34] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:48:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 662 ms
[2025-06-02 06:48:34] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1046 ms
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2025-06-02 06:48:36] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:48:36] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:48:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 504 ms
[2025-06-02 06:48:36] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-02 06:48:36] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 538 ms
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 833 ms
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 3 ms to minimize.
[2025-06-02 06:48:39] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:48:39] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:48:39] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:48:39] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:48:39] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:48:39] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1988 ms
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:48:41] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 3 ms to minimize.
[2025-06-02 06:48:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1128 ms
[2025-06-02 06:48:41] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:48:42] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:48:42] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:48:42] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:48:42] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:48:42] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:48:42] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:48:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 987 ms
[2025-06-02 06:48:42] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:48:43] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:48:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2025-06-02 06:48:43] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:48:43] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:48:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2025-06-02 06:48:43] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2025-06-02 06:48:43] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:48:43] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:48:44] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 3 ms to minimize.
[2025-06-02 06:48:44] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:48:44] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:48:44] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:48:44] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:48:45] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:48:45] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:48:45] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:48:45] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2025-06-02 06:48:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1881 ms
[2025-06-02 06:48:45] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:48:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2025-06-02 06:48:46] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2025-06-02 06:48:46] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:48:47] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:48:47] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
[2025-06-02 06:48:47] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:48:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 955 ms
[2025-06-02 06:48:47] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:48:47] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:48:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2025-06-02 06:48:48] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2025-06-02 06:48:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-02 06:48:48] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:48:48] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:48:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2025-06-02 06:48:49] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:48:49] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:48:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2025-06-02 06:48:49] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:48:49] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:48:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2025-06-02 06:48:50] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2025-06-02 06:48:50] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-02 06:48:51] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 3 ms to minimize.
[2025-06-02 06:48:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2025-06-02 06:48:51] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 3 ms to minimize.
[2025-06-02 06:48:51] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:48:52] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:48:52] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2025-06-02 06:48:52] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2025-06-02 06:48:52] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:48:52] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:48:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1393 ms
[2025-06-02 06:48:53] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:48:53] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:48:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2025-06-02 06:48:53] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:48:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-02 06:48:54] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2025-06-02 06:48:54] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 3 ms to minimize.
[2025-06-02 06:48:54] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:48:54] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2025-06-02 06:48:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 660 ms
[2025-06-02 06:48:54] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:48:54] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:48:55] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:48:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 412 ms
[2025-06-02 06:48:55] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:48:55] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:48:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2025-06-02 06:48:56] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:48:56] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:48:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2025-06-02 06:48:56] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2025-06-02 06:48:57] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:48:57] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 2 ms to minimize.
[2025-06-02 06:48:57] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:48:57] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:48:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 907 ms
[2025-06-02 06:48:58] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 3 ms to minimize.
[2025-06-02 06:48:58] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:48:58] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:48:58] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:48:58] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2025-06-02 06:48:58] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:48:59] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2025-06-02 06:48:59] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:48:59] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:48:59] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:48:59] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:48:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1902 ms
[2025-06-02 06:48:59] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:49:00] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2025-06-02 06:49:00] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2025-06-02 06:49:00] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2025-06-02 06:49:01] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2025-06-02 06:49:02] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:49:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-06-02 06:49:02] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2025-06-02 06:49:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-06-02 06:49:03] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:49:03] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:49:03] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 3 ms to minimize.
[2025-06-02 06:49:03] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:49:03] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:49:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 767 ms
[2025-06-02 06:49:04] [INFO ] Deduced a trap composed of 124 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:49:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2025-06-02 06:49:05] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:49:05] [INFO ] Deduced a trap composed of 149 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:49:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
[2025-06-02 06:49:06] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:49:06] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2025-06-02 06:49:06] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:49:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 506 ms
[2025-06-02 06:49:08] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2025-06-02 06:49:08] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2025-06-02 06:49:08] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:49:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2025-06-02 06:49:08] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2025-06-02 06:49:09] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2025-06-02 06:49:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2025-06-02 06:49:09] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:49:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-06-02 06:49:10] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:49:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2025-06-02 06:49:10] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 3 ms to minimize.
[2025-06-02 06:49:10] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:49:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2025-06-02 06:49:12] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:49:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-06-02 06:49:13] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:49:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-02 06:49:13] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:49:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2025-06-02 06:49:14] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:49:14] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:49:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2025-06-02 06:49:15] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2025-06-02 06:49:16] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:49:16] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:49:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2025-06-02 06:49:17] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:49:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2025-06-02 06:49:18] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2025-06-02 06:49:22] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:49:22] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 3 ms to minimize.
[2025-06-02 06:49:22] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:49:22] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:49:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 736 ms
[2025-06-02 06:49:23] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2025-06-02 06:49:24] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2025-06-02 06:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2025-06-02 06:49:25] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 2 ms to minimize.
[2025-06-02 06:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2025-06-02 06:49:29] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:49:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2025-06-02 06:49:30] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:49:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2025-06-02 06:49:33] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:49:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
TRAPS : Iteration 1
[2025-06-02 06:49:36] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-06-02 06:49:43] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-02 06:49:44] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 3 ms to minimize.
[2025-06-02 06:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-06-02 06:49:44] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-06-02 06:49:46] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:49:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2025-06-02 06:50:02] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:50:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-02 06:50:10] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:50:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
TRAPS : Iteration 2
[2025-06-02 06:50:14] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 2 ms to minimize.
[2025-06-02 06:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2025-06-02 06:50:15] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:50:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2025-06-02 06:50:16] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2025-06-02 06:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2025-06-02 06:50:18] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2025-06-02 06:50:21] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:50:21] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:50:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2025-06-02 06:50:22] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-02 06:50:22] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2025-06-02 06:50:24] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2025-06-02 06:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2025-06-02 06:50:31] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 3 ms to minimize.
[2025-06-02 06:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2025-06-02 06:50:42] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
TRAPS : Iteration 3
[2025-06-02 06:50:50] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2025-06-02 06:50:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-06-02 06:50:59] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:50:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2025-06-02 06:51:01] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:51:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2025-06-02 06:51:12] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:51:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms

BK_TIME_CONFINEMENT_REACHED

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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;