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.r014-tall-174853743500198.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 ASLink-PT-03a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743500198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 357K 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 1748544967182

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:56:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:56:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:56:08] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-05-29 18:56:08] [INFO ] Transformed 821 places.
[2025-05-29 18:56:08] [INFO ] Transformed 1281 transitions.
[2025-05-29 18:56:08] [INFO ] Found NUPN structural information;
[2025-05-29 18:56:08] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 255 ms.
Structural test allowed to assert that 91 places are NOT stable. Took 11 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
RANDOM walk for 40000 steps (352 resets) in 2207 ms. (18 steps per ms) remains 199/730 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
// Phase 1: matrix 1268 rows 821 cols
[2025-05-29 18:56:09] [INFO ] Computed 156 invariants in 67 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 46/245 variables, 21/230 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 46/276 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 79/324 variables, 15/293 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 79/372 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/2089 variables, and 372 constraints, problems are : Problem set: 0 solved, 199 unsolved in 5046 ms.
Refiners :[Domain max(s): 324/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 12/120 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 46/245 variables, 21/230 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 46/276 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 79/324 variables, 15/293 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 79/372 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 478/802 variables, 101/473 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/802 variables, 478/951 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2025-05-29 18:56:19] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 35 ms to minimize.
[2025-05-29 18:56:19] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/2089 variables, and 953 constraints, problems are : Problem set: 0 solved, 199 unsolved in 5016 ms.
Refiners :[Domain max(s): 802/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 113/120 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 0/199 constraints, Known Traps: 2/2 constraints]
After SMT, in 10281ms problems are : Problem set: 0 solved, 199 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 199 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 5 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 811 transition count 1214
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 118 place count 757 transition count 1214
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 118 place count 757 transition count 1152
Deduced a syphon composed of 62 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 265 place count 672 transition count 1152
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 672 transition count 1151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 671 transition count 1151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 270 place count 668 transition count 1135
Iterating global reduction 4 with 3 rules applied. Total rules applied 273 place count 668 transition count 1135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 4 rules applied. Total rules applied 277 place count 667 transition count 1132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 279 place count 665 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 664 transition count 1124
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 664 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 282 place count 663 transition count 1116
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 663 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 284 place count 662 transition count 1108
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 662 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 286 place count 661 transition count 1100
Iterating global reduction 6 with 1 rules applied. Total rules applied 287 place count 661 transition count 1100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 288 place count 660 transition count 1092
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 660 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 290 place count 659 transition count 1084
Iterating global reduction 6 with 1 rules applied. Total rules applied 291 place count 659 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 292 place count 658 transition count 1076
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 658 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 294 place count 657 transition count 1068
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 657 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 296 place count 656 transition count 1060
Iterating global reduction 6 with 1 rules applied. Total rules applied 297 place count 656 transition count 1060
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 298 place count 655 transition count 1052
Iterating global reduction 6 with 1 rules applied. Total rules applied 299 place count 655 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 300 place count 654 transition count 1044
Iterating global reduction 6 with 1 rules applied. Total rules applied 301 place count 654 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 302 place count 653 transition count 1036
Iterating global reduction 6 with 1 rules applied. Total rules applied 303 place count 653 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 304 place count 652 transition count 1028
Iterating global reduction 6 with 1 rules applied. Total rules applied 305 place count 652 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 306 place count 651 transition count 1020
Iterating global reduction 6 with 1 rules applied. Total rules applied 307 place count 651 transition count 1020
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 308 place count 650 transition count 1012
Iterating global reduction 6 with 1 rules applied. Total rules applied 309 place count 650 transition count 1012
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 310 place count 649 transition count 1004
Iterating global reduction 6 with 1 rules applied. Total rules applied 311 place count 649 transition count 1004
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 341 place count 634 transition count 989
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 342 place count 634 transition count 988
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 343 place count 633 transition count 988
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 344 place count 633 transition count 988
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 345 place count 632 transition count 987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 346 place count 631 transition count 987
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 346 place count 631 transition count 984
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 352 place count 628 transition count 984
Applied a total of 352 rules in 546 ms. Remains 628 /821 variables (removed 193) and now considering 984/1268 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 556 ms. Remains : 628/821 places, 984/1268 transitions.
RANDOM walk for 4000000 steps (53680 resets) in 51756 ms. (77 steps per ms) remains 161/199 properties
BEST_FIRST walk for 40003 steps (153 resets) in 186 ms. (213 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (137 resets) in 195 ms. (204 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (149 resets) in 186 ms. (213 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (145 resets) in 198 ms. (201 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (141 resets) in 199 ms. (200 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (153 resets) in 229 ms. (173 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (149 resets) in 187 ms. (212 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (153 resets) in 175 ms. (227 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (157 resets) in 181 ms. (219 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (157 resets) in 256 ms. (155 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (159 resets) in 250 ms. (159 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (144 resets) in 203 ms. (196 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (146 resets) in 195 ms. (204 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (154 resets) in 178 ms. (223 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (151 resets) in 194 ms. (205 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (151 resets) in 267 ms. (149 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (150 resets) in 248 ms. (160 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40000 steps (152 resets) in 219 ms. (181 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (158 resets) in 146 ms. (272 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (149 resets) in 147 ms. (270 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (152 resets) in 160 ms. (248 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (150 resets) in 154 ms. (258 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (147 resets) in 151 ms. (263 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (140 resets) in 156 ms. (254 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (155 resets) in 142 ms. (279 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (146 resets) in 158 ms. (251 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (139 resets) in 164 ms. (242 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (151 resets) in 145 ms. (274 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (150 resets) in 157 ms. (253 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (153 resets) in 154 ms. (258 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (151 resets) in 148 ms. (268 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (146 resets) in 158 ms. (251 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (142 resets) in 153 ms. (259 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (146 resets) in 150 ms. (264 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (148 resets) in 160 ms. (248 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (143 resets) in 175 ms. (227 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (146 resets) in 197 ms. (202 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (140 resets) in 194 ms. (205 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (141 resets) in 189 ms. (210 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (154 resets) in 192 ms. (207 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (147 resets) in 188 ms. (211 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (151 resets) in 179 ms. (222 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (148 resets) in 201 ms. (198 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (140 resets) in 179 ms. (222 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (154 resets) in 170 ms. (233 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (152 resets) in 182 ms. (218 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (137 resets) in 184 ms. (216 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (145 resets) in 187 ms. (212 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (158 resets) in 171 ms. (232 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (150 resets) in 200 ms. (199 steps per ms) remains 161/161 properties
// Phase 1: matrix 984 rows 628 cols
[2025-05-29 18:56:39] [INFO ] Computed 121 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 16/177 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 121/299 variables, 23/53 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 4/303 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 116/419 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 74/493 variables, 11/84 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 15 (OVERLAPS) 8/501 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 17 (OVERLAPS) 124/625 variables, 31/118 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/625 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 19 (OVERLAPS) 1/626 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/626 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 21 (OVERLAPS) 2/628 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/628 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 23 (OVERLAPS) 984/1612 variables, 628/749 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1612 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 25 (OVERLAPS) 0/1612 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 749 constraints, problems are : Problem set: 0 solved, 161 unsolved in 24014 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 628/628 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 16/177 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 121/299 variables, 23/53 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2025-05-29 18:57:05] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2025-05-29 18:57:05] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 4/303 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 116/419 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2025-05-29 18:57:09] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 15 (OVERLAPS) 74/493 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 17 (OVERLAPS) 8/501 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 19 (OVERLAPS) 124/625 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/625 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 21 (OVERLAPS) 1/626 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/626 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 23 (OVERLAPS) 2/628 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/628 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 25 (OVERLAPS) 984/1612 variables, 628/752 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1612 variables, 161/913 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 913 constraints, problems are : Problem set: 0 solved, 161 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 628/628 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 3/3 constraints]
After SMT, in 69158ms problems are : Problem set: 0 solved, 161 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 984/984 transitions.
Ensure Unique test removed 1 places
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 3 rules applied. Total rules applied 3 place count 627 transition count 982
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 624 transition count 982
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 624 transition count 980
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 622 transition count 980
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 621 transition count 980
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 23 place count 615 transition count 974
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 614 transition count 973
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 614 transition count 973
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 614 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 613 transition count 972
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 613 transition count 972
Applied a total of 28 rules in 99 ms. Remains 613 /628 variables (removed 15) and now considering 972/984 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 613/628 places, 972/984 transitions.
RANDOM walk for 4000000 steps (57742 resets) in 53656 ms. (74 steps per ms) remains 107/161 properties
BEST_FIRST walk for 40002 steps (160 resets) in 164 ms. (242 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (149 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (150 resets) in 224 ms. (177 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (154 resets) in 164 ms. (242 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (157 resets) in 185 ms. (215 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (164 resets) in 201 ms. (198 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (165 resets) in 211 ms. (188 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (154 resets) in 185 ms. (215 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (150 resets) in 184 ms. (216 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (148 resets) in 193 ms. (206 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (153 resets) in 192 ms. (207 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (155 resets) in 254 ms. (156 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (155 resets) in 226 ms. (176 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (162 resets) in 134 ms. (296 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (153 resets) in 243 ms. (163 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (162 resets) in 172 ms. (231 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (151 resets) in 180 ms. (221 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (158 resets) in 248 ms. (160 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (152 resets) in 162 ms. (245 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (149 resets) in 246 ms. (161 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (149 resets) in 198 ms. (201 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (158 resets) in 266 ms. (149 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (150 resets) in 217 ms. (183 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (156 resets) in 234 ms. (170 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (155 resets) in 224 ms. (177 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (159 resets) in 201 ms. (198 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (164 resets) in 228 ms. (174 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (147 resets) in 259 ms. (153 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (156 resets) in 197 ms. (202 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (160 resets) in 264 ms. (150 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (158 resets) in 177 ms. (224 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40000 steps (155 resets) in 193 ms. (206 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (157 resets) in 169 ms. (235 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (151 resets) in 322 ms. (123 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (147 resets) in 216 ms. (184 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (156 resets) in 153 ms. (259 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (160 resets) in 167 ms. (238 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (157 resets) in 258 ms. (154 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (151 resets) in 212 ms. (187 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (156 resets) in 174 ms. (228 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (157 resets) in 252 ms. (158 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (152 resets) in 190 ms. (209 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (160 resets) in 221 ms. (180 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (155 resets) in 198 ms. (201 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (147 resets) in 253 ms. (157 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (152 resets) in 193 ms. (206 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (162 resets) in 273 ms. (145 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (150 resets) in 218 ms. (182 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (154 resets) in 192 ms. (207 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (155 resets) in 166 ms. (239 steps per ms) remains 107/107 properties
// Phase 1: matrix 972 rows 613 cols
[2025-05-29 18:58:10] [INFO ] Computed 118 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 13/120 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 2/122 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 151/273 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 10/283 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 131/414 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (OVERLAPS) 78/492 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 15 (OVERLAPS) 4/496 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 17 (OVERLAPS) 114/610 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/610 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 19 (OVERLAPS) 1/611 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/611 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 21 (OVERLAPS) 2/613 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/613 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 23 (OVERLAPS) 972/1585 variables, 613/731 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1585 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 25 (OVERLAPS) 0/1585 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1585/1585 variables, and 731 constraints, problems are : Problem set: 0 solved, 107 unsolved in 14179 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 13/120 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 2/122 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 151/273 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-05-29 18:58:25] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2025-05-29 18:58:25] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 10/283 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 131/414 variables, 19/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (OVERLAPS) 78/492 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 16 (OVERLAPS) 4/496 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/496 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 18 (OVERLAPS) 114/610 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/610 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 20 (OVERLAPS) 1/611 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/611 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 22 (OVERLAPS) 2/613 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/613 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 24 (OVERLAPS) 972/1585 variables, 613/733 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1585 variables, 107/840 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1585/1585 variables, and 840 constraints, problems are : Problem set: 0 solved, 107 unsolved in 75011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 89237ms problems are : Problem set: 0 solved, 107 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 972/972 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 610 transition count 968
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 604 transition count 968
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 13 place count 604 transition count 964
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 600 transition count 964
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 599 transition count 964
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 598 transition count 958
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 598 transition count 958
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 597 transition count 958
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 29 place count 595 transition count 956
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 31 place count 593 transition count 954
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 593 transition count 954
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 593 transition count 952
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 38 place count 591 transition count 951
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 591 transition count 951
Applied a total of 39 rules in 110 ms. Remains 591 /613 variables (removed 22) and now considering 951/972 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 591/613 places, 951/972 transitions.
RANDOM walk for 4000000 steps (57713 resets) in 57677 ms. (69 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (156 resets) in 222 ms. (179 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (154 resets) in 205 ms. (194 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (161 resets) in 179 ms. (222 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (155 resets) in 197 ms. (202 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (157 resets) in 190 ms. (209 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (163 resets) in 208 ms. (191 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (157 resets) in 217 ms. (183 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (161 resets) in 256 ms. (155 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (163 resets) in 162 ms. (245 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (158 resets) in 175 ms. (227 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (169 resets) in 185 ms. (215 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (163 resets) in 201 ms. (198 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (163 resets) in 217 ms. (183 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (172 resets) in 171 ms. (232 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (160 resets) in 209 ms. (190 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (158 resets) in 195 ms. (204 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (155 resets) in 189 ms. (210 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (159 resets) in 280 ms. (142 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (159 resets) in 220 ms. (181 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40000 steps (162 resets) in 228 ms. (174 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (154 resets) in 307 ms. (129 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (158 resets) in 174 ms. (228 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (165 resets) in 206 ms. (193 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (153 resets) in 179 ms. (222 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (161 resets) in 285 ms. (139 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (150 resets) in 235 ms. (169 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (152 resets) in 236 ms. (168 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (161 resets) in 208 ms. (191 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (163 resets) in 185 ms. (215 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (147 resets) in 276 ms. (144 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (158 resets) in 252 ms. (158 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (159 resets) in 213 ms. (186 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (158 resets) in 170 ms. (233 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (152 resets) in 189 ms. (210 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (167 resets) in 170 ms. (233 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (152 resets) in 234 ms. (170 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (152 resets) in 245 ms. (162 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (149 resets) in 252 ms. (158 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (156 resets) in 287 ms. (138 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (160 resets) in 214 ms. (186 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (157 resets) in 298 ms. (133 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (160 resets) in 201 ms. (198 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (156 resets) in 192 ms. (207 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (166 resets) in 172 ms. (231 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (163 resets) in 239 ms. (166 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (159 resets) in 199 ms. (200 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (152 resets) in 157 ms. (253 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (160 resets) in 196 ms. (203 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (164 resets) in 206 ms. (193 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (153 resets) in 186 ms. (213 steps per ms) remains 107/107 properties
Interrupted probabilistic random walk after 4230784 steps, run timeout after 60001 ms. (steps per millisecond=70 ) properties seen :18 out of 107
Probabilistic random walk after 4230784 steps, saw 1284662 distinct states, run finished after 60008 ms. (steps per millisecond=70 ) properties seen :18
// Phase 1: matrix 951 rows 591 cols
[2025-05-29 19:00:59] [INFO ] Computed 111 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 8/97 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 76/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 14/247 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 64/311 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (OVERLAPS) 18/329 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/329 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (OVERLAPS) 145/474 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/474 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (OVERLAPS) 46/520 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 23 (OVERLAPS) 68/588 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/588 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 25 (OVERLAPS) 1/589 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/589 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 27 (OVERLAPS) 2/591 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/591 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 29 (OVERLAPS) 951/1542 variables, 591/702 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1542 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 31 (OVERLAPS) 0/1542 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1542/1542 variables, and 702 constraints, problems are : Problem set: 0 solved, 89 unsolved in 12579 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 8/97 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 76/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2025-05-29 19:01:13] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 3/177 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 56/233 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2025-05-29 19:01:14] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 14/247 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (OVERLAPS) 64/311 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/311 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (OVERLAPS) 18/329 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/329 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (OVERLAPS) 145/474 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/474 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 23 (OVERLAPS) 46/520 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/520 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 25 (OVERLAPS) 68/588 variables, 22/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/588 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 27 (OVERLAPS) 1/589 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/589 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 29 (OVERLAPS) 2/591 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/591 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 31 (OVERLAPS) 951/1542 variables, 591/704 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1542 variables, 89/793 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2025-05-29 19:02:39] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1542/1542 variables, and 794 constraints, problems are : Problem set: 0 solved, 89 unsolved in 90017 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
After SMT, in 102626ms problems are : Problem set: 0 solved, 89 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 951/951 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 948
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 588 transition count 948
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 588 transition count 945
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 583 transition count 945
Applied a total of 14 rules in 25 ms. Remains 583 /591 variables (removed 8) and now considering 945/951 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 583/591 places, 945/951 transitions.
RANDOM walk for 4000000 steps (58069 resets) in 44121 ms. (90 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1591 resets) in 1765 ms. (226 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1594 resets) in 1647 ms. (242 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1602 resets) in 1772 ms. (225 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1588 resets) in 1748 ms. (228 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1575 resets) in 1754 ms. (227 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1576 resets) in 2046 ms. (195 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1598 resets) in 1926 ms. (207 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1595 resets) in 1974 ms. (202 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1601 resets) in 1683 ms. (237 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1599 resets) in 1606 ms. (248 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1622 resets) in 1964 ms. (203 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1610 resets) in 1975 ms. (202 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1581 resets) in 1701 ms. (235 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1593 resets) in 1773 ms. (225 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1590 resets) in 2066 ms. (193 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1594 resets) in 1945 ms. (205 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1606 resets) in 1652 ms. (241 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1603 resets) in 1801 ms. (221 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1571 resets) in 1921 ms. (208 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1585 resets) in 1718 ms. (232 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1572 resets) in 1883 ms. (212 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1573 resets) in 1916 ms. (208 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1584 resets) in 1654 ms. (241 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1638 resets) in 1603 ms. (249 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1621 resets) in 1626 ms. (245 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1570 resets) in 1557 ms. (256 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1624 resets) in 1736 ms. (230 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1588 resets) in 1929 ms. (207 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1586 resets) in 1483 ms. (269 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1584 resets) in 2154 ms. (185 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1584 resets) in 2012 ms. (198 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1575 resets) in 1686 ms. (237 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1603 resets) in 1974 ms. (202 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1565 resets) in 1586 ms. (252 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1585 resets) in 1676 ms. (238 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1589 resets) in 1601 ms. (249 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1603 resets) in 1597 ms. (250 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1566 resets) in 1573 ms. (254 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1597 resets) in 2144 ms. (186 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400000 steps (1587 resets) in 1844 ms. (216 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1581 resets) in 1880 ms. (212 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1552 resets) in 2011 ms. (198 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1616 resets) in 1435 ms. (278 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1566 resets) in 1574 ms. (253 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1631 resets) in 1438 ms. (277 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1592 resets) in 1796 ms. (222 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1594 resets) in 1723 ms. (232 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1621 resets) in 1685 ms. (237 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1604 resets) in 1766 ms. (226 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1602 resets) in 1585 ms. (252 steps per ms) remains 89/89 properties
Interrupted probabilistic random walk after 8021515 steps, run timeout after 126001 ms. (steps per millisecond=63 ) properties seen :4 out of 89
Probabilistic random walk after 8021515 steps, saw 2640868 distinct states, run finished after 126001 ms. (steps per millisecond=63 ) properties seen :4
// Phase 1: matrix 945 rows 583 cols
[2025-05-29 19:05:31] [INFO ] Computed 109 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/93 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 80/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 6/239 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (OVERLAPS) 64/303 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (OVERLAPS) 35/338 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/338 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 19 (OVERLAPS) 2/340 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/340 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 21 (OVERLAPS) 1/341 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/341 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (OVERLAPS) 127/468 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/468 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 25 (OVERLAPS) 45/513 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/513 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 27 (OVERLAPS) 68/581 variables, 23/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/581 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 29 (OVERLAPS) 1/582 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/582 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 31 (OVERLAPS) 1/583 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/583 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 33 (OVERLAPS) 945/1528 variables, 583/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1528 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 35 (OVERLAPS) 0/1528 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1528/1528 variables, and 692 constraints, problems are : Problem set: 0 solved, 85 unsolved in 12760 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/93 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 80/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2025-05-29 19:05:45] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (OVERLAPS) 6/239 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (OVERLAPS) 64/303 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 18 (OVERLAPS) 35/338 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/338 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (OVERLAPS) 2/340 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/340 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (OVERLAPS) 1/341 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/341 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 24 (OVERLAPS) 127/468 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/468 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 26 (OVERLAPS) 45/513 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/513 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 28 (OVERLAPS) 68/581 variables, 23/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/581 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 30 (OVERLAPS) 1/582 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/582 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 32 (OVERLAPS) 1/583 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/583 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 34 (OVERLAPS) 945/1528 variables, 583/693 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1528 variables, 85/778 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1528 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 37 (OVERLAPS) 0/1528 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1528/1528 variables, and 778 constraints, problems are : Problem set: 0 solved, 85 unsolved in 47185 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 1/1 constraints]
After SMT, in 59976ms problems are : Problem set: 0 solved, 85 unsolved
Fused 85 Parikh solutions to 78 different solutions.
Parikh walk visited 0 properties in 32193 ms.
Support contains 85 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 945/945 transitions.
Applied a total of 0 rules in 14 ms. Remains 583 /583 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 583/583 places, 945/945 transitions.
RANDOM walk for 4000000 steps (57434 resets) in 51675 ms. (77 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1584 resets) in 1851 ms. (215 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1594 resets) in 1551 ms. (257 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1588 resets) in 1770 ms. (225 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1583 resets) in 1854 ms. (215 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1589 resets) in 1738 ms. (230 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1604 resets) in 1564 ms. (255 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1599 resets) in 1907 ms. (209 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1558 resets) in 1598 ms. (250 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1577 resets) in 1945 ms. (205 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (1616 resets) in 1861 ms. (214 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1597 resets) in 1857 ms. (215 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1620 resets) in 1689 ms. (236 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1587 resets) in 1844 ms. (216 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1591 resets) in 1850 ms. (216 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1600 resets) in 1849 ms. (216 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1599 resets) in 2240 ms. (178 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1617 resets) in 1905 ms. (209 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1597 resets) in 1687 ms. (236 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1580 resets) in 1941 ms. (205 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1620 resets) in 1838 ms. (217 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1618 resets) in 1954 ms. (204 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1600 resets) in 1502 ms. (266 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1620 resets) in 1988 ms. (201 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1602 resets) in 1917 ms. (208 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1620 resets) in 1933 ms. (206 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1538 resets) in 1795 ms. (222 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400000 steps (1605 resets) in 1627 ms. (245 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1612 resets) in 1929 ms. (207 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1584 resets) in 1829 ms. (218 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1588 resets) in 1978 ms. (202 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1611 resets) in 1819 ms. (219 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1567 resets) in 2051 ms. (194 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1573 resets) in 1871 ms. (213 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (1579 resets) in 1649 ms. (242 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1599 resets) in 1624 ms. (246 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1601 resets) in 1864 ms. (214 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1589 resets) in 1708 ms. (234 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1612 resets) in 1729 ms. (231 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1610 resets) in 1707 ms. (234 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1620 resets) in 1718 ms. (232 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1611 resets) in 1720 ms. (232 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1573 resets) in 1914 ms. (208 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1577 resets) in 2049 ms. (195 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1563 resets) in 2038 ms. (196 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1604 resets) in 2220 ms. (180 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1583 resets) in 1988 ms. (201 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1601 resets) in 1702 ms. (234 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1609 resets) in 1869 ms. (213 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1574 resets) in 1937 ms. (206 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1628 resets) in 1594 ms. (250 steps per ms) remains 85/85 properties
Interrupted probabilistic random walk after 8902358 steps, run timeout after 135001 ms. (steps per millisecond=65 ) properties seen :0 out of 85
Probabilistic random walk after 8902358 steps, saw 2861213 distinct states, run finished after 135001 ms. (steps per millisecond=65 ) properties seen :0
[2025-05-29 19:10:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/93 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 80/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 6/239 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (OVERLAPS) 64/303 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (OVERLAPS) 35/338 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/338 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 19 (OVERLAPS) 2/340 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/340 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 21 (OVERLAPS) 1/341 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/341 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (OVERLAPS) 127/468 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/468 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 25 (OVERLAPS) 45/513 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/513 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 27 (OVERLAPS) 68/581 variables, 23/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/581 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 29 (OVERLAPS) 1/582 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/582 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 31 (OVERLAPS) 1/583 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/583 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 33 (OVERLAPS) 945/1528 variables, 583/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1528 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 35 (OVERLAPS) 0/1528 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1528/1528 variables, and 692 constraints, problems are : Problem set: 0 solved, 85 unsolved in 12585 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/93 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 80/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2025-05-29 19:10:17] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (OVERLAPS) 6/239 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (OVERLAPS) 64/303 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 18 (OVERLAPS) 35/338 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/338 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (OVERLAPS) 2/340 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/340 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (OVERLAPS) 1/341 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/341 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 24 (OVERLAPS) 127/468 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/468 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 26 (OVERLAPS) 45/513 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/513 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 28 (OVERLAPS) 68/581 variables, 23/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/581 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 30 (OVERLAPS) 1/582 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/582 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 32 (OVERLAPS) 1/583 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/583 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 34 (OVERLAPS) 945/1528 variables, 583/693 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1528 variables, 85/778 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2025-05-29 19:11:38] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1528 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1528/1528 variables, and 779 constraints, problems are : Problem set: 0 solved, 85 unsolved in 120019 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
After SMT, in 132629ms problems are : Problem set: 0 solved, 85 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 945/945 transitions.
Applied a total of 0 rules in 15 ms. Remains 583 /583 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 583/583 places, 945/945 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 945/945 transitions.
Applied a total of 0 rules in 15 ms. Remains 583 /583 variables (removed 0) and now considering 945/945 (removed 0) transitions.
[2025-05-29 19:12:16] [INFO ] Invariant cache hit.
[2025-05-29 19:12:16] [INFO ] Implicit Places using invariants in 386 ms returned [20, 53, 71, 162, 179, 184, 185, 186, 204, 222, 241, 291, 292, 303, 304, 305, 323, 341, 410, 414, 415, 418, 429, 430, 431, 449, 451, 454, 472, 473, 474, 475, 487, 493, 499, 505, 511, 517, 523, 529, 535, 541, 547]
[2025-05-29 19:12:16] [INFO ] Actually due to overlaps returned [449, 431, 53, 204, 305, 323, 454, 186, 185, 304, 430, 473, 184, 303, 429, 451, 472, 20, 291, 292, 414, 415, 71, 179, 341, 475, 517, 535, 547, 162, 222, 241, 418, 474, 487, 493, 499, 505, 511, 523, 529, 541]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 396 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 541/583 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 540 transition count 882
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 477 transition count 882
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 127 place count 477 transition count 863
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 166 place count 457 transition count 863
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 178 place count 453 transition count 855
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 186 place count 445 transition count 855
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 201 place count 430 transition count 840
Iterating global reduction 4 with 15 rules applied. Total rules applied 216 place count 430 transition count 840
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 219 place count 430 transition count 837
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 430 transition count 836
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 429 transition count 836
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 224 place count 426 transition count 833
Iterating global reduction 5 with 3 rules applied. Total rules applied 227 place count 426 transition count 833
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 228 place count 425 transition count 832
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 425 transition count 832
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 230 place count 424 transition count 831
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 424 transition count 831
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 291 place count 394 transition count 801
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 293 place count 394 transition count 799
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 294 place count 393 transition count 798
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 393 transition count 798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 296 place count 393 transition count 797
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 303 place count 393 transition count 790
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 311 place count 385 transition count 790
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 320 place count 385 transition count 790
Applied a total of 320 rules in 80 ms. Remains 385 /541 variables (removed 156) and now considering 790/945 (removed 155) transitions.
// Phase 1: matrix 790 rows 385 cols
[2025-05-29 19:12:16] [INFO ] Computed 60 invariants in 12 ms
[2025-05-29 19:12:17] [INFO ] Implicit Places using invariants in 250 ms returned [122, 128, 131, 133, 134, 153, 154, 225, 231, 234, 236, 241, 242, 294, 311, 317, 320, 322]
[2025-05-29 19:12:17] [INFO ] Actually due to overlaps returned [153, 241, 154, 242, 122, 128, 133, 225, 231, 236, 311, 317, 322, 134, 294]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 251 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 370/583 places, 790/945 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 357 transition count 777
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 357 transition count 777
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 354 transition count 774
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 354 transition count 774
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 350 transition count 770
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 350 transition count 760
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 60 place count 340 transition count 760
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 340 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 339 transition count 759
Applied a total of 62 rules in 47 ms. Remains 339 /370 variables (removed 31) and now considering 759/790 (removed 31) transitions.
// Phase 1: matrix 759 rows 339 cols
[2025-05-29 19:12:17] [INFO ] Computed 45 invariants in 10 ms
[2025-05-29 19:12:17] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-29 19:12:17] [INFO ] Invariant cache hit.
[2025-05-29 19:12:17] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 339/583 places, 759/945 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1497 ms. Remains : 339/583 places, 759/945 transitions.
RANDOM walk for 4000000 steps (84571 resets) in 29815 ms. (134 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2934 resets) in 1125 ms. (355 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2919 resets) in 1111 ms. (359 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2844 resets) in 1133 ms. (352 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2910 resets) in 1127 ms. (354 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2906 resets) in 1111 ms. (359 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2990 resets) in 1102 ms. (362 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2896 resets) in 1123 ms. (355 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2970 resets) in 1117 ms. (357 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2915 resets) in 1100 ms. (363 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2934 resets) in 1068 ms. (374 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2936 resets) in 1071 ms. (373 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2872 resets) in 1072 ms. (372 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2960 resets) in 1083 ms. (369 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2880 resets) in 1123 ms. (355 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2950 resets) in 1090 ms. (366 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (2912 resets) in 1109 ms. (360 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2942 resets) in 1105 ms. (361 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2947 resets) in 1113 ms. (359 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2927 resets) in 1091 ms. (366 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2933 resets) in 1072 ms. (372 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2926 resets) in 1100 ms. (363 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2910 resets) in 1087 ms. (367 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2937 resets) in 1121 ms. (356 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2946 resets) in 1108 ms. (360 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2952 resets) in 1529 ms. (261 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2966 resets) in 1355 ms. (294 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2933 resets) in 1471 ms. (271 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2954 resets) in 1549 ms. (258 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2872 resets) in 1398 ms. (285 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (2970 resets) in 1563 ms. (255 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2972 resets) in 1654 ms. (241 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2922 resets) in 1853 ms. (215 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2920 resets) in 1345 ms. (297 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2899 resets) in 1682 ms. (237 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (2919 resets) in 1992 ms. (200 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2931 resets) in 1433 ms. (278 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2931 resets) in 1717 ms. (232 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2895 resets) in 1559 ms. (256 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2926 resets) in 1468 ms. (272 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2898 resets) in 1421 ms. (281 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2893 resets) in 1511 ms. (264 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2946 resets) in 1577 ms. (253 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2939 resets) in 1512 ms. (264 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2982 resets) in 1605 ms. (249 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (2926 resets) in 1574 ms. (253 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2933 resets) in 1617 ms. (247 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2959 resets) in 1501 ms. (266 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (2893 resets) in 1662 ms. (240 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (2930 resets) in 1710 ms. (233 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (2963 resets) in 1842 ms. (217 steps per ms) remains 85/85 properties
Interrupted probabilistic random walk after 5586856 steps, run timeout after 87001 ms. (steps per millisecond=64 ) properties seen :68 out of 85
Probabilistic random walk after 5586856 steps, saw 2301186 distinct states, run finished after 87001 ms. (steps per millisecond=64 ) properties seen :68
[2025-05-29 19:14:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/48 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 13/61 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 3/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 13/77 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 33/110 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 185/295 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 18/313 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 26/339 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 759/1098 variables, 339/384 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1098 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 0/1098 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 384 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/48 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 13/61 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 3/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 13/77 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 33/110 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 185/295 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 18/313 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-05-29 19:14:16] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 26/339 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/339 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 759/1098 variables, 339/385 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1098 variables, 17/402 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1098 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/1098 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 402 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1744 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
After SMT, in 2814ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2180 ms.
Support contains 17 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 759/759 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 336 transition count 753
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 330 transition count 753
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 15 place count 330 transition count 749
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 324 transition count 749
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 25 place count 324 transition count 748
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 27 place count 323 transition count 748
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 320 transition count 740
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 319 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 319 transition count 738
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 318 transition count 738
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 37 place count 318 transition count 737
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 317 transition count 737
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 43 place count 315 transition count 735
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 315 transition count 734
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 314 transition count 734
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 47 place count 314 transition count 734
Applied a total of 47 rules in 52 ms. Remains 314 /339 variables (removed 25) and now considering 734/759 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 314/339 places, 734/759 transitions.
RANDOM walk for 4000000 steps (84113 resets) in 30375 ms. (131 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2937 resets) in 1275 ms. (313 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2906 resets) in 1203 ms. (332 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2909 resets) in 1268 ms. (315 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2949 resets) in 1252 ms. (319 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2960 resets) in 1249 ms. (320 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2882 resets) in 1354 ms. (295 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2908 resets) in 1187 ms. (336 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2952 resets) in 1240 ms. (322 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2923 resets) in 1254 ms. (318 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2922 resets) in 1426 ms. (280 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2907 resets) in 1196 ms. (334 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (2911 resets) in 1128 ms. (354 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2929 resets) in 1179 ms. (338 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2921 resets) in 1417 ms. (282 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2887 resets) in 1179 ms. (338 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2958 resets) in 1460 ms. (273 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2903 resets) in 1330 ms. (300 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 10290534 steps, run timeout after 57001 ms. (steps per millisecond=180 ) properties seen :16 out of 17
Probabilistic random walk after 10290534 steps, saw 3689177 distinct states, run finished after 57001 ms. (steps per millisecond=180 ) properties seen :16
// Phase 1: matrix 734 rows 314 cols
[2025-05-29 19:15:36] [INFO ] Computed 39 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/32 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 170/202 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 35/237 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:15:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 77/314 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 734/1048 variables, 314/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1048 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1048 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 354 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/32 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 170/202 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 35/237 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 77/314 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 734/1048 variables, 314/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1048 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1048 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1048 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 355 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 587ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 734/734 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 313 transition count 730
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 308 transition count 730
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 308 transition count 728
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 304 transition count 728
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 303 transition count 728
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 303 transition count 727
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 302 transition count 727
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 301 transition count 726
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 301 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 301 transition count 725
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 28 place count 298 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 298 transition count 721
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 30 place count 298 transition count 721
Applied a total of 30 rules in 31 ms. Remains 298 /314 variables (removed 16) and now considering 721/734 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 298/314 places, 721/734 transitions.
RANDOM walk for 4000000 steps (84256 resets) in 7583 ms. (527 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (29015 resets) in 3234 ms. (1236 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1559256 steps, run timeout after 6001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 1559256 steps, saw 984484 distinct states, run finished after 6001 ms. (steps per millisecond=259 ) properties seen :0
// Phase 1: matrix 721 rows 298 cols
[2025-05-29 19:15:45] [INFO ] Computed 34 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/78 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 33/124 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/124 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 140/264 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/282 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 19:15:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/282 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/282 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/298 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/298 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 721/1019 variables, 298/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1019 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1019 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/78 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 33/124 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/124 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 140/264 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/282 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/282 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/282 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/298 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/298 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 721/1019 variables, 298/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1019 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1019 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1019 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 721/721 transitions.
Applied a total of 0 rules in 10 ms. Remains 298 /298 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 298/298 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 721/721 transitions.
Applied a total of 0 rules in 10 ms. Remains 298 /298 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2025-05-29 19:15:46] [INFO ] Invariant cache hit.
[2025-05-29 19:15:46] [INFO ] Implicit Places using invariants in 202 ms returned [0, 18, 26, 79]
[2025-05-29 19:15:46] [INFO ] Actually due to overlaps returned [26, 0, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 204 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 295/298 places, 721/721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 295 transition count 714
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 288 transition count 714
Applied a total of 14 rules in 11 ms. Remains 288 /295 variables (removed 7) and now considering 714/721 (removed 7) transitions.
// Phase 1: matrix 714 rows 288 cols
[2025-05-29 19:15:46] [INFO ] Computed 31 invariants in 7 ms
[2025-05-29 19:15:46] [INFO ] Implicit Places using invariants in 187 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 189 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 287/298 places, 714/721 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 286 transition count 713
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 286 transition count 712
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 285 transition count 712
Applied a total of 4 rules in 23 ms. Remains 285 /287 variables (removed 2) and now considering 712/714 (removed 2) transitions.
// Phase 1: matrix 712 rows 285 cols
[2025-05-29 19:15:46] [INFO ] Computed 30 invariants in 9 ms
[2025-05-29 19:15:46] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-29 19:15:46] [INFO ] Invariant cache hit.
[2025-05-29 19:15:47] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 285/298 places, 712/721 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1134 ms. Remains : 285/298 places, 712/721 transitions.
RANDOM walk for 4000000 steps (84459 resets) in 7152 ms. (559 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (29380 resets) in 3276 ms. (1220 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 862376 steps, run visited all 1 properties in 3258 ms. (steps per millisecond=264 )
Probabilistic random walk after 862376 steps, saw 540499 distinct states, run finished after 3264 ms. (steps per millisecond=264 ) properties seen :1
Able to resolve query StableMarking after proving 731 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 1184904 ms.
ITS solved all properties within timeout

BK_STOP 1748546153378

--------------------
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="ASLink-PT-03a"
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 ASLink-PT-03a, 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 r014-tall-174853743500198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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