MCC'2024- Execution of r135-tall-171631131300555

About the Execution of GreatSPN+red for DoubleExponent-PT-010

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
5574.476	3600000.00	6379492.00	6477.30	?T????FFFTF??F?F	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131300555.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is DoubleExponent-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716377341046

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:29:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 11:29:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:29:02] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-22 11:29:02] [INFO ] Transformed 534 places.
[2024-05-22 11:29:02] [INFO ] Transformed 498 transitions.
[2024-05-22 11:29:02] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 531 transition count 498
Applied a total of 3 rules in 73 ms. Remains 531 /534 variables (removed 3) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 531 cols
[2024-05-22 11:29:02] [INFO ] Computed 52 invariants in 75 ms
[2024-05-22 11:29:03] [INFO ] Implicit Places using invariants in 515 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 547 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 528 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 528 transition count 497
Applied a total of 2 rules in 78 ms. Remains 528 /529 variables (removed 1) and now considering 497/498 (removed 1) transitions.
// Phase 1: matrix 497 rows 528 cols
[2024-05-22 11:29:03] [INFO ] Computed 50 invariants in 34 ms
[2024-05-22 11:29:03] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-22 11:29:03] [INFO ] Invariant cache hit.
[2024-05-22 11:29:05] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 528/534 places, 497/498 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2417 ms. Remains : 528/534 places, 497/498 transitions.
Support contains 44 out of 528 places after structural reductions.
[2024-05-22 11:29:05] [INFO ] Flatten gal took : 62 ms
[2024-05-22 11:29:05] [INFO ] Flatten gal took : 31 ms
[2024-05-22 11:29:05] [INFO ] Input system was already deterministic with 497 transitions.
Support contains 43 out of 528 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (1322 resets) in 1975 ms. (20 steps per ms) remains 22/28 properties
BEST_FIRST walk for 4000 steps (113 resets) in 149 ms. (26 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (113 resets) in 63 ms. (62 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (116 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (116 resets) in 122 ms. (32 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (112 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (117 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (114 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (118 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (111 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (112 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (106 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (110 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (106 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (107 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (111 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (115 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (110 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (106 resets) in 75 ms. (52 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (105 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (111 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (106 resets) in 28 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (109 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
[2024-05-22 11:29:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 362/397 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 5/402 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 125/527 variables, 43/49 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/49 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/528 variables, 1/50 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/50 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 497/1025 variables, 528/578 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1025 variables, 0/578 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/1025 variables, 0/578 constraints. Problems are: Problem set: 8 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 578 constraints, problems are : Problem set: 8 solved, 14 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 370/397 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 5/402 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 125/527 variables, 43/49 constraints. Problems are: Problem set: 8 solved, 14 unsolved
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 203 places in 210 ms of which 32 ms to minimize.
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 5 ms to minimize.
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 5 ms to minimize.
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 191 places in 157 ms of which 4 ms to minimize.
[2024-05-22 11:29:10] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 4 ms to minimize.
[2024-05-22 11:29:10] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 4 ms to minimize.
[2024-05-22 11:29:10] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 3 ms to minimize.
[2024-05-22 11:29:10] [INFO ] Deduced a trap composed of 215 places in 151 ms of which 4 ms to minimize.
[2024-05-22 11:29:10] [INFO ] Deduced a trap composed of 228 places in 149 ms of which 3 ms to minimize.
[2024-05-22 11:29:10] [INFO ] Deduced a trap composed of 235 places in 147 ms of which 3 ms to minimize.
[2024-05-22 11:29:11] [INFO ] Deduced a trap composed of 199 places in 152 ms of which 4 ms to minimize.
[2024-05-22 11:29:11] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 4 ms to minimize.
[2024-05-22 11:29:11] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2024-05-22 11:29:11] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 3 ms to minimize.
[2024-05-22 11:29:11] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 4 ms to minimize.
[2024-05-22 11:29:11] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 3 ms to minimize.
[2024-05-22 11:29:12] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 4 ms to minimize.
[2024-05-22 11:29:12] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 4 ms to minimize.
[2024-05-22 11:29:12] [INFO ] Deduced a trap composed of 214 places in 145 ms of which 4 ms to minimize.
[2024-05-22 11:29:12] [INFO ] Deduced a trap composed of 223 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 20/69 constraints. Problems are: Problem set: 8 solved, 14 unsolved
[2024-05-22 11:29:12] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 3 ms to minimize.
[2024-05-22 11:29:12] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 3 ms to minimize.
[2024-05-22 11:29:13] [INFO ] Deduced a trap composed of 224 places in 159 ms of which 4 ms to minimize.
[2024-05-22 11:29:13] [INFO ] Deduced a trap composed of 213 places in 140 ms of which 3 ms to minimize.
[2024-05-22 11:29:13] [INFO ] Deduced a trap composed of 230 places in 140 ms of which 3 ms to minimize.
[2024-05-22 11:29:13] [INFO ] Deduced a trap composed of 230 places in 146 ms of which 4 ms to minimize.
SMT process timed out in 6930ms, After SMT, problems are : Problem set: 8 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 497/497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 528 transition count 401
Reduce places removed 96 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 103 rules applied. Total rules applied 199 place count 432 transition count 394
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 206 place count 425 transition count 394
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 206 place count 425 transition count 372
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 250 place count 403 transition count 372
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 404 place count 326 transition count 295
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 436 place count 310 transition count 295
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 437 place count 310 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 438 place count 309 transition count 294
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 4 with 39 rules applied. Total rules applied 477 place count 309 transition count 255
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 516 place count 270 transition count 255
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 557 place count 270 transition count 255
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 558 place count 270 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 559 place count 269 transition count 254
Applied a total of 559 rules in 190 ms. Remains 269 /528 variables (removed 259) and now considering 254/497 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 269/528 places, 254/497 transitions.
RANDOM walk for 40000 steps (5057 resets) in 660 ms. (60 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40002 steps (3400 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3329 resets) in 260 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3383 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3361 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3360 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3356 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3369 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3378 resets) in 223 ms. (178 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3331 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3388 resets) in 140 ms. (283 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 140 ms. (283 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3386 resets) in 176 ms. (225 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3340 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 230798 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :1 out of 13
Probabilistic random walk after 230798 steps, saw 115453 distinct states, run finished after 3008 ms. (steps per millisecond=76 ) properties seen :1
// Phase 1: matrix 254 rows 269 cols
[2024-05-22 11:29:17] [INFO ] Computed 50 invariants in 20 ms
[2024-05-22 11:29:17] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 196/219 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2/221 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 46/267 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 254/521 variables, 267/316 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 32/348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2/523 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/523 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/523 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 351 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 269/269 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 196/219 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 109 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 103 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 93 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 105 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 110 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:29:19] [INFO ] Deduced a trap composed of 111 places in 79 ms of which 5 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 110 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 114 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 118 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 105 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 124 places in 101 ms of which 1 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 114 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:20] [INFO ] Deduced a trap composed of 119 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 121 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 113 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 133 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 129 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 108 places in 80 ms of which 2 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 118 places in 81 ms of which 2 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 122 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 131 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 127 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 128 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 130 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:21] [INFO ] Deduced a trap composed of 126 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 130 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 116 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 118 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 123 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 117 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 106 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:22] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 114 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 110 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 112 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 127 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 112 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 124 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 115 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:23] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 111 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 104 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 119 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 129 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 123 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 112 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 114 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:24] [INFO ] Deduced a trap composed of 114 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 115 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 111 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 105 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 117 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 117 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 106 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 114 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:25] [INFO ] Deduced a trap composed of 110 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 109 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 112 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 104 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 106 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 118 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 116 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 112 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 111 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:26] [INFO ] Deduced a trap composed of 124 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 101 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 111 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 111 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 116 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 112 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 118 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 107 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 114 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 121 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 122 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 110 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 120 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:27] [INFO ] Deduced a trap composed of 105 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 114 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 113 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 122 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 104 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 125 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:28] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 110 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 102 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 112 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 104 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 107 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 103 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 116 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 105 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 121 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 112 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 119 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 128 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 115 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 130 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 123 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 120 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 108 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:30] [INFO ] Deduced a trap composed of 122 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 126 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 112 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 122 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 105 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 125 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 115 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 119 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 114 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 115 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 124 places in 87 ms of which 7 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 127 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 120 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 124 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 120 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 102 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 98 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 123 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 110 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 107 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 107 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 106 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 107 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 110 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 108 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 108 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 110 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 107 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 121 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 118 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 121 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 117 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 124 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 124 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 123 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 120 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 115 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 109 places in 81 ms of which 2 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 106 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 108 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 110 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 119 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 127 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 124 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 113 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 3 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 106 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 109 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 108 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 127 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 113 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 120 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 116 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 119 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 119 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 120 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 118 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 94 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 116 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 115 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 96 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 122 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:37] [INFO ] Deduced a trap composed of 115 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 117 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 118 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 126 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 123 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 116 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 113 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 116 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 116 places in 67 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:38] [INFO ] Deduced a trap composed of 118 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 115 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 100 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 108 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 117 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 120 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 121 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 112 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 118 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:29:39] [INFO ] Deduced a trap composed of 118 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 130 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 115 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 119 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 113 places in 65 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 107 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 107 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 107 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 123 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 118 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 118 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 123 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 120 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:40] [INFO ] Deduced a trap composed of 125 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 121 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 125 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 119 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 124 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 105 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 126 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 110 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:41] [INFO ] Deduced a trap composed of 110 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 104 places in 69 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 114 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 109 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 124 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 118 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 117 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:29:42] [INFO ] Deduced a trap composed of 108 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 114 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 115 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 122 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 105 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 102 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 128 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 122 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 107 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 114 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 114 places in 59 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:43] [INFO ] Deduced a trap composed of 110 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 107 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 117 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 110 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 111 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 111 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 111 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 111 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 118 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 119 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:44] [INFO ] Deduced a trap composed of 113 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 104 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 119 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 110 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 106 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 107 places in 65 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 112 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 99 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 120 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:45] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 124 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 101 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 111 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 107 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 121 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 100 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 120 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 120 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 107 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 102 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:46] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:47] [INFO ] Deduced a trap composed of 115 places in 69 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 20/367 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:47] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:47] [INFO ] Deduced a trap composed of 104 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:47] [INFO ] Deduced a trap composed of 97 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:47] [INFO ] Deduced a trap composed of 113 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:47] [INFO ] Deduced a trap composed of 106 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:47] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:29:47] [INFO ] Deduced a trap composed of 113 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 122 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 112 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 100 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 116 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 111 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 106 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 106 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 96 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 111 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:48] [INFO ] Deduced a trap composed of 113 places in 74 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 20/387 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 124 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 121 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 118 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 114 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 110 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 110 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 106 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:49] [INFO ] Deduced a trap composed of 122 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 120 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 112 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 117 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 112 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 125 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:29:50] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 125 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 101 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 103 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 97 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 121 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 114 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 109 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:51] [INFO ] Deduced a trap composed of 118 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 107 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 102 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 101 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 118 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 119 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 108 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 125 places in 67 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 117 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 117 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 113 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 102 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 123 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 118 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 103 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 124 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:29:53] [INFO ] Deduced a trap composed of 125 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 125 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 122 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 125 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 109 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 107 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 123 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 129 places in 64 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/219 variables, 20/447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 110 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 122 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 110 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:54] [INFO ] Deduced a trap composed of 119 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 115 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 108 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 118 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 122 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 119 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 120 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 113 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 120 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 120 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 122 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 111 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:55] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 109 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 117 places in 66 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/219 variables, 20/467 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 121 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 106 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 115 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 116 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 116 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 121 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:29:56] [INFO ] Deduced a trap composed of 110 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 108 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 120 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 125 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 119 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 107 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 111 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 110 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 118 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 111 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:29:57] [INFO ] Deduced a trap composed of 119 places in 65 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/219 variables, 20/487 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 118 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 112 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 111 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 124 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 128 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:58] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 102 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 104 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 116 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 112 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 122 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 123 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 118 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:29:59] [INFO ] Deduced a trap composed of 113 places in 64 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 20/507 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:00] [INFO ] Deduced a trap composed of 100 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:30:00] [INFO ] Deduced a trap composed of 106 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:30:00] [INFO ] Deduced a trap composed of 107 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:00] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:30:00] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:00] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:30:00] [INFO ] Deduced a trap composed of 102 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 120 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 118 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 110 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 102 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 123 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 121 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 102 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 108 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 124 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:30:01] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 20/527 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:02] [INFO ] Deduced a trap composed of 115 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:30:02] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:30:02] [INFO ] Deduced a trap composed of 121 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:30:02] [INFO ] Deduced a trap composed of 105 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:30:02] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 115 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 108 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 107 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 116 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 129 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 118 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 109 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 116 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 109 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:30:03] [INFO ] Deduced a trap composed of 107 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:30:04] [INFO ] Deduced a trap composed of 124 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:30:04] [INFO ] Deduced a trap composed of 108 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:30:04] [INFO ] Deduced a trap composed of 117 places in 69 ms of which 1 ms to minimize.
SMT process timed out in 46207ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 254/254 transitions.
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 8 place count 265 transition count 250
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 265 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 264 transition count 249
Applied a total of 10 rules in 36 ms. Remains 264 /269 variables (removed 5) and now considering 249/254 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 264/269 places, 249/254 transitions.
RANDOM walk for 40000 steps (5073 resets) in 256 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3343 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3411 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3346 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3393 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3342 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3370 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3397 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3410 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 269808 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 12
Probabilistic random walk after 269808 steps, saw 134964 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
// Phase 1: matrix 249 rows 264 cols
[2024-05-22 11:30:07] [INFO ] Computed 50 invariants in 15 ms
[2024-05-22 11:30:07] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 197/220 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 40/260 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 249/509 variables, 260/308 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 32/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 4/513 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/513 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 346 constraints, problems are : Problem set: 0 solved, 12 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 264/264 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 197/220 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:08] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 118 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:30:09] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:30:10] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 102 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 100 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 98 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 100 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:30:11] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 101 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:30:12] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:30:13] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:30:14] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 108 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:15] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 110 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:30:17] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 115 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 40/260 variables, 15/168 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:30:18] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:30:19] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-22 11:30:20] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 2 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:30:21] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:30:22] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:22] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:30:22] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:30:22] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 249/509 variables, 260/471 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 32/503 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/509 variables, 12/515 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:25] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/509 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:26] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:30:26] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:30:26] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 3/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 4/513 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/513 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/513 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:28] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:30:28] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:30:28] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:30:28] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/513 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:30:29] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:30:29] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/513 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/513 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 0/513 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 531 constraints, problems are : Problem set: 0 solved, 12 unsolved in 23166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 264/264 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 173/173 constraints]
After SMT, in 24047ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 23 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 249/249 transitions.
Applied a total of 0 rules in 14 ms. Remains 264 /264 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 264/264 places, 249/249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 249/249 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2024-05-22 11:31:01] [INFO ] Invariant cache hit.
[2024-05-22 11:31:02] [INFO ] Implicit Places using invariants in 287 ms returned [20, 26, 50, 55, 82, 89, 111, 117, 143, 148, 149, 171, 176, 201, 208, 215, 255, 261]
[2024-05-22 11:31:02] [INFO ] Actually due to overlaps returned [55, 215, 50, 148]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 288 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 260/264 places, 249/249 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 260 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 259 transition count 248
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 259 transition count 248
Applied a total of 4 rules in 22 ms. Remains 259 /260 variables (removed 1) and now considering 248/249 (removed 1) transitions.
// Phase 1: matrix 248 rows 259 cols
[2024-05-22 11:31:02] [INFO ] Computed 46 invariants in 16 ms
[2024-05-22 11:31:02] [INFO ] Implicit Places using invariants in 238 ms returned [20, 26, 80, 87, 109, 115, 141, 146, 168, 173, 198, 205, 250, 256]
[2024-05-22 11:31:02] [INFO ] Actually due to overlaps returned [87, 256, 250, 80]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 239 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/264 places, 248/249 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 255 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 254 transition count 247
Applied a total of 4 rules in 20 ms. Remains 254 /255 variables (removed 1) and now considering 247/248 (removed 1) transitions.
// Phase 1: matrix 247 rows 254 cols
[2024-05-22 11:31:02] [INFO ] Computed 42 invariants in 9 ms
[2024-05-22 11:31:02] [INFO ] Implicit Places using invariants in 198 ms returned [20, 26, 107, 113, 139, 144, 166, 171, 196, 203]
[2024-05-22 11:31:02] [INFO ] Actually due to overlaps returned [113, 20, 107, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 201 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 250/264 places, 247/249 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 250 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 248 transition count 245
Applied a total of 4 rules in 14 ms. Remains 248 /250 variables (removed 2) and now considering 245/247 (removed 2) transitions.
// Phase 1: matrix 245 rows 248 cols
[2024-05-22 11:31:02] [INFO ] Computed 38 invariants in 10 ms
[2024-05-22 11:31:02] [INFO ] Implicit Places using invariants in 179 ms returned [133, 138, 160, 165, 190, 197]
[2024-05-22 11:31:02] [INFO ] Actually due to overlaps returned [138, 133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 194 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 246/264 places, 245/249 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 245 transition count 244
Applied a total of 2 rules in 16 ms. Remains 245 /246 variables (removed 1) and now considering 244/245 (removed 1) transitions.
// Phase 1: matrix 244 rows 245 cols
[2024-05-22 11:31:02] [INFO ] Computed 36 invariants in 9 ms
[2024-05-22 11:31:03] [INFO ] Implicit Places using invariants in 156 ms returned [157, 162, 187, 194]
[2024-05-22 11:31:03] [INFO ] Actually due to overlaps returned [162, 157]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 158 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 243/264 places, 244/249 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 1167 ms. Remains : 243/264 places, 244/249 transitions.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA DoubleExponent-PT-010-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 896 edges and 528 vertex of which 525 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 241 place count 405 transition count 354
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 463 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 499 place count 276 transition count 264
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 276 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 502 place count 275 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 503 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 274 transition count 262
Applied a total of 504 rules in 77 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 11:31:03] [INFO ] Computed 49 invariants in 8 ms
[2024-05-22 11:31:03] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 11:31:03] [INFO ] Invariant cache hit.
[2024-05-22 11:31:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:31:04] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2024-05-22 11:31:04] [INFO ] Redundant transitions in 14 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 11:31:04] [INFO ] Invariant cache hit.
[2024-05-22 11:31:04] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:31:18] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:31:19] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-22 11:31:20] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:31:20] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:31:20] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:31:21] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:31:26] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 348 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60091ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61660 ms. Remains : 274/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-00
Product exploration explored 100000 steps with 13876 reset in 224 ms.
Product exploration explored 100000 steps with 13854 reset in 157 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5505 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3247 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 818810 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 818810 steps, saw 409533 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2024-05-22 11:32:08] [INFO ] Invariant cache hit.
[2024-05-22 11:32:08] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/74 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/108 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 96/204 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 77/281 variables, 24/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/289 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 227/516 variables, 226/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/516 variables, 15/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/516 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 20/536 variables, 19/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/536 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/74 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/108 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 96/204 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 77/281 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 227/516 variables, 226/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/516 variables, 15/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/516 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/536 variables, 19/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:32:09] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/536 variables, 10/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/536 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1116ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3369 ms.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 812 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 237 transition count 225
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 113 place count 237 transition count 225
Applied a total of 113 rules in 19 ms. Remains 237 /274 variables (removed 37) and now considering 225/262 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 237/274 places, 225/262 transitions.
RANDOM walk for 40000 steps (5052 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3372 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 824277 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 1
Probabilistic random walk after 824277 steps, saw 412426 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
// Phase 1: matrix 225 rows 237 cols
[2024-05-22 11:32:16] [INFO ] Computed 49 invariants in 19 ms
[2024-05-22 11:32:16] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/221 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/232 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/457 variables, 232/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 36/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/462 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 237/237 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/221 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-22 11:32:16] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 1 ms to minimize.
[2024-05-22 11:32:17] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 1 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:32:18] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:32:19] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:32:20] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:32:21] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:32:22] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:32:23] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:32:23] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:32:23] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/232 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:23] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 225/457 variables, 232/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 36/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/462 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/462 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 237/237 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 67/67 constraints]
After SMT, in 7330ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3379 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-22 11:32:27] [INFO ] Invariant cache hit.
[2024-05-22 11:32:27] [INFO ] Implicit Places using invariants in 324 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 155, 178, 184, 191, 228, 234]
[2024-05-22 11:32:27] [INFO ] Actually due to overlaps returned [191, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 339 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 224
Applied a total of 2 rules in 12 ms. Remains 234 /235 variables (removed 1) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 234 cols
[2024-05-22 11:32:27] [INFO ] Computed 47 invariants in 8 ms
[2024-05-22 11:32:27] [INFO ] Implicit Places using invariants in 313 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 177, 183, 225, 231]
[2024-05-22 11:32:27] [INFO ] Actually due to overlaps returned [231, 225]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 315 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/237 places, 224/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Applied a total of 2 rules in 10 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 11:32:27] [INFO ] Computed 45 invariants in 11 ms
[2024-05-22 11:32:28] [INFO ] Implicit Places using invariants in 303 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 177, 183]
[2024-05-22 11:32:28] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 305 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/237 places, 223/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 222
Applied a total of 2 rules in 9 ms. Remains 228 /229 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 228 cols
[2024-05-22 11:32:28] [INFO ] Computed 43 invariants in 13 ms
[2024-05-22 11:32:28] [INFO ] Implicit Places using invariants in 248 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 174, 180]
[2024-05-22 11:32:28] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 226/237 places, 222/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 9 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 11:32:28] [INFO ] Computed 41 invariants in 8 ms
[2024-05-22 11:32:28] [INFO ] Implicit Places using invariants in 220 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 171, 177]
[2024-05-22 11:32:28] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 221 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/237 places, 221/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 8 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 222 cols
[2024-05-22 11:32:28] [INFO ] Computed 39 invariants in 10 ms
[2024-05-22 11:32:28] [INFO ] Implicit Places using invariants in 202 ms returned [88, 94, 115, 120, 140, 145, 168, 174]
[2024-05-22 11:32:28] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 217 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/237 places, 220/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 8 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 11:32:28] [INFO ] Computed 37 invariants in 10 ms
[2024-05-22 11:32:29] [INFO ] Implicit Places using invariants in 196 ms returned [112, 117, 137, 142, 165, 171]
[2024-05-22 11:32:29] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 198 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 217/237 places, 219/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 8 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 11:32:29] [INFO ] Computed 35 invariants in 10 ms
[2024-05-22 11:32:29] [INFO ] Implicit Places using invariants in 179 ms returned [134, 139, 162, 168]
[2024-05-22 11:32:29] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 189 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 214/237 places, 218/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 8 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 11:32:29] [INFO ] Computed 33 invariants in 14 ms
[2024-05-22 11:32:29] [INFO ] Implicit Places using invariants in 182 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 183 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/237 places, 217/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 10 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 11:32:29] [INFO ] Computed 31 invariants in 13 ms
[2024-05-22 11:32:29] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 11:32:29] [INFO ] Invariant cache hit.
[2024-05-22 11:32:29] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 11:32:31] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 4283 ms. Remains : 210/237 places, 216/225 transitions.
RANDOM walk for 40000 steps (5714 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3634 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 890117 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 1
Probabilistic random walk after 890117 steps, saw 445153 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
[2024-05-22 11:32:34] [INFO ] Invariant cache hit.
[2024-05-22 11:32:34] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 36/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/426 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:34] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/205 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 216/421 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 36/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:34] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:35] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:32:35] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:32:35] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:32:35] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:32:35] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-22 11:32:35] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:32:35] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:32:35] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:32:36] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:32:37] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:32:37] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:32:37] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:32:37] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:32:37] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:32:37] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:32:37] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:32:38] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:32:38] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:32:38] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 7/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3634 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 3851ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1344 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 11:32:39] [INFO ] Invariant cache hit.
[2024-05-22 11:32:39] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 11:32:39] [INFO ] Invariant cache hit.
[2024-05-22 11:32:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 11:32:41] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2024-05-22 11:32:41] [INFO ] Redundant transitions in 4 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 11:32:41] [INFO ] Invariant cache hit.
[2024-05-22 11:32:41] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 277 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9818 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 215/492 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:33:00] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:33:00] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-22 11:33:01] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:33:04] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:33:04] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:33:04] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:33:04] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:33:04] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:33:04] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:33:05] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:33:06] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:33:11] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:33:12] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:33:12] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:33:13] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:33:13] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:33:13] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:33:13] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:33:13] [INFO ] Deduced a trap composed of 95 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:33:13] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:33:14] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:33:14] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 11/523 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:33:20] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 524 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 32/32 constraints]
After SMT, in 39938ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39940ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41967 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 16 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 11:33:21] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 11:33:21] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:33:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 11:33:21] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 11:33:21] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:33:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:33:21] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:33:21] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:33:22] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:33:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
TRAPS : Iteration 1
[2024-05-22 11:33:22] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:33:22] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:33:22] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:33:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
TRAPS : Iteration 2
[2024-05-22 11:33:22] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:33:22] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 726 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 11:33:22] [INFO ] Computed 49 invariants in 8 ms
[2024-05-22 11:33:22] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-22 11:33:22] [INFO ] Invariant cache hit.
[2024-05-22 11:33:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:33:24] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
[2024-05-22 11:33:24] [INFO ] Redundant transitions in 6 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 11:33:24] [INFO ] Invariant cache hit.
[2024-05-22 11:33:24] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:33:36] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:33:38] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:33:38] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:33:38] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:33:39] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:33:39] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:33:44] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 348 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60073ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61615 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5483 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3291 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 705202 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 1
Probabilistic random walk after 705202 steps, saw 352710 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
[2024-05-22 11:34:27] [INFO ] Invariant cache hit.
[2024-05-22 11:34:27] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/74 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/108 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 96/204 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 77/281 variables, 24/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/289 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 227/516 variables, 226/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/516 variables, 15/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/516 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 20/536 variables, 19/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/536 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/74 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/108 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 96/204 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 77/281 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 227/516 variables, 226/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/516 variables, 15/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/516 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/536 variables, 19/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:27] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:34:27] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:34:28] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:34:28] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:34:28] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:34:28] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:34:28] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:34:28] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-22 11:34:28] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:34:28] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/536 variables, 10/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/536 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1064ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3285 ms.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 812 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 237 transition count 225
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 113 place count 237 transition count 225
Applied a total of 113 rules in 25 ms. Remains 237 /274 variables (removed 37) and now considering 225/262 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 237/274 places, 225/262 transitions.
RANDOM walk for 40000 steps (5068 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3403 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 739297 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 739297 steps, saw 369898 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
// Phase 1: matrix 225 rows 237 cols
[2024-05-22 11:34:34] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 11:34:34] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/221 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/232 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/457 variables, 232/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 36/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/462 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 237/237 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/221 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 5 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/232 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 225/457 variables, 232/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 36/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/462 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/462 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7081 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 237/237 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 67/67 constraints]
After SMT, in 7260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3250 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-22 11:34:45] [INFO ] Invariant cache hit.
[2024-05-22 11:34:45] [INFO ] Implicit Places using invariants in 327 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 155, 178, 184, 191, 228, 234]
[2024-05-22 11:34:45] [INFO ] Actually due to overlaps returned [191, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 337 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 224
Applied a total of 2 rules in 8 ms. Remains 234 /235 variables (removed 1) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 234 cols
[2024-05-22 11:34:45] [INFO ] Computed 47 invariants in 7 ms
[2024-05-22 11:34:45] [INFO ] Implicit Places using invariants in 284 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 177, 183, 225, 231]
[2024-05-22 11:34:46] [INFO ] Actually due to overlaps returned [231, 225]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 296 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/237 places, 224/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Applied a total of 2 rules in 8 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 11:34:46] [INFO ] Computed 45 invariants in 14 ms
[2024-05-22 11:34:46] [INFO ] Implicit Places using invariants in 258 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 177, 183]
[2024-05-22 11:34:46] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 269 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/237 places, 223/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 222
Applied a total of 2 rules in 7 ms. Remains 228 /229 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 228 cols
[2024-05-22 11:34:46] [INFO ] Computed 43 invariants in 9 ms
[2024-05-22 11:34:46] [INFO ] Implicit Places using invariants in 255 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 174, 180]
[2024-05-22 11:34:46] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 268 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 226/237 places, 222/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 8 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 11:34:46] [INFO ] Computed 41 invariants in 7 ms
[2024-05-22 11:34:46] [INFO ] Implicit Places using invariants in 261 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 171, 177]
[2024-05-22 11:34:46] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 264 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/237 places, 221/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 8 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 222 cols
[2024-05-22 11:34:46] [INFO ] Computed 39 invariants in 9 ms
[2024-05-22 11:34:47] [INFO ] Implicit Places using invariants in 315 ms returned [88, 94, 115, 120, 140, 145, 168, 174]
[2024-05-22 11:34:47] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 316 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/237 places, 220/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 7 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 11:34:47] [INFO ] Computed 37 invariants in 12 ms
[2024-05-22 11:34:47] [INFO ] Implicit Places using invariants in 171 ms returned [112, 117, 137, 142, 165, 171]
[2024-05-22 11:34:47] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 172 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 217/237 places, 219/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 7 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 11:34:47] [INFO ] Computed 35 invariants in 12 ms
[2024-05-22 11:34:47] [INFO ] Implicit Places using invariants in 172 ms returned [134, 139, 162, 168]
[2024-05-22 11:34:47] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 173 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 214/237 places, 218/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 7 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 11:34:47] [INFO ] Computed 33 invariants in 12 ms
[2024-05-22 11:34:47] [INFO ] Implicit Places using invariants in 167 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 167 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/237 places, 217/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 7 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 11:34:47] [INFO ] Computed 31 invariants in 12 ms
[2024-05-22 11:34:47] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 11:34:47] [INFO ] Invariant cache hit.
[2024-05-22 11:34:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 11:34:49] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 4250 ms. Remains : 210/237 places, 216/225 transitions.
RANDOM walk for 40000 steps (5745 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3643 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 805217 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 805217 steps, saw 402692 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
[2024-05-22 11:34:52] [INFO ] Invariant cache hit.
[2024-05-22 11:34:52] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 36/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/426 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/205 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 216/421 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 36/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 7/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3637 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 3846ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1197 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 11:34:57] [INFO ] Invariant cache hit.
[2024-05-22 11:34:57] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 11:34:57] [INFO ] Invariant cache hit.
[2024-05-22 11:34:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 11:34:59] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2024-05-22 11:34:59] [INFO ] Redundant transitions in 3 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 11:34:59] [INFO ] Invariant cache hit.
[2024-05-22 11:34:59] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 277 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9470 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 215/492 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:35:17] [INFO ] Deduced a trap composed of 96 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:35:18] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:35:18] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:35:21] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:35:22] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:35:23] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:35:23] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:35:23] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:35:23] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:35:23] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:35:28] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:35:29] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:35:29] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:35:30] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:35:30] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:35:30] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:35:30] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:35:30] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:35:30] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:35:31] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:35:31] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 11/523 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:35:37] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 524 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 32/32 constraints]
After SMT, in 39575ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39577ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41474 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 14 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 11:35:39] [INFO ] Computed 31 invariants in 8 ms
[2024-05-22 11:35:39] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:35:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 11:35:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 11:35:39] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:35:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:35:39] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:35:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:35:39] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 11:35:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
TRAPS : Iteration 1
[2024-05-22 11:35:39] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:35:39] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:35:39] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:35:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
TRAPS : Iteration 2
[2024-05-22 11:35:39] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:35:39] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 613 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13867 reset in 96 ms.
Product exploration explored 100000 steps with 14006 reset in 101 ms.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 11:35:40] [INFO ] Computed 49 invariants in 8 ms
[2024-05-22 11:35:40] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 11:35:40] [INFO ] Invariant cache hit.
[2024-05-22 11:35:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:35:41] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
[2024-05-22 11:35:41] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 11:35:41] [INFO ] Invariant cache hit.
[2024-05-22 11:35:41] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:35:54] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:35:56] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-22 11:35:56] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:35:56] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:35:56] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2024-05-22 11:35:57] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:36:02] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 348 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60065ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61424 ms. Remains : 274/274 places, 262/262 transitions.
Treatment of property DoubleExponent-PT-010-LTLCardinality-00 finished in 338499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 525 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 408 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 28 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 11:36:41] [INFO ] Computed 49 invariants in 9 ms
[2024-05-22 11:36:42] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-22 11:36:42] [INFO ] Invariant cache hit.
[2024-05-22 11:36:42] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 11:36:43] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2024-05-22 11:36:43] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 11:36:43] [INFO ] Invariant cache hit.
[2024-05-22 11:36:43] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:36:55] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:36:55] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:36:55] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:36:56] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:36:57] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:36:58] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 346 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/536 variables, and 597 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/6 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61472 ms. Remains : 274/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-02
Product exploration explored 100000 steps with 13993 reset in 103 ms.
Product exploration explored 100000 steps with 13879 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (5569 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3285 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 727268 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 727268 steps, saw 363743 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2024-05-22 11:37:46] [INFO ] Invariant cache hit.
[2024-05-22 11:37:46] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/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) 43/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/108 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/174 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/233 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/238 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/532 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/536 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/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) 43/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/108 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/174 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/233 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/238 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:37:47] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:37:47] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:37:47] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/536 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/536 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/536 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/536 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 967ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 236 transition count 224
Applied a total of 116 rules in 21 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 236/274 places, 224/262 transitions.
RANDOM walk for 40000 steps (5008 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3330 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 729955 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 729955 steps, saw 365222 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 224 rows 236 cols
[2024-05-22 11:37:50] [INFO ] Computed 49 invariants in 17 ms
[2024-05-22 11:37:50] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/218 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/231 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/455 variables, 231/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/460 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/218 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/231 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 224/455 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 37/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/460 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/460 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1667ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 11:37:52] [INFO ] Invariant cache hit.
[2024-05-22 11:37:52] [INFO ] Implicit Places using invariants in 302 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 151, 156, 179, 185, 192, 227, 233]
[2024-05-22 11:37:52] [INFO ] Actually due to overlaps returned [192, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 304 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 223
Applied a total of 2 rules in 8 ms. Remains 233 /234 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 233 cols
[2024-05-22 11:37:52] [INFO ] Computed 47 invariants in 10 ms
[2024-05-22 11:37:53] [INFO ] Implicit Places using invariants in 276 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 178, 184, 224, 230]
[2024-05-22 11:37:53] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 278 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 222
Applied a total of 2 rules in 8 ms. Remains 230 /231 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 230 cols
[2024-05-22 11:37:53] [INFO ] Computed 45 invariants in 13 ms
[2024-05-22 11:37:53] [INFO ] Implicit Places using invariants in 252 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 178, 184]
[2024-05-22 11:37:53] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 253 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 222/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 221
Applied a total of 2 rules in 7 ms. Remains 227 /228 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 227 cols
[2024-05-22 11:37:53] [INFO ] Computed 43 invariants in 13 ms
[2024-05-22 11:37:53] [INFO ] Implicit Places using invariants in 221 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 147, 152, 175, 181]
[2024-05-22 11:37:53] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 223 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 220
Applied a total of 2 rules in 7 ms. Remains 224 /225 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 224 cols
[2024-05-22 11:37:53] [INFO ] Computed 41 invariants in 8 ms
[2024-05-22 11:37:53] [INFO ] Implicit Places using invariants in 193 ms returned [66, 71, 91, 97, 118, 123, 144, 149, 172, 178]
[2024-05-22 11:37:53] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 195 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 220/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 219
Applied a total of 2 rules in 6 ms. Remains 221 /222 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 221 cols
[2024-05-22 11:37:53] [INFO ] Computed 39 invariants in 10 ms
[2024-05-22 11:37:53] [INFO ] Implicit Places using invariants in 173 ms returned [88, 94, 115, 120, 141, 146, 169, 175]
[2024-05-22 11:37:53] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 174 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 218
Applied a total of 2 rules in 7 ms. Remains 218 /219 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 218 cols
[2024-05-22 11:37:53] [INFO ] Computed 37 invariants in 7 ms
[2024-05-22 11:37:54] [INFO ] Implicit Places using invariants in 166 ms returned [112, 117, 138, 143, 166, 172]
[2024-05-22 11:37:54] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 167 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 217
Applied a total of 2 rules in 7 ms. Remains 215 /216 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 215 cols
[2024-05-22 11:37:54] [INFO ] Computed 35 invariants in 12 ms
[2024-05-22 11:37:54] [INFO ] Implicit Places using invariants in 164 ms returned [135, 140, 163, 169]
[2024-05-22 11:37:54] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 165 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 216
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 212 cols
[2024-05-22 11:37:54] [INFO ] Computed 33 invariants in 11 ms
[2024-05-22 11:37:54] [INFO ] Implicit Places using invariants in 150 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 216/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 215
Applied a total of 2 rules in 7 ms. Remains 209 /210 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-22 11:37:54] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 11:37:54] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 11:37:54] [INFO ] Invariant cache hit.
[2024-05-22 11:37:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 11:37:56] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 215/224 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3525 ms. Remains : 209/236 places, 215/224 transitions.
RANDOM walk for 40000 steps (5690 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3628 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 799990 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 799990 steps, saw 400084 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-05-22 11:37:59] [INFO ] Invariant cache hit.
[2024-05-22 11:37:59] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/204 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 215/419 variables, 204/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 37/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/424 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 107 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 99 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 105 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 100 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 102 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/204 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:37:59] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:38:00] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:38:00] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:38:00] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:38:00] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:38:00] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/419 variables, 204/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 37/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:38:00] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/424 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 1781ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 11:38:00] [INFO ] Invariant cache hit.
[2024-05-22 11:38:00] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 11:38:00] [INFO ] Invariant cache hit.
[2024-05-22 11:38:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 11:38:02] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2024-05-22 11:38:02] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 11:38:02] [INFO ] Invariant cache hit.
[2024-05-22 11:38:02] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9492 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 214/491 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 11:38:22] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:38:23] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 10/501 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 11:38:29] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:38:29] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:38:30] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:38:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:38:30] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:38:30] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:38:30] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:38:30] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:38:31] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:38:32] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:38:32] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:38:32] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:38:32] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:38:32] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:38:32] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:38:32] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:38:32] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:38:33] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:38:33] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:38:33] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 20/521 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 11:38:36] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 522 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 31/31 constraints]
After SMT, in 39597ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41156 ms. Remains : 209/209 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 14 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 11:38:42] [INFO ] Computed 31 invariants in 16 ms
[2024-05-22 11:38:42] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:38:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 11:38:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 11:38:42] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:38:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:38:42] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:38:42] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:38:42] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:38:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
TRAPS : Iteration 1
[2024-05-22 11:38:42] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:38:42] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 563 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 11:38:42] [INFO ] Computed 49 invariants in 10 ms
[2024-05-22 11:38:42] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 11:38:42] [INFO ] Invariant cache hit.
[2024-05-22 11:38:43] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 11:38:44] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2024-05-22 11:38:44] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 11:38:44] [INFO ] Invariant cache hit.
[2024-05-22 11:38:44] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:38:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:38:57] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:38:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:38:57] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2024-05-22 11:38:59] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:38:59] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 346 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/536 variables, and 597 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/6 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61341 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (5554 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3243 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 742814 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 742814 steps, saw 371520 distinct states, run finished after 3003 ms. (steps per millisecond=247 ) properties seen :0
[2024-05-22 11:39:47] [INFO ] Invariant cache hit.
[2024-05-22 11:39:47] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/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) 43/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/108 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/174 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/233 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/238 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/532 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/536 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/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) 43/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/108 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/174 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/233 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/238 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:39:47] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:39:48] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:39:48] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/536 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/536 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/536 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/536 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 944ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 236 transition count 224
Applied a total of 116 rules in 12 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/274 places, 224/262 transitions.
RANDOM walk for 40000 steps (5050 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3376 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 749516 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 1
Probabilistic random walk after 749516 steps, saw 375000 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
// Phase 1: matrix 224 rows 236 cols
[2024-05-22 11:39:51] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 11:39:51] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/218 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/231 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/455 variables, 231/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/460 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/218 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:39:51] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-05-22 11:39:51] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:39:51] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:39:52] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:39:52] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:39:52] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:39:52] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:39:52] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:39:52] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:39:52] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/231 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 224/455 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 37/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/460 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/460 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1769ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 11:39:53] [INFO ] Invariant cache hit.
[2024-05-22 11:39:53] [INFO ] Implicit Places using invariants in 308 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 151, 156, 179, 185, 192, 227, 233]
[2024-05-22 11:39:53] [INFO ] Actually due to overlaps returned [192, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 310 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 223
Applied a total of 2 rules in 8 ms. Remains 233 /234 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 233 cols
[2024-05-22 11:39:53] [INFO ] Computed 47 invariants in 15 ms
[2024-05-22 11:39:53] [INFO ] Implicit Places using invariants in 285 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 178, 184, 224, 230]
[2024-05-22 11:39:53] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 286 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 222
Applied a total of 2 rules in 7 ms. Remains 230 /231 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 230 cols
[2024-05-22 11:39:53] [INFO ] Computed 45 invariants in 12 ms
[2024-05-22 11:39:54] [INFO ] Implicit Places using invariants in 243 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 178, 184]
[2024-05-22 11:39:54] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 244 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 222/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 221
Applied a total of 2 rules in 7 ms. Remains 227 /228 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 227 cols
[2024-05-22 11:39:54] [INFO ] Computed 43 invariants in 14 ms
[2024-05-22 11:39:54] [INFO ] Implicit Places using invariants in 226 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 147, 152, 175, 181]
[2024-05-22 11:39:54] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 237 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 220
Applied a total of 2 rules in 6 ms. Remains 224 /225 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 224 cols
[2024-05-22 11:39:54] [INFO ] Computed 41 invariants in 9 ms
[2024-05-22 11:39:54] [INFO ] Implicit Places using invariants in 208 ms returned [66, 71, 91, 97, 118, 123, 144, 149, 172, 178]
[2024-05-22 11:39:54] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 209 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 220/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 219
Applied a total of 2 rules in 9 ms. Remains 221 /222 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 221 cols
[2024-05-22 11:39:54] [INFO ] Computed 39 invariants in 11 ms
[2024-05-22 11:39:54] [INFO ] Implicit Places using invariants in 197 ms returned [88, 94, 115, 120, 141, 146, 169, 175]
[2024-05-22 11:39:54] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 198 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 218
Applied a total of 2 rules in 7 ms. Remains 218 /219 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 218 cols
[2024-05-22 11:39:54] [INFO ] Computed 37 invariants in 9 ms
[2024-05-22 11:39:54] [INFO ] Implicit Places using invariants in 174 ms returned [112, 117, 138, 143, 166, 172]
[2024-05-22 11:39:54] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 175 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 217
Applied a total of 2 rules in 8 ms. Remains 215 /216 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 215 cols
[2024-05-22 11:39:54] [INFO ] Computed 35 invariants in 15 ms
[2024-05-22 11:39:55] [INFO ] Implicit Places using invariants in 173 ms returned [135, 140, 163, 169]
[2024-05-22 11:39:55] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 174 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 216
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 212 cols
[2024-05-22 11:39:55] [INFO ] Computed 33 invariants in 12 ms
[2024-05-22 11:39:55] [INFO ] Implicit Places using invariants in 160 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 216/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 215
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-22 11:39:55] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 11:39:55] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 11:39:55] [INFO ] Invariant cache hit.
[2024-05-22 11:39:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 11:39:56] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 215/224 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3630 ms. Remains : 209/236 places, 215/224 transitions.
RANDOM walk for 40000 steps (5822 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3651 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 816646 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 816646 steps, saw 408407 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2024-05-22 11:39:59] [INFO ] Invariant cache hit.
[2024-05-22 11:39:59] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/204 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 215/419 variables, 204/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 37/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/424 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 107 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 99 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 105 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 100 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 101 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/204 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:40:00] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:40:01] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:40:01] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/419 variables, 204/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 37/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:40:01] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/424 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 1765ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 11:40:01] [INFO ] Invariant cache hit.
[2024-05-22 11:40:01] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 11:40:01] [INFO ] Invariant cache hit.
[2024-05-22 11:40:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 11:40:03] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
[2024-05-22 11:40:03] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 11:40:03] [INFO ] Invariant cache hit.
[2024-05-22 11:40:03] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9141 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 214/491 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 11:40:22] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:40:23] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 10/501 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 11:40:29] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:40:29] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:40:30] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:40:30] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:40:30] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:40:30] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:40:30] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:40:30] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:40:30] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:40:32] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:40:33] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 20/521 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 11:40:36] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 522 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 31/31 constraints]
After SMT, in 39239ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40793 ms. Remains : 209/209 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 11:40:42] [INFO ] Computed 31 invariants in 14 ms
[2024-05-22 11:40:42] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:40:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 11:40:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-22 11:40:42] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:40:42] [INFO ] After 40ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:40:42] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:40:42] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:40:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
TRAPS : Iteration 1
[2024-05-22 11:40:42] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:40:42] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 565 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13869 reset in 97 ms.
Product exploration explored 100000 steps with 13900 reset in 100 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 11:40:43] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 11:40:43] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 11:40:43] [INFO ] Invariant cache hit.
[2024-05-22 11:40:43] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 11:40:44] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-05-22 11:40:44] [INFO ] Redundant transitions in 3 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 11:40:44] [INFO ] Invariant cache hit.
[2024-05-22 11:40:44] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:40:57] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:40:57] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:40:57] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:40:58] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:41:00] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-22 11:41:00] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 346 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/536 variables, and 597 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/6 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61348 ms. Remains : 274/274 places, 262/262 transitions.
Treatment of property DoubleExponent-PT-010-LTLCardinality-02 finished in 303005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 241 place count 405 transition count 356
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 25 ms. Remains 277 /528 variables (removed 251) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-22 11:41:44] [INFO ] Computed 49 invariants in 11 ms
[2024-05-22 11:41:44] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 11:41:44] [INFO ] Invariant cache hit.
[2024-05-22 11:41:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:41:46] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2024-05-22 11:41:46] [INFO ] Redundant transitions in 0 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 11:41:46] [INFO ] Invariant cache hit.
[2024-05-22 11:41:46] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 11:41:59] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 11:42:05] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:42:05] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:42:05] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:42:05] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/541 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 349 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 260/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/541 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 607 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 0/5 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 277/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61351 ms. Remains : 277/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-03
Product exploration explored 100000 steps with 13833 reset in 147 ms.
Product exploration explored 100000 steps with 13825 reset in 107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 849 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 110 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (5571 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3292 resets) in 366 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3253 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3246 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3218 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 223503 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 223503 steps, saw 111787 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-22 11:42:50] [INFO ] Invariant cache hit.
[2024-05-22 11:42:50] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 116/238 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/241 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 254/495 variables, 241/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 40/535 variables, 31/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/537 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/541 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 344 constraints, problems are : Problem set: 0 solved, 4 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 116/238 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/241 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 254/495 variables, 241/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 11 (OVERLAPS) 40/535 variables, 31/334 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 2/336 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 1/337 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 2/339 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 11:42:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:42:51] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:42:51] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:42:51] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:42:51] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 2 ms to minimize.
[2024-05-22 11:42:51] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:42:51] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 7/346 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 11:42:51] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 1/347 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/535 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/537 variables, 2/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 2/351 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 0/351 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 4/541 variables, 3/354 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/541 variables, 1/355 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 11:42:52] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/541 variables, 1/356 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/356 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/356 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 356 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 2222ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14576 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 264/264 transitions.
Graph (complete) has 809 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 263
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 276 transition count 227
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 240 transition count 227
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 116 place count 240 transition count 227
Applied a total of 116 rules in 13 ms. Remains 240 /277 variables (removed 37) and now considering 227/264 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 240/277 places, 227/264 transitions.
RANDOM walk for 40000 steps (5106 resets) in 349 ms. (114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3348 resets) in 513 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3362 resets) in 542 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3376 resets) in 422 ms. (94 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 337665 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 3
Probabilistic random walk after 337665 steps, saw 168921 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
// Phase 1: matrix 227 rows 240 cols
[2024-05-22 11:43:10] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 11:43:10] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 152/215 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/235 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 227/462 variables, 235/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 38/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/467 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 327 constraints, problems are : Problem set: 0 solved, 3 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 240/240 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 152/215 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-22 11:43:11] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:12] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:13] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 20/235 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-22 11:43:14] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 1 ms to minimize.
[2024-05-22 11:43:15] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:16] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-22 11:43:17] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 1 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:18] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:19] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:43:20] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:43:21] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:22] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:43:23] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 1 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 1 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:43:24] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:25] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:43:26] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:43:27] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:43:28] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:29] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:43:30] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:43:31] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/235 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:43:32] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:33] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/235 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:43:34] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:43:35] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:43:36] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:43:36] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/235 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:36] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:43:36] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:43:36] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:43:36] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/235 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/235 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 227/462 variables, 235/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/462 variables, 38/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/462 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/462 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 5/467 variables, 5/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/467 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/467 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/467 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 587 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28297 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 240/240 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 257/257 constraints]
After SMT, in 28584ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8698 ms.
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 11:43:47] [INFO ] Invariant cache hit.
[2024-05-22 11:43:48] [INFO ] Implicit Places using invariants in 292 ms returned [20, 26, 46, 51, 74, 81, 102, 108, 130, 135, 136, 157, 162, 184, 190, 197, 231, 237]
[2024-05-22 11:43:48] [INFO ] Actually due to overlaps returned [197, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 292 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/240 places, 227/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 226
Applied a total of 2 rules in 7 ms. Remains 237 /238 variables (removed 1) and now considering 226/227 (removed 1) transitions.
// Phase 1: matrix 226 rows 237 cols
[2024-05-22 11:43:48] [INFO ] Computed 47 invariants in 15 ms
[2024-05-22 11:43:48] [INFO ] Implicit Places using invariants in 289 ms returned [20, 26, 46, 51, 74, 81, 102, 108, 130, 135, 156, 161, 183, 189, 228, 234]
[2024-05-22 11:43:48] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 290 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/240 places, 226/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 225
Applied a total of 2 rules in 8 ms. Remains 234 /235 variables (removed 1) and now considering 225/226 (removed 1) transitions.
// Phase 1: matrix 225 rows 234 cols
[2024-05-22 11:43:48] [INFO ] Computed 45 invariants in 10 ms
[2024-05-22 11:43:48] [INFO ] Implicit Places using invariants in 247 ms returned [20, 26, 46, 51, 74, 81, 102, 108, 130, 135, 156, 161, 183, 189]
[2024-05-22 11:43:48] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 248 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 232/240 places, 225/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 224
Applied a total of 2 rules in 9 ms. Remains 231 /232 variables (removed 1) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 231 cols
[2024-05-22 11:43:48] [INFO ] Computed 43 invariants in 8 ms
[2024-05-22 11:43:48] [INFO ] Implicit Places using invariants in 232 ms returned [43, 48, 71, 78, 99, 105, 127, 132, 153, 158, 180, 186]
[2024-05-22 11:43:48] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 233 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 229/240 places, 224/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 223
Applied a total of 2 rules in 7 ms. Remains 228 /229 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 228 cols
[2024-05-22 11:43:48] [INFO ] Computed 41 invariants in 13 ms
[2024-05-22 11:43:49] [INFO ] Implicit Places using invariants in 201 ms returned [68, 75, 96, 102, 124, 129, 150, 155, 177, 183]
[2024-05-22 11:43:49] [INFO ] Actually due to overlaps returned [75, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 201 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 226/240 places, 223/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 222
Applied a total of 2 rules in 6 ms. Remains 225 /226 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 225 cols
[2024-05-22 11:43:49] [INFO ] Computed 39 invariants in 19 ms
[2024-05-22 11:43:49] [INFO ] Implicit Places using invariants in 195 ms returned [93, 99, 121, 126, 147, 152, 174, 180]
[2024-05-22 11:43:49] [INFO ] Actually due to overlaps returned [99, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 196 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 223/240 places, 222/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 221
Applied a total of 2 rules in 7 ms. Remains 222 /223 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 222 cols
[2024-05-22 11:43:49] [INFO ] Computed 37 invariants in 12 ms
[2024-05-22 11:43:49] [INFO ] Implicit Places using invariants in 176 ms returned [118, 123, 144, 149, 171, 177]
[2024-05-22 11:43:49] [INFO ] Actually due to overlaps returned [123, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 220/240 places, 221/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 220
Applied a total of 2 rules in 7 ms. Remains 219 /220 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 219 cols
[2024-05-22 11:43:49] [INFO ] Computed 35 invariants in 7 ms
[2024-05-22 11:43:49] [INFO ] Implicit Places using invariants in 153 ms returned [141, 146, 168, 174]
[2024-05-22 11:43:49] [INFO ] Actually due to overlaps returned [146, 141]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 154 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 217/240 places, 220/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 219
Applied a total of 2 rules in 6 ms. Remains 216 /217 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 216 cols
[2024-05-22 11:43:49] [INFO ] Computed 33 invariants in 10 ms
[2024-05-22 11:43:49] [INFO ] Implicit Places using invariants in 151 ms returned [165, 171]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 214/240 places, 219/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 218
Applied a total of 2 rules in 6 ms. Remains 213 /214 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 213 cols
[2024-05-22 11:43:49] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 11:43:50] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 11:43:50] [INFO ] Invariant cache hit.
[2024-05-22 11:43:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 11:43:51] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 213/240 places, 218/227 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3439 ms. Remains : 213/240 places, 218/227 transitions.
RANDOM walk for 40000 steps (5742 resets) in 333 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3641 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3670 resets) in 467 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3629 resets) in 456 ms. (87 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 255023 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 3
Probabilistic random walk after 255023 steps, saw 127528 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-22 11:43:54] [INFO ] Invariant cache hit.
[2024-05-22 11:43:54] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/208 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 218/426 variables, 208/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/431 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/431 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 70/208 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:43:55] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:43:56] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:43:56] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:43:56] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:43:56] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 218/426 variables, 208/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 38/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:43:56] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/431 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/431 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 301 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1884 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 16/16 constraints]
After SMT, in 2103ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8497 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 213/213 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-05-22 11:44:05] [INFO ] Invariant cache hit.
[2024-05-22 11:44:05] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 11:44:05] [INFO ] Invariant cache hit.
[2024-05-22 11:44:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 11:44:06] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2024-05-22 11:44:06] [INFO ] Redundant transitions in 2 ms returned []
Running 217 sub problems to find dead transitions.
[2024-05-22 11:44:06] [INFO ] Invariant cache hit.
[2024-05-22 11:44:06] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/213 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 11:44:09] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/431 variables, 213/245 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/431 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 283 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14975 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/213 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/431 variables, 213/245 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 217/500 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 11:44:31] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:44:31] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:44:31] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:44:31] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:44:31] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:44:31] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:44:31] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:44:32] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:44:33] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 17/517 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 11:44:41] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 518 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 19/19 constraints]
After SMT, in 45075ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 45080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46597 ms. Remains : 213/213 places, 218/218 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p1)), (G (OR p1 p0)), (G (OR p1 p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 110 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 277 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 264/264 transitions.
Applied a total of 0 rules in 6 ms. Remains 277 /277 variables (removed 0) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-22 11:44:52] [INFO ] Computed 49 invariants in 11 ms
[2024-05-22 11:44:52] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 11:44:52] [INFO ] Invariant cache hit.
[2024-05-22 11:44:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:44:53] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2024-05-22 11:44:53] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 11:44:53] [INFO ] Invariant cache hit.
[2024-05-22 11:44:53] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 11:45:06] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 11:45:12] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:45:13] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:45:13] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:45:13] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/541 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 349 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 260/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/541 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 607 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 0/5 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61359 ms. Remains : 277/277 places, 264/264 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 849 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (5515 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3265 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 738107 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 738107 steps, saw 369164 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
[2024-05-22 11:45:56] [INFO ] Invariant cache hit.
[2024-05-22 11:45:56] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/34 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/128 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 109/237 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 29/266 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 233/499 variables, 234/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 16/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/535 variables, 27/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/535 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/537 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/537 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/541 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/34 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/128 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/237 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/266 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:45:57] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 233/499 variables, 234/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 16/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/499 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 36/535 variables, 27/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:45:57] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:45:57] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:45:57] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:45:57] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/537 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/537 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/537 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/541 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/541 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/541 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 982ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 264/264 transitions.
Graph (complete) has 809 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 276 transition count 262
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 275 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 274 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 44 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 80 place count 237 transition count 225
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 121 place count 237 transition count 225
Applied a total of 121 rules in 18 ms. Remains 237 /277 variables (removed 40) and now considering 225/264 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 237/277 places, 225/264 transitions.
RANDOM walk for 40000 steps (5080 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3350 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 755180 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 755180 steps, saw 377834 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
// Phase 1: matrix 225 rows 237 cols
[2024-05-22 11:46:00] [INFO ] Computed 49 invariants in 13 ms
[2024-05-22 11:46:00] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/228 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/232 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/457 variables, 232/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 38/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/462 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 237/237 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/228 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:46:01] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2024-05-22 11:46:01] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-22 11:46:01] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:46:01] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:46:01] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-22 11:46:01] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-22 11:46:01] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:46:02] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:46:03] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:46:03] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:46:03] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:46:03] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/232 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 225/457 variables, 232/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 38/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/462 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/462 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2517 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 237/237 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 2704ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-22 11:46:03] [INFO ] Invariant cache hit.
[2024-05-22 11:46:04] [INFO ] Implicit Places using invariants in 306 ms returned [20, 26, 46, 51, 74, 79, 100, 106, 128, 133, 134, 154, 159, 181, 187, 194, 228, 234]
[2024-05-22 11:46:04] [INFO ] Actually due to overlaps returned [194, 133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 315 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 224
Applied a total of 2 rules in 8 ms. Remains 234 /235 variables (removed 1) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 234 cols
[2024-05-22 11:46:04] [INFO ] Computed 47 invariants in 10 ms
[2024-05-22 11:46:04] [INFO ] Implicit Places using invariants in 291 ms returned [20, 26, 46, 51, 74, 79, 100, 106, 128, 133, 153, 158, 180, 186, 225, 231]
[2024-05-22 11:46:04] [INFO ] Actually due to overlaps returned [231, 225]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 300 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/237 places, 224/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Applied a total of 2 rules in 7 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 11:46:04] [INFO ] Computed 45 invariants in 11 ms
[2024-05-22 11:46:04] [INFO ] Implicit Places using invariants in 270 ms returned [20, 26, 46, 51, 74, 79, 100, 106, 128, 133, 153, 158, 180, 186]
[2024-05-22 11:46:04] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 271 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/237 places, 223/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 222
Applied a total of 2 rules in 7 ms. Remains 228 /229 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 228 cols
[2024-05-22 11:46:04] [INFO ] Computed 43 invariants in 9 ms
[2024-05-22 11:46:04] [INFO ] Implicit Places using invariants in 236 ms returned [43, 48, 71, 76, 97, 103, 125, 130, 150, 155, 177, 183]
[2024-05-22 11:46:04] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 238 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 226/237 places, 222/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 8 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 11:46:04] [INFO ] Computed 41 invariants in 13 ms
[2024-05-22 11:46:05] [INFO ] Implicit Places using invariants in 210 ms returned [68, 73, 94, 100, 122, 127, 147, 152, 174, 180]
[2024-05-22 11:46:05] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 211 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/237 places, 221/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 6 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 222 cols
[2024-05-22 11:46:05] [INFO ] Computed 39 invariants in 11 ms
[2024-05-22 11:46:05] [INFO ] Implicit Places using invariants in 188 ms returned [91, 97, 119, 124, 144, 149, 171, 177]
[2024-05-22 11:46:05] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 189 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/237 places, 220/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 7 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 11:46:05] [INFO ] Computed 37 invariants in 10 ms
[2024-05-22 11:46:05] [INFO ] Implicit Places using invariants in 180 ms returned [116, 121, 141, 146, 168, 174]
[2024-05-22 11:46:05] [INFO ] Actually due to overlaps returned [121, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 181 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 217/237 places, 219/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 6 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 11:46:05] [INFO ] Computed 35 invariants in 7 ms
[2024-05-22 11:46:05] [INFO ] Implicit Places using invariants in 160 ms returned [138, 143, 165, 171]
[2024-05-22 11:46:05] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 214/237 places, 218/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 6 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 11:46:05] [INFO ] Computed 33 invariants in 9 ms
[2024-05-22 11:46:05] [INFO ] Implicit Places using invariants in 154 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 155 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/237 places, 217/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 6 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 11:46:05] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 11:46:05] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 11:46:05] [INFO ] Invariant cache hit.
[2024-05-22 11:46:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 11:46:07] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3542 ms. Remains : 210/237 places, 216/225 transitions.
RANDOM walk for 40000 steps (5765 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3652 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Probably explored full state space saw : 264449 states, properties seen :0
Probabilistic random walk after 528905 steps, saw 264449 distinct states, run finished after 1947 ms. (steps per millisecond=271 ) properties seen :0
Interrupted probabilistic random walk after 814945 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :0 out of 1
Exhaustive walk after 814945 steps, saw 407563 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
[2024-05-22 11:46:12] [INFO ] Invariant cache hit.
[2024-05-22 11:46:12] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 38/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/426 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:46:12] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/205 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 216/421 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 38/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 11:46:12] [INFO ] Invariant cache hit.
[2024-05-22 11:46:12] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 11:46:12] [INFO ] Invariant cache hit.
[2024-05-22 11:46:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 11:46:14] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2024-05-22 11:46:14] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 11:46:14] [INFO ] Invariant cache hit.
[2024-05-22 11:46:14] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 279 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10121 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:46:25] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/426 variables, 210/242 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 38/280 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 215/495 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:46:34] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:46:36] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:46:37] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 11:46:42] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 499 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
After SMT, in 40250ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41763 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 12 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 11:46:54] [INFO ] Computed 31 invariants in 13 ms
[2024-05-22 11:46:54] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:46:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-22 11:46:54] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 11:46:54] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:46:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:46:54] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:46:54] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:46:54] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 231 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13873 reset in 93 ms.
Product exploration explored 100000 steps with 13848 reset in 98 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 264/264 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 277 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 276 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 6 place count 274 transition count 262
Applied a total of 6 rules in 11 ms. Remains 274 /277 variables (removed 3) and now considering 262/264 (removed 2) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 11:46:55] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 11:46:55] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 11:46:55] [INFO ] Invariant cache hit.
[2024-05-22 11:46:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:46:56] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-22 11:46:56] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 11:46:56] [INFO ] Invariant cache hit.
[2024-05-22 11:46:56] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:47:09] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:47:09] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:47:09] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:47:09] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:47:09] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:47:09] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:47:09] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:47:10] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:47:10] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:47:11] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-22 11:47:11] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:47:11] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:47:11] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:47:12] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 14/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:47:15] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:47:16] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:47:16] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:47:17] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 11:47:26] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 360 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60066ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/277 places, 262/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61239 ms. Remains : 274/277 places, 262/264 transitions.
Treatment of property DoubleExponent-PT-010-LTLCardinality-03 finished in 371798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p0)))&&F(p1))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 9 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 11:47:56] [INFO ] Computed 49 invariants in 17 ms
[2024-05-22 11:47:56] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 11:47:56] [INFO ] Invariant cache hit.
[2024-05-22 11:47:58] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 11:47:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 11:48:13] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-22 11:48:14] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 4.0)
(s11 4.0)
(s12 0.0)
(s13 4.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 2.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1074 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1074 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62031 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Product exploration explored 100000 steps with 25000 reset in 181 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1320 resets) in 255 ms. (156 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (1133 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1130 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
[2024-05-22 11:49:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/71 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 115/186 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 73/259 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 47/306 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 47/353 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 47/400 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/434 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 16/450 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/921 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 89/1010 variables, 69/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:49:00] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1010 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1010 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 8/1018 variables, 4/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1018 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 5/1023 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1023 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 30 (OVERLAPS) 1/1024 variables, 1/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 11:49:00] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1024 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1024 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1024 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/73 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/178 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 120/298 variables, 13/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 11:49:01] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/304 variables, 2/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 49/353 variables, 7/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 47/400 variables, 5/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 34/434 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/450 variables, 2/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 471/921 variables, 450/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/921 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 89/1010 variables, 69/569 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1010 variables, 1/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1010 variables, 2/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1010 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 8/1018 variables, 4/576 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1018 variables, 0/576 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/1023 variables, 3/579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1023 variables, 0/579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/1024 variables, 1/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 11:49:01] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-22 11:49:01] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-05-22 11:49:02] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-22 11:49:02] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1024 variables, 4/584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1024 variables, 0/584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1024 variables, 0/584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 584 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2254ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 244 place count 404 transition count 353
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 472 place count 290 transition count 260
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 545 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 582 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 622 place count 235 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 234 transition count 222
Applied a total of 623 rules in 37 ms. Remains 234 /527 variables (removed 293) and now considering 222/497 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 234/527 places, 222/497 transitions.
RANDOM walk for 40000 steps (5150 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 762589 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 762589 steps, saw 381543 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
// Phase 1: matrix 222 rows 234 cols
[2024-05-22 11:49:05] [INFO ] Computed 49 invariants in 7 ms
[2024-05-22 11:49:05] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 61/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:05] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/226 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:05] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:49:05] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:49:05] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:49:05] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/229 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/451 variables, 229/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 38/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/456 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/456 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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) 61/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/226 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:49:06] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:49:07] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:49:07] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:49:07] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:49:07] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2024-05-22 11:49:07] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/229 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:07] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 222/451 variables, 229/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 38/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:07] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/451 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/456 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/456 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/456 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/456 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1607 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 2452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-22 11:49:08] [INFO ] Invariant cache hit.
[2024-05-22 11:49:08] [INFO ] Implicit Places using invariants in 289 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
[2024-05-22 11:49:08] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 290 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 221
Applied a total of 2 rules in 8 ms. Remains 231 /232 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 231 cols
[2024-05-22 11:49:08] [INFO ] Computed 47 invariants in 18 ms
[2024-05-22 11:49:08] [INFO ] Implicit Places using invariants in 282 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183, 222, 228]
[2024-05-22 11:49:08] [INFO ] Actually due to overlaps returned [228, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 283 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 229/234 places, 221/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 220
Applied a total of 2 rules in 8 ms. Remains 228 /229 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 228 cols
[2024-05-22 11:49:08] [INFO ] Computed 45 invariants in 13 ms
[2024-05-22 11:49:08] [INFO ] Implicit Places using invariants in 255 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183]
[2024-05-22 11:49:08] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 256 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 226/234 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 14 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 225 cols
[2024-05-22 11:49:08] [INFO ] Computed 43 invariants in 10 ms
[2024-05-22 11:49:09] [INFO ] Implicit Places using invariants in 232 ms returned [44, 49, 70, 75, 95, 101, 122, 127, 147, 152, 174, 180]
[2024-05-22 11:49:09] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 233 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 223/234 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 7 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 222 cols
[2024-05-22 11:49:09] [INFO ] Computed 41 invariants in 11 ms
[2024-05-22 11:49:09] [INFO ] Implicit Places using invariants in 211 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 171, 177]
[2024-05-22 11:49:09] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 225 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 220/234 places, 218/222 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 5 ms. Remains 220 /220 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 220 cols
[2024-05-22 11:49:09] [INFO ] Computed 39 invariants in 8 ms
[2024-05-22 11:49:09] [INFO ] Implicit Places using invariants in 184 ms returned [90, 96, 117, 122, 142, 147, 169, 175]
[2024-05-22 11:49:09] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 196 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 218/234 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 10 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2024-05-22 11:49:09] [INFO ] Computed 37 invariants in 11 ms
[2024-05-22 11:49:09] [INFO ] Implicit Places using invariants in 175 ms returned [114, 119, 139, 144, 166, 172]
[2024-05-22 11:49:09] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 215/234 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 7 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2024-05-22 11:49:09] [INFO ] Computed 35 invariants in 13 ms
[2024-05-22 11:49:09] [INFO ] Implicit Places using invariants in 163 ms returned [136, 141, 163, 169]
[2024-05-22 11:49:09] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 164 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 212/234 places, 216/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 7 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2024-05-22 11:49:09] [INFO ] Computed 33 invariants in 10 ms
[2024-05-22 11:49:10] [INFO ] Implicit Places using invariants in 153 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 154 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 209/234 places, 215/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 11:49:10] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 11:49:10] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 11:49:10] [INFO ] Invariant cache hit.
[2024-05-22 11:49:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 11:49:11] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 208/234 places, 214/222 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3619 ms. Remains : 208/234 places, 214/222 transitions.
RANDOM walk for 40000 steps (5758 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3675 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 821731 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 1
Probabilistic random walk after 821731 steps, saw 410954 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
[2024-05-22 11:49:14] [INFO ] Invariant cache hit.
[2024-05-22 11:49:14] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 124/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:14] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/149 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:14] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:49:14] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:49:14] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:49:15] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/203 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/422 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 124/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/149 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:15] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:49:15] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:49:15] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/203 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/417 variables, 203/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:49:15] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:49:15] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/422 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/422 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1243ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 11:49:15] [INFO ] Invariant cache hit.
[2024-05-22 11:49:16] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 11:49:16] [INFO ] Invariant cache hit.
[2024-05-22 11:49:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 11:49:17] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2024-05-22 11:49:17] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 11:49:17] [INFO ] Invariant cache hit.
[2024-05-22 11:49:17] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 277 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9230 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/490 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:49:33] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:49:33] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:49:33] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:49:33] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:49:33] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:49:35] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:49:37] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:49:37] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:49:37] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:49:37] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:49:37] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:49:37] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 12/502 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:49:44] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:49:45] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:49:45] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:49:45] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:49:45] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 13/515 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 515 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 25/25 constraints]
After SMT, in 39321ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40881 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
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 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 11 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-22 11:49:56] [INFO ] Computed 31 invariants in 14 ms
[2024-05-22 11:49:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 11:49:56] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-22 11:49:56] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 11:49:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:49:56] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:49:56] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 11:49:56] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 184 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 9 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 11:49:57] [INFO ] Computed 49 invariants in 22 ms
[2024-05-22 11:49:57] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 11:49:57] [INFO ] Invariant cache hit.
[2024-05-22 11:49:59] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 11:49:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 11:50:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-22 11:50:15] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1074 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1074 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Finished structural reductions in LTL mode , in 1 iterations and 61994 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 138 steps (2 resets) in 6 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 115 ms.
Product exploration explored 100000 steps with 25000 reset in 116 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 496
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 118 place count 526 transition count 515
Deduced a syphon composed of 139 places in 3 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 140 place count 526 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 522 transition count 511
Deduced a syphon composed of 135 places in 2 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 522 transition count 511
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 228 places in 2 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 241 place count 522 transition count 531
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 242 place count 521 transition count 530
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 243 place count 521 transition count 530
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 263 place count 521 transition count 651
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 284 place count 500 transition count 609
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 305 place count 500 transition count 609
Deduced a syphon composed of 226 places in 1 ms
Applied a total of 305 rules in 119 ms. Remains 500 /527 variables (removed 27) and now considering 609/497 (removed -112) transitions.
[2024-05-22 11:51:00] [INFO ] Redundant transitions in 3 ms returned []
Running 608 sub problems to find dead transitions.
// Phase 1: matrix 609 rows 500 cols
[2024-05-22 11:51:00] [INFO ] Computed 49 invariants in 22 ms
[2024-05-22 11:51:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-22 11:51:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-22 11:51:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD357 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 2/51 constraints. Problems are: Problem set: 1 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 607 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
At refinement iteration 6 (OVERLAPS) 609/1109 variables, 500/551 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1109 variables, 20/571 constraints. Problems are: Problem set: 347 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 571 constraints, problems are : Problem set: 347 solved, 261 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 500/500 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 347 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 11/284 variables, 2/2 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 2/4 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/4 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 172/456 variables, 47/51 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/51 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 609/1065 variables, 456/507 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1065 variables, 20/527 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1065 variables, 261/788 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1065 variables, 0/788 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 44/1109 variables, 44/832 constraints. Problems are: Problem set: 347 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 832 constraints, problems are : Problem set: 347 solved, 261 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 500/500 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/608 constraints, Known Traps: 2/2 constraints]
After SMT, in 60171ms problems are : Problem set: 347 solved, 261 unsolved
Search for dead transitions found 347 dead transitions in 60181ms
Found 347 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 347 transitions
Dead transitions reduction (with SMT) removed 347 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 262/497 transitions.
Graph (complete) has 853 edges and 500 vertex of which 274 are kept as prefixes of interest. Removing 226 places using SCC suffix rule.1 ms
Discarding 226 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 274 /500 variables (removed 226) and now considering 262/262 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 274/527 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60318 ms. Remains : 274/527 places, 262/497 transitions.
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 14 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 11:52:01] [INFO ] Computed 49 invariants in 26 ms
[2024-05-22 11:52:01] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 11:52:01] [INFO ] Invariant cache hit.
[2024-05-22 11:52:02] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 11:52:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 11:52:18] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:52:18] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1074 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1074 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Finished structural reductions in LTL mode , in 1 iterations and 61848 ms. Remains : 527/527 places, 497/497 transitions.
Treatment of property DoubleExponent-PT-010-LTLCardinality-04 finished in 306453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 405 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 243 place count 404 transition count 354
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 467 place count 292 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 503 place count 274 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 273 transition count 261
Applied a total of 504 rules in 32 ms. Remains 273 /528 variables (removed 255) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-22 11:53:03] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 11:53:03] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 11:53:03] [INFO ] Invariant cache hit.
[2024-05-22 11:53:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:53:04] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2024-05-22 11:53:04] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 11:53:04] [INFO ] Invariant cache hit.
[2024-05-22 11:53:04] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 11:53:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:53:17] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:53:17] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:53:17] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:53:18] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 11:53:20] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-22 11:53:21] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:53:21] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:53:21] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:53:22] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 350 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 600 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/10 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61413 ms. Remains : 273/528 places, 261/497 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-05
Product exploration explored 100000 steps with 13931 reset in 90 ms.
Product exploration explored 100000 steps with 13927 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5550 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3263 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 737593 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 737593 steps, saw 368907 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
[2024-05-22 11:54:07] [INFO ] Invariant cache hit.
[2024-05-22 11:54:07] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/231 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/236 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/487 variables, 236/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 16/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/528 variables, 32/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/530 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/534 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/231 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/236 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:54:08] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 251/487 variables, 236/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/528 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:54:08] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:54:08] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:54:08] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:54:08] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:54:08] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:54:08] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-22 11:54:08] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/528 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/528 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/530 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/534 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/534 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:54:09] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:54:09] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:54:09] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/534 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/534 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/534 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1360ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 619 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 811 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 235 transition count 223
Applied a total of 115 rules in 14 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 235/273 places, 223/261 transitions.
RANDOM walk for 40000 steps (5132 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3304 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 741470 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 741470 steps, saw 370973 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
// Phase 1: matrix 223 rows 235 cols
[2024-05-22 11:54:12] [INFO ] Computed 49 invariants in 9 ms
[2024-05-22 11:54:12] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/209 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/230 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/453 variables, 230/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/209 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:54:13] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/230 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:54:14] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/453 variables, 230/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 37/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/458 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2063 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2251ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 172 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 11:54:15] [INFO ] Invariant cache hit.
[2024-05-22 11:54:15] [INFO ] Implicit Places using invariants in 324 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
[2024-05-22 11:54:15] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 326 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 222
Applied a total of 2 rules in 8 ms. Remains 232 /233 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 232 cols
[2024-05-22 11:54:15] [INFO ] Computed 47 invariants in 12 ms
[2024-05-22 11:54:15] [INFO ] Implicit Places using invariants in 283 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 151, 156, 178, 184, 223, 229]
[2024-05-22 11:54:15] [INFO ] Actually due to overlaps returned [229, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 284 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/235 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 221
Applied a total of 2 rules in 8 ms. Remains 229 /230 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 229 cols
[2024-05-22 11:54:15] [INFO ] Computed 45 invariants in 13 ms
[2024-05-22 11:54:16] [INFO ] Implicit Places using invariants in 254 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 151, 156, 178, 184]
[2024-05-22 11:54:16] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 254 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 227/235 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 220
Applied a total of 2 rules in 8 ms. Remains 226 /227 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 226 cols
[2024-05-22 11:54:16] [INFO ] Computed 43 invariants in 12 ms
[2024-05-22 11:54:16] [INFO ] Implicit Places using invariants in 238 ms returned [44, 49, 70, 75, 95, 101, 123, 128, 148, 153, 175, 181]
[2024-05-22 11:54:16] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 247 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 224/235 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 219
Applied a total of 2 rules in 7 ms. Remains 223 /224 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 223 cols
[2024-05-22 11:54:16] [INFO ] Computed 41 invariants in 8 ms
[2024-05-22 11:54:16] [INFO ] Implicit Places using invariants in 201 ms returned [67, 72, 92, 98, 120, 125, 145, 150, 172, 178]
[2024-05-22 11:54:16] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 206 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 221/235 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 6 ms. Remains 220 /221 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 220 cols
[2024-05-22 11:54:16] [INFO ] Computed 39 invariants in 12 ms
[2024-05-22 11:54:16] [INFO ] Implicit Places using invariants in 186 ms returned [89, 95, 117, 122, 142, 147, 169, 175]
[2024-05-22 11:54:16] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 195 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 218/235 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 7 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2024-05-22 11:54:16] [INFO ] Computed 37 invariants in 10 ms
[2024-05-22 11:54:17] [INFO ] Implicit Places using invariants in 174 ms returned [114, 119, 139, 144, 166, 172]
[2024-05-22 11:54:17] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 215/235 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 12 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2024-05-22 11:54:17] [INFO ] Computed 35 invariants in 10 ms
[2024-05-22 11:54:17] [INFO ] Implicit Places using invariants in 163 ms returned [136, 141, 163, 169]
[2024-05-22 11:54:17] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 164 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 212/235 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 7 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2024-05-22 11:54:17] [INFO ] Computed 33 invariants in 9 ms
[2024-05-22 11:54:17] [INFO ] Implicit Places using invariants in 152 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 209/235 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 7 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 11:54:17] [INFO ] Computed 31 invariants in 12 ms
[2024-05-22 11:54:17] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 11:54:17] [INFO ] Invariant cache hit.
[2024-05-22 11:54:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 11:54:18] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3354 ms. Remains : 208/235 places, 214/223 transitions.
RANDOM walk for 40000 steps (5721 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3737 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 806854 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 806854 steps, saw 403512 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
[2024-05-22 11:54:21] [INFO ] Invariant cache hit.
[2024-05-22 11:54:21] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/149 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/203 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 37/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:54:22] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/149 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/203 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:54:22] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:54:22] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:54:22] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 37/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:54:22] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/422 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 849ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 149 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 11:54:22] [INFO ] Invariant cache hit.
[2024-05-22 11:54:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 11:54:22] [INFO ] Invariant cache hit.
[2024-05-22 11:54:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 11:54:24] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
[2024-05-22 11:54:24] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 11:54:24] [INFO ] Invariant cache hit.
[2024-05-22 11:54:24] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9704 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:54:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:54:41] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-22 11:54:42] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:54:42] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:54:43] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:54:45] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:54:45] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:54:46] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:54:46] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:54:46] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:54:46] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:54:46] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:54:47] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 13/502 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:54:53] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:54:53] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:54:53] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:54:54] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:54:54] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:54:54] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:54:54] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:54:54] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:54:54] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:54:54] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 98 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:54:55] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 20/522 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:55:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 536 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 47/47 constraints]
After SMT, in 39798ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41086 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 182 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 182 transition count 188
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 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 10 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-22 11:55:03] [INFO ] Computed 31 invariants in 8 ms
[2024-05-22 11:55:03] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:55:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:55:03] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-22 11:55:04] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:55:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:55:04] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:55:04] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-22 11:55:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 1
[2024-05-22 11:55:04] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:55:04] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 322 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-22 11:55:04] [INFO ] Computed 49 invariants in 12 ms
[2024-05-22 11:55:04] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 11:55:04] [INFO ] Invariant cache hit.
[2024-05-22 11:55:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:55:05] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2024-05-22 11:55:05] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 11:55:05] [INFO ] Invariant cache hit.
[2024-05-22 11:55:05] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 11:55:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:55:19] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:55:19] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:55:19] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:55:19] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 11:55:22] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:55:22] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:55:22] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-05-22 11:55:22] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:55:23] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 350 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 600 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/10 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61358 ms. Remains : 273/273 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5540 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3283 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 731604 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 731604 steps, saw 365912 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
[2024-05-22 11:56:08] [INFO ] Invariant cache hit.
[2024-05-22 11:56:08] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/231 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/236 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/487 variables, 236/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 16/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/528 variables, 32/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/530 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/534 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/231 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/236 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:56:09] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 251/487 variables, 236/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/528 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:56:09] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:56:09] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:56:09] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:56:09] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:56:09] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-22 11:56:09] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:56:09] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/528 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/528 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/530 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/534 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/534 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:56:10] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:56:10] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:56:10] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/534 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/534 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/534 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1395ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 637 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 811 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 235 transition count 223
Applied a total of 115 rules in 12 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 235/273 places, 223/261 transitions.
RANDOM walk for 40000 steps (5039 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3384 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 741419 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 741419 steps, saw 370950 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
// Phase 1: matrix 223 rows 235 cols
[2024-05-22 11:56:14] [INFO ] Computed 49 invariants in 16 ms
[2024-05-22 11:56:14] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/209 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/230 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/453 variables, 230/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/209 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:56:14] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-22 11:56:14] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-22 11:56:14] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-22 11:56:14] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:56:14] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:56:14] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:56:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:56:14] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/230 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:56:15] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/453 variables, 230/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 37/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/458 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2283ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 169 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 11:56:16] [INFO ] Invariant cache hit.
[2024-05-22 11:56:16] [INFO ] Implicit Places using invariants in 310 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
[2024-05-22 11:56:16] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 311 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 222
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 232 cols
[2024-05-22 11:56:16] [INFO ] Computed 47 invariants in 13 ms
[2024-05-22 11:56:17] [INFO ] Implicit Places using invariants in 277 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 151, 156, 178, 184, 223, 229]
[2024-05-22 11:56:17] [INFO ] Actually due to overlaps returned [229, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 278 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/235 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 221
Applied a total of 2 rules in 7 ms. Remains 229 /230 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 229 cols
[2024-05-22 11:56:17] [INFO ] Computed 45 invariants in 10 ms
[2024-05-22 11:56:17] [INFO ] Implicit Places using invariants in 253 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 151, 156, 178, 184]
[2024-05-22 11:56:17] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 254 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 227/235 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 220
Applied a total of 2 rules in 8 ms. Remains 226 /227 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 226 cols
[2024-05-22 11:56:17] [INFO ] Computed 43 invariants in 10 ms
[2024-05-22 11:56:17] [INFO ] Implicit Places using invariants in 230 ms returned [44, 49, 70, 75, 95, 101, 123, 128, 148, 153, 175, 181]
[2024-05-22 11:56:17] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 231 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 224/235 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 219
Applied a total of 2 rules in 7 ms. Remains 223 /224 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 223 cols
[2024-05-22 11:56:17] [INFO ] Computed 41 invariants in 8 ms
[2024-05-22 11:56:17] [INFO ] Implicit Places using invariants in 205 ms returned [67, 72, 92, 98, 120, 125, 145, 150, 172, 178]
[2024-05-22 11:56:17] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 205 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 221/235 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 7 ms. Remains 220 /221 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 220 cols
[2024-05-22 11:56:17] [INFO ] Computed 39 invariants in 14 ms
[2024-05-22 11:56:17] [INFO ] Implicit Places using invariants in 182 ms returned [89, 95, 117, 122, 142, 147, 169, 175]
[2024-05-22 11:56:17] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 183 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 218/235 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 7 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2024-05-22 11:56:17] [INFO ] Computed 37 invariants in 12 ms
[2024-05-22 11:56:18] [INFO ] Implicit Places using invariants in 194 ms returned [114, 119, 139, 144, 166, 172]
[2024-05-22 11:56:18] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 195 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 215/235 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 6 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2024-05-22 11:56:18] [INFO ] Computed 35 invariants in 9 ms
[2024-05-22 11:56:18] [INFO ] Implicit Places using invariants in 162 ms returned [136, 141, 163, 169]
[2024-05-22 11:56:18] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 163 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 212/235 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 6 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2024-05-22 11:56:18] [INFO ] Computed 33 invariants in 11 ms
[2024-05-22 11:56:18] [INFO ] Implicit Places using invariants in 152 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 153 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 209/235 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 11:56:18] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 11:56:18] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 11:56:18] [INFO ] Invariant cache hit.
[2024-05-22 11:56:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 11:56:19] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3310 ms. Remains : 208/235 places, 214/223 transitions.
RANDOM walk for 40000 steps (5688 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3630 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 796813 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 796813 steps, saw 398488 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2024-05-22 11:56:22] [INFO ] Invariant cache hit.
[2024-05-22 11:56:22] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/149 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/203 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 37/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:56:23] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/149 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/203 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:56:23] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:56:23] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:56:23] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 37/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:56:23] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/422 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 838ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 11:56:23] [INFO ] Invariant cache hit.
[2024-05-22 11:56:23] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 11:56:23] [INFO ] Invariant cache hit.
[2024-05-22 11:56:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 11:56:25] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
[2024-05-22 11:56:25] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 11:56:25] [INFO ] Invariant cache hit.
[2024-05-22 11:56:25] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9514 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:56:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 11:56:42] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:56:43] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:56:43] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:56:43] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:56:46] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:56:46] [INFO ] Deduced a trap composed of 90 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:56:46] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:56:46] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:56:47] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:56:47] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:56:47] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:56:47] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 13/502 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:56:54] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:56:54] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:56:54] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 96 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:56:55] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:56:56] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:56:56] [INFO ] Deduced a trap composed of 98 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:56:56] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:56:56] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:56:56] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:56:56] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 20/522 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:56:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:57:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-22 11:57:00] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:57:00] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:57:00] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:57:00] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:57:00] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:57:00] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:57:01] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:57:01] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:57:01] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:57:01] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:57:01] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2024-05-22 11:57:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 536 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 47/47 constraints]
After SMT, in 39605ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39609ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40872 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 182 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 11 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-22 11:57:04] [INFO ] Computed 31 invariants in 7 ms
[2024-05-22 11:57:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:57:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:57:04] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-22 11:57:04] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:57:04] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:57:04] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-05-22 11:57:04] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:57:04] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 324 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13737 reset in 96 ms.
Product exploration explored 100000 steps with 14001 reset in 104 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-22 11:57:05] [INFO ] Computed 49 invariants in 13 ms
[2024-05-22 11:57:05] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 11:57:05] [INFO ] Invariant cache hit.
[2024-05-22 11:57:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:57:06] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
[2024-05-22 11:57:06] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 11:57:06] [INFO ] Invariant cache hit.
[2024-05-22 11:57:06] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 11:57:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:57:19] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:57:19] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:57:20] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:57:20] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 11:57:23] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:57:23] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:57:23] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:57:23] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:57:24] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 350 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 600 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/10 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61358 ms. Remains : 273/273 places, 261/261 transitions.
Treatment of property DoubleExponent-PT-010-LTLCardinality-05 finished in 303725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 9 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 11:58:06] [INFO ] Computed 49 invariants in 22 ms
[2024-05-22 11:58:06] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 11:58:06] [INFO ] Invariant cache hit.
[2024-05-22 11:58:08] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 11:58:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 11:58:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:58:24] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1074 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1074 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61983 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-07 finished in 62098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||F(p2)))))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 497 place count 277 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 498 place count 276 transition count 264
Applied a total of 498 rules in 28 ms. Remains 276 /528 variables (removed 252) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 276 cols
[2024-05-22 11:59:08] [INFO ] Computed 49 invariants in 9 ms
[2024-05-22 11:59:09] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 11:59:09] [INFO ] Invariant cache hit.
[2024-05-22 11:59:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 11:59:10] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2024-05-22 11:59:10] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 11:59:10] [INFO ] Invariant cache hit.
[2024-05-22 11:59:10] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/539 variables, 275/324 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 18/342 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/540 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 11:59:24] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:59:24] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:59:24] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:59:26] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:59:26] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-05-22 11:59:26] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:59:28] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:59:28] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/540 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 11:59:37] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:59:37] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 4 ms to minimize.
[2024-05-22 11:59:37] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 354 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 276/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/539 variables, 275/324 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 18/342 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 260/602 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/540 variables, and 602 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 275/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/263 constraints, Known Traps: 0/11 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 276/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61247 ms. Remains : 276/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-09
Product exploration explored 100000 steps with 13880 reset in 132 ms.
Product exploration explored 100000 steps with 13917 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5525 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3233 resets) in 191 ms. (208 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40001 steps (3221 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-22 12:00:11] [INFO ] Invariant cache hit.
[2024-05-22 12:00:11] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/113 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 56/169 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/206 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/240 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 254/494 variables, 240/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 534/540 variables, and 333 constraints, problems are : Problem set: 1 solved, 0 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, Generalized P Invariants (flows): 45/47 constraints, State Equation: 271/276 constraints, ReadFeed: 16/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-010-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLCardinality-09 finished in 62335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1&&F(!p1))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 241 place count 405 transition count 356
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 28 ms. Remains 277 /528 variables (removed 251) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-22 12:00:11] [INFO ] Computed 49 invariants in 12 ms
[2024-05-22 12:00:11] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 12:00:11] [INFO ] Invariant cache hit.
[2024-05-22 12:00:11] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 12:00:12] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-22 12:00:12] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 12:00:12] [INFO ] Invariant cache hit.
[2024-05-22 12:00:12] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 12:00:27] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:00:28] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:00:28] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:00:28] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:00:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:00:28] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:00:28] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-22 12:00:28] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:00:30] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/541 variables, 9/353 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 353 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 260/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/541 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 3/607 constraints. Problems are: Problem set: 0 solved, 263 unsolved
SMT process timed out in 60056ms, After SMT, problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in SI_LTL mode, iteration 1 : 277/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61311 ms. Remains : 277/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, true, (NOT p0), p1]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-10
Stuttering criterion allowed to conclude after 44 steps with 6 reset in 1 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-10 finished in 61442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 8 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 12:01:12] [INFO ] Computed 49 invariants in 25 ms
[2024-05-22 12:01:12] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 12:01:12] [INFO ] Invariant cache hit.
[2024-05-22 12:01:14] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 12:01:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 12:01:29] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-22 12:01:30] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1074 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1074 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61718 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-11
Product exploration explored 100000 steps with 3290 reset in 95 ms.
Product exploration explored 100000 steps with 3315 reset in 100 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
RANDOM walk for 40000 steps (1316 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7406 steps, run visited all 1 properties in 43 ms. (steps per millisecond=172 )
Probabilistic random walk after 7406 steps, saw 3729 distinct states, run finished after 49 ms. (steps per millisecond=151 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Support contains 2 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 409 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 237 place count 407 transition count 377
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 237 place count 407 transition count 357
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 277 place count 387 transition count 357
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 463 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 499 place count 276 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 275 transition count 263
Applied a total of 500 rules in 27 ms. Remains 275 /527 variables (removed 252) and now considering 263/497 (removed 234) transitions.
// Phase 1: matrix 263 rows 275 cols
[2024-05-22 12:02:15] [INFO ] Computed 49 invariants in 9 ms
[2024-05-22 12:02:15] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 12:02:15] [INFO ] Invariant cache hit.
[2024-05-22 12:02:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 12:02:16] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2024-05-22 12:02:16] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-22 12:02:16] [INFO ] Invariant cache hit.
[2024-05-22 12:02:16] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/537 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/538 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-22 12:02:28] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:02:28] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:02:28] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:02:29] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:02:29] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-22 12:02:29] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:02:29] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 7/349 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-22 12:02:36] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-22 12:02:37] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:02:37] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 352 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 275/275 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/537 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 259/600 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/538 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 604 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 275/275 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/10 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in SI_LTL mode, iteration 1 : 275/527 places, 263/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61175 ms. Remains : 275/527 places, 263/497 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 855 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
RANDOM walk for 40000 steps (5445 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3242 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3522 steps, run visited all 1 properties in 17 ms. (steps per millisecond=207 )
Probabilistic random walk after 3522 steps, saw 1787 distinct states, run finished after 17 ms. (steps per millisecond=207 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13716 reset in 91 ms.
Product exploration explored 100000 steps with 13554 reset in 98 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 263/263 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 0 with 1 rules applied. Total rules applied 1 place count 275 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 274 transition count 262
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 2 with 2 rules applied. Total rules applied 4 place count 273 transition count 261
Applied a total of 4 rules in 7 ms. Remains 273 /275 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-22 12:03:16] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 12:03:16] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 12:03:16] [INFO ] Invariant cache hit.
[2024-05-22 12:03:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 12:03:18] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-22 12:03:18] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 12:03:18] [INFO ] Invariant cache hit.
[2024-05-22 12:03:18] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:03:31] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:03:31] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:03:32] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:03:32] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-22 12:03:33] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-05-22 12:03:35] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:03:35] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/534 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:03:36] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:03:44] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-22 12:03:44] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 350 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 600 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/10 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/275 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61408 ms. Remains : 273/275 places, 261/263 transitions.
Treatment of property DoubleExponent-PT-010-LTLCardinality-11 finished in 185629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 525 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 408 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 28 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 12:04:18] [INFO ] Computed 49 invariants in 17 ms
[2024-05-22 12:04:18] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 12:04:18] [INFO ] Invariant cache hit.
[2024-05-22 12:04:18] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 12:04:19] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2024-05-22 12:04:19] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 12:04:19] [INFO ] Invariant cache hit.
[2024-05-22 12:04:19] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 12:04:32] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 12:04:32] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:04:32] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:04:33] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:04:33] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:04:33] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-22 12:04:33] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-22 12:04:33] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-22 12:04:33] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:04:34] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 12:04:34] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:04:34] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-22 12:04:34] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-22 12:04:35] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 12:04:40] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 355 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60067ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61496 ms. Remains : 274/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-12
Product exploration explored 100000 steps with 13788 reset in 92 ms.
Product exploration explored 100000 steps with 13873 reset in 102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5540 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3255 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 743724 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 743724 steps, saw 371974 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
[2024-05-22 12:05:23] [INFO ] Invariant cache hit.
[2024-05-22 12:05:23] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/134 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/204 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/238 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/532 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/536 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/134 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/204 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/238 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/530 variables, 31/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/536 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 227 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 236 transition count 224
Applied a total of 115 rules in 11 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/274 places, 224/262 transitions.
RANDOM walk for 40000 steps (5057 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3346 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 750991 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 1
Probabilistic random walk after 750991 steps, saw 375745 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
// Phase 1: matrix 224 rows 236 cols
[2024-05-22 12:05:27] [INFO ] Computed 49 invariants in 17 ms
[2024-05-22 12:05:27] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/227 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/231 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/455 variables, 231/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/460 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/227 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:05:27] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-22 12:05:27] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2024-05-22 12:05:27] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-22 12:05:27] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-05-22 12:05:27] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-22 12:05:27] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 12:05:27] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:05:27] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/231 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:05:28] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 224/455 variables, 231/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 37/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/460 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2167ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 12:05:29] [INFO ] Invariant cache hit.
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants in 217 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
[2024-05-22 12:05:29] [INFO ] Actually due to overlaps returned [51, 193, 46, 132]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 218 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 231 transition count 223
Applied a total of 4 rules in 9 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 12:05:29] [INFO ] Computed 45 invariants in 16 ms
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants in 211 ms returned [20, 26, 71, 76, 97, 103, 125, 130, 150, 155, 177, 183, 222, 228]
[2024-05-22 12:05:29] [INFO ] Actually due to overlaps returned [76, 228, 71, 222]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 212 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 227/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 225 transition count 221
Applied a total of 4 rules in 7 ms. Remains 225 /227 variables (removed 2) and now considering 221/223 (removed 2) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 12:05:29] [INFO ] Computed 41 invariants in 14 ms
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants in 185 ms returned [20, 26, 94, 100, 122, 127, 147, 152, 174, 180]
[2024-05-22 12:05:29] [INFO ] Actually due to overlaps returned [100, 20, 94, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 186 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 221/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 219 transition count 219
Applied a total of 4 rules in 6 ms. Remains 219 /221 variables (removed 2) and now considering 219/221 (removed 2) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 12:05:29] [INFO ] Computed 37 invariants in 9 ms
[2024-05-22 12:05:30] [INFO ] Implicit Places using invariants in 160 ms returned [116, 121, 141, 146, 168, 174]
[2024-05-22 12:05:30] [INFO ] Actually due to overlaps returned [121, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 217/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 6 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 12:05:30] [INFO ] Computed 35 invariants in 9 ms
[2024-05-22 12:05:30] [INFO ] Implicit Places using invariants in 148 ms returned [138, 143, 165, 171]
[2024-05-22 12:05:30] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 214/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 5 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 12:05:30] [INFO ] Computed 33 invariants in 8 ms
[2024-05-22 12:05:30] [INFO ] Implicit Places using invariants in 140 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 211/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 5 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 12:05:30] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 12:05:30] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 12:05:30] [INFO ] Invariant cache hit.
[2024-05-22 12:05:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 12:05:31] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 210/236 places, 216/224 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 2233 ms. Remains : 210/236 places, 216/224 transitions.
RANDOM walk for 40000 steps (5746 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3673 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Probably explored full state space saw : 264445 states, properties seen :0
Probabilistic random walk after 528899 steps, saw 264445 distinct states, run finished after 1931 ms. (steps per millisecond=273 ) properties seen :0
Interrupted probabilistic random walk after 858041 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 1
Exhaustive walk after 858041 steps, saw 429114 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
[2024-05-22 12:05:36] [INFO ] Invariant cache hit.
[2024-05-22 12:05:36] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/152 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 37/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/152 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:05:36] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:05:36] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/205 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:05:36] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-22 12:05:36] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/421 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/426 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 823ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 12:05:37] [INFO ] Invariant cache hit.
[2024-05-22 12:05:37] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 12:05:37] [INFO ] Invariant cache hit.
[2024-05-22 12:05:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 12:05:38] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2024-05-22 12:05:38] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 12:05:38] [INFO ] Invariant cache hit.
[2024-05-22 12:05:38] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9298 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 12:05:54] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 494 constraints, problems are : Problem set: 0 solved, 215 unsolved in 29710 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 1/1 constraints]
After SMT, in 39099ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40172 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 193 transition count 199
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 184 transition count 190
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 184 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 183 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 187
Applied a total of 58 rules in 14 ms. Remains 181 /210 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 181 cols
[2024-05-22 12:06:17] [INFO ] Computed 31 invariants in 8 ms
[2024-05-22 12:06:17] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 12:06:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 12:06:17] [INFO ] [Nat]Absence check using 8 positive and 23 generalized place invariants in 5 ms returned sat
[2024-05-22 12:06:17] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 12:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 12:06:17] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 12:06:17] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
TRAPS : Iteration 1
[2024-05-22 12:06:17] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 12:06:17] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 363 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 12:06:17] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 12:06:18] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 12:06:18] [INFO ] Invariant cache hit.
[2024-05-22 12:06:18] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 12:06:19] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2024-05-22 12:06:19] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 12:06:19] [INFO ] Invariant cache hit.
[2024-05-22 12:06:19] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 12:06:32] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:06:32] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:06:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:06:32] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:06:32] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:06:32] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2024-05-22 12:06:33] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:06:33] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-22 12:06:33] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:06:33] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-22 12:06:33] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:06:33] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-22 12:06:33] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-22 12:06:34] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 12:06:39] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 355 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60058ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61451 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5593 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3248 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 742919 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 742919 steps, saw 371567 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
[2024-05-22 12:07:22] [INFO ] Invariant cache hit.
[2024-05-22 12:07:22] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/134 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/204 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/238 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/532 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/536 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/134 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/204 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/238 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/530 variables, 31/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/536 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 237 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 236 transition count 224
Applied a total of 115 rules in 12 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/274 places, 224/262 transitions.
RANDOM walk for 40000 steps (5137 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3367 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 762325 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 762325 steps, saw 381406 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
// Phase 1: matrix 224 rows 236 cols
[2024-05-22 12:07:26] [INFO ] Computed 49 invariants in 16 ms
[2024-05-22 12:07:26] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/227 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/231 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/455 variables, 231/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/460 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/227 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:07:26] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-22 12:07:26] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-22 12:07:26] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 1 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 1 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-22 12:07:27] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-22 12:07:28] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:07:28] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2024-05-22 12:07:28] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-22 12:07:28] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/231 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:07:28] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 224/455 variables, 231/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 37/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/460 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2221ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 12:07:28] [INFO ] Invariant cache hit.
[2024-05-22 12:07:28] [INFO ] Implicit Places using invariants in 224 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
[2024-05-22 12:07:28] [INFO ] Actually due to overlaps returned [51, 193, 46, 132]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 224 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 231 transition count 223
Applied a total of 4 rules in 9 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 12:07:28] [INFO ] Computed 45 invariants in 14 ms
[2024-05-22 12:07:29] [INFO ] Implicit Places using invariants in 215 ms returned [20, 26, 71, 76, 97, 103, 125, 130, 150, 155, 177, 183, 222, 228]
[2024-05-22 12:07:29] [INFO ] Actually due to overlaps returned [76, 228, 71, 222]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 216 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 227/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 225 transition count 221
Applied a total of 4 rules in 6 ms. Remains 225 /227 variables (removed 2) and now considering 221/223 (removed 2) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 12:07:29] [INFO ] Computed 41 invariants in 12 ms
[2024-05-22 12:07:29] [INFO ] Implicit Places using invariants in 172 ms returned [20, 26, 94, 100, 122, 127, 147, 152, 174, 180]
[2024-05-22 12:07:29] [INFO ] Actually due to overlaps returned [100, 20, 94, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 172 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 221/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 219 transition count 219
Applied a total of 4 rules in 6 ms. Remains 219 /221 variables (removed 2) and now considering 219/221 (removed 2) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 12:07:29] [INFO ] Computed 37 invariants in 11 ms
[2024-05-22 12:07:29] [INFO ] Implicit Places using invariants in 165 ms returned [116, 121, 141, 146, 168, 174]
[2024-05-22 12:07:29] [INFO ] Actually due to overlaps returned [121, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 166 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 217/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 6 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 12:07:29] [INFO ] Computed 35 invariants in 10 ms
[2024-05-22 12:07:29] [INFO ] Implicit Places using invariants in 153 ms returned [138, 143, 165, 171]
[2024-05-22 12:07:29] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 153 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 214/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 6 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 12:07:29] [INFO ] Computed 33 invariants in 9 ms
[2024-05-22 12:07:29] [INFO ] Implicit Places using invariants in 145 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 211/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 6 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 12:07:29] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 12:07:29] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 12:07:29] [INFO ] Invariant cache hit.
[2024-05-22 12:07:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 12:07:30] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 210/236 places, 216/224 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 2243 ms. Remains : 210/236 places, 216/224 transitions.
RANDOM walk for 40000 steps (5666 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3591 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Probably explored full state space saw : 264445 states, properties seen :0
Probabilistic random walk after 528899 steps, saw 264445 distinct states, run finished after 1997 ms. (steps per millisecond=264 ) properties seen :0
Interrupted probabilistic random walk after 823452 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 1
Exhaustive walk after 823452 steps, saw 411821 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-05-22 12:07:35] [INFO ] Invariant cache hit.
[2024-05-22 12:07:35] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/152 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 37/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/152 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:07:36] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:07:36] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/205 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:07:36] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:07:36] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/421 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/426 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 801ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 12:07:36] [INFO ] Invariant cache hit.
[2024-05-22 12:07:36] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 12:07:36] [INFO ] Invariant cache hit.
[2024-05-22 12:07:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 12:07:37] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2024-05-22 12:07:37] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 12:07:37] [INFO ] Invariant cache hit.
[2024-05-22 12:07:37] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9853 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 12:07:54] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 494 constraints, problems are : Problem set: 0 solved, 215 unsolved in 29168 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 1/1 constraints]
After SMT, in 39081ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39084ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40219 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 193 transition count 199
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 184 transition count 190
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 184 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 183 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 187
Applied a total of 58 rules in 9 ms. Remains 181 /210 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 181 cols
[2024-05-22 12:08:17] [INFO ] Computed 31 invariants in 7 ms
[2024-05-22 12:08:17] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 12:08:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 12:08:17] [INFO ] [Nat]Absence check using 8 positive and 23 generalized place invariants in 5 ms returned sat
[2024-05-22 12:08:17] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 12:08:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 12:08:17] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 12:08:17] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-22 12:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
TRAPS : Iteration 1
[2024-05-22 12:08:17] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 12:08:17] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 343 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13832 reset in 97 ms.
Product exploration explored 100000 steps with 13941 reset in 97 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 3 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 12:08:17] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 12:08:17] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 12:08:17] [INFO ] Invariant cache hit.
[2024-05-22 12:08:18] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 12:08:19] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
[2024-05-22 12:08:19] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 12:08:19] [INFO ] Invariant cache hit.
[2024-05-22 12:08:19] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 12:08:31] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:08:31] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:08:32] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:08:32] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:08:32] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:08:32] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:08:32] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2024-05-22 12:08:32] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:08:33] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-22 12:08:33] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 12:08:33] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-22 12:08:33] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-22 12:08:33] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-22 12:08:34] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 12:08:39] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 355 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60063ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61432 ms. Remains : 274/274 places, 262/262 transitions.
Treatment of property DoubleExponent-PT-010-LTLCardinality-12 finished in 300964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 409 transition count 376
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 497 place count 277 transition count 265
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 277 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 500 place count 276 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 501 place count 276 transition count 264
Applied a total of 501 rules in 32 ms. Remains 276 /528 variables (removed 252) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 276 cols
[2024-05-22 12:09:19] [INFO ] Computed 49 invariants in 11 ms
[2024-05-22 12:09:19] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 12:09:19] [INFO ] Invariant cache hit.
[2024-05-22 12:09:19] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 12:09:20] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2024-05-22 12:09:20] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 12:09:20] [INFO ] Invariant cache hit.
[2024-05-22 12:09:20] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 12:09:30] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:09:30] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:09:31] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:09:32] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-22 12:09:32] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:09:32] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 6/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/540 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 349 constraints, problems are : Problem set: 0 solved, 263 unsolved in 27932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 276/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 264/540 variables, 276/331 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 18/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 263/612 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 12:09:58] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:09:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 614 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 276/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
After SMT, in 57987ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 57991ms
Starting structural reductions in SI_LTL mode, iteration 1 : 276/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59285 ms. Remains : 276/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-13
Stuttering criterion allowed to conclude after 26 steps with 2 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-13 finished in 59366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p0)))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 527 transition count 375
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 406 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 242 place count 406 transition count 355
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 282 place count 386 transition count 355
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 468 place count 293 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 504 place count 275 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 505 place count 274 transition count 261
Applied a total of 505 rules in 25 ms. Remains 274 /528 variables (removed 254) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-22 12:10:18] [INFO ] Computed 50 invariants in 12 ms
[2024-05-22 12:10:18] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 12:10:18] [INFO ] Invariant cache hit.
[2024-05-22 12:10:18] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 12:10:19] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2024-05-22 12:10:19] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 12:10:19] [INFO ] Invariant cache hit.
[2024-05-22 12:10:19] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/274 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:10:24] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-22 12:10:24] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 12:10:24] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-22 12:10:25] [INFO ] Deduced a trap composed of 139 places in 75 ms of which 2 ms to minimize.
[2024-05-22 12:10:25] [INFO ] Deduced a trap composed of 104 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/535 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 18/347 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:10:31] [INFO ] Deduced a trap composed of 108 places in 74 ms of which 1 ms to minimize.
[2024-05-22 12:10:31] [INFO ] Deduced a trap composed of 122 places in 72 ms of which 2 ms to minimize.
[2024-05-22 12:10:31] [INFO ] Deduced a trap composed of 123 places in 80 ms of which 1 ms to minimize.
[2024-05-22 12:10:32] [INFO ] Deduced a trap composed of 114 places in 88 ms of which 2 ms to minimize.
[2024-05-22 12:10:32] [INFO ] Deduced a trap composed of 118 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:10:32] [INFO ] Deduced a trap composed of 110 places in 88 ms of which 2 ms to minimize.
[2024-05-22 12:10:32] [INFO ] Deduced a trap composed of 115 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:10:33] [INFO ] Deduced a trap composed of 124 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:10:33] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:10:33] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:10:33] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-05-22 12:10:34] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-22 12:10:34] [INFO ] Deduced a trap composed of 130 places in 68 ms of which 1 ms to minimize.
[2024-05-22 12:10:34] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:10:35] [INFO ] Deduced a trap composed of 120 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 15/362 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:10:36] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:10:38] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-22 12:10:38] [INFO ] Deduced a trap composed of 125 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:10:38] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:10:38] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 2 ms to minimize.
[2024-05-22 12:10:38] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:10:43] [INFO ] Deduced a trap composed of 127 places in 78 ms of which 2 ms to minimize.
[2024-05-22 12:10:43] [INFO ] Deduced a trap composed of 131 places in 74 ms of which 1 ms to minimize.
[2024-05-22 12:10:43] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:10:44] [INFO ] Deduced a trap composed of 121 places in 83 ms of which 1 ms to minimize.
[2024-05-22 12:10:44] [INFO ] Deduced a trap composed of 113 places in 68 ms of which 1 ms to minimize.
[2024-05-22 12:10:44] [INFO ] Deduced a trap composed of 126 places in 80 ms of which 1 ms to minimize.
[2024-05-22 12:10:44] [INFO ] Deduced a trap composed of 130 places in 71 ms of which 1 ms to minimize.
[2024-05-22 12:10:45] [INFO ] Deduced a trap composed of 133 places in 72 ms of which 1 ms to minimize.
[2024-05-22 12:10:45] [INFO ] Deduced a trap composed of 132 places in 70 ms of which 1 ms to minimize.
[2024-05-22 12:10:45] [INFO ] Deduced a trap composed of 137 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:10:45] [INFO ] Deduced a trap composed of 138 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:10:45] [INFO ] Deduced a trap composed of 132 places in 72 ms of which 2 ms to minimize.
[2024-05-22 12:10:46] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:10:46] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 1 ms to minimize.
[2024-05-22 12:10:47] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:10:48] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-22 12:10:49] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-22 12:10:49] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 386 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/274 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/535 variables, 274/368 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 18/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 260/646 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:11:02] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-22 12:11:02] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:11:02] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:11:03] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 12:11:04] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:11:04] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:11:05] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-22 12:11:05] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:11:05] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:11:05] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 12:11:05] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-22 12:11:05] [INFO ] Deduced a trap composed of 112 places in 88 ms of which 1 ms to minimize.
[2024-05-22 12:11:05] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2024-05-22 12:11:06] [INFO ] Deduced a trap composed of 118 places in 80 ms of which 2 ms to minimize.
[2024-05-22 12:11:06] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:11:06] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:11:06] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 2 ms to minimize.
[2024-05-22 12:11:06] [INFO ] Deduced a trap composed of 121 places in 78 ms of which 2 ms to minimize.
[2024-05-22 12:11:06] [INFO ] Deduced a trap composed of 99 places in 74 ms of which 1 ms to minimize.
[2024-05-22 12:11:06] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 20/666 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:11:12] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:11:12] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 0 ms to minimize.
[2024-05-22 12:11:16] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:11:16] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 4/670 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 670 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 68/68 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61340 ms. Remains : 274/528 places, 261/497 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-14
Product exploration explored 100000 steps with 13806 reset in 90 ms.
Product exploration explored 100000 steps with 13820 reset in 99 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 857 edges and 274 vertex of which 271 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5564 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3312 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 737801 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 737801 steps, saw 369009 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
[2024-05-22 12:11:23] [INFO ] Invariant cache hit.
[2024-05-22 12:11:23] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/270 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/531 variables, 270/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 18/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/535 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/270 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:11:23] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-22 12:11:23] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-22 12:11:23] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-22 12:11:24] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:11:24] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 261/531 variables, 270/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/535 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/535 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3479 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 261/261 transitions.
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 274 transition count 223
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 76 place count 236 transition count 223
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 114 place count 236 transition count 223
Applied a total of 114 rules in 11 ms. Remains 236 /274 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/274 places, 223/261 transitions.
RANDOM walk for 40000 steps (5063 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3287 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 754698 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 754698 steps, saw 377595 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
// Phase 1: matrix 223 rows 236 cols
[2024-05-22 12:11:30] [INFO ] Computed 50 invariants in 13 ms
[2024-05-22 12:11:30] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/230 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/232 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/455 variables, 232/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 38/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/459 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/459 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 103/230 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:11:31] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/455 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 38/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/459 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/459 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1064ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2740 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 12:11:34] [INFO ] Invariant cache hit.
[2024-05-22 12:11:34] [INFO ] Implicit Places using invariants in 290 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 227, 233]
[2024-05-22 12:11:34] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 291 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 222
Applied a total of 2 rules in 8 ms. Remains 233 /234 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 233 cols
[2024-05-22 12:11:35] [INFO ] Computed 48 invariants in 13 ms
[2024-05-22 12:11:35] [INFO ] Implicit Places using invariants in 270 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183, 224, 230]
[2024-05-22 12:11:35] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 270 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 221
Applied a total of 2 rules in 6 ms. Remains 230 /231 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 230 cols
[2024-05-22 12:11:35] [INFO ] Computed 46 invariants in 11 ms
[2024-05-22 12:11:35] [INFO ] Implicit Places using invariants in 236 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183]
[2024-05-22 12:11:35] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 237 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 220
Applied a total of 2 rules in 7 ms. Remains 227 /228 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 227 cols
[2024-05-22 12:11:35] [INFO ] Computed 44 invariants in 9 ms
[2024-05-22 12:11:35] [INFO ] Implicit Places using invariants in 211 ms returned [43, 48, 70, 75, 95, 101, 122, 127, 147, 152, 174, 180]
[2024-05-22 12:11:35] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 227 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 219
Applied a total of 2 rules in 6 ms. Remains 224 /225 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 224 cols
[2024-05-22 12:11:35] [INFO ] Computed 42 invariants in 7 ms
[2024-05-22 12:11:35] [INFO ] Implicit Places using invariants in 196 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 171, 177]
[2024-05-22 12:11:35] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 197 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Applied a total of 2 rules in 7 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 221 cols
[2024-05-22 12:11:35] [INFO ] Computed 40 invariants in 8 ms
[2024-05-22 12:11:36] [INFO ] Implicit Places using invariants in 186 ms returned [89, 95, 116, 121, 141, 146, 168, 174]
[2024-05-22 12:11:36] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 187 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 7 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 218 cols
[2024-05-22 12:11:36] [INFO ] Computed 38 invariants in 9 ms
[2024-05-22 12:11:36] [INFO ] Implicit Places using invariants in 176 ms returned [113, 118, 138, 143, 165, 171]
[2024-05-22 12:11:36] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 177 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 6 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 215 cols
[2024-05-22 12:11:36] [INFO ] Computed 36 invariants in 10 ms
[2024-05-22 12:11:36] [INFO ] Implicit Places using invariants in 153 ms returned [135, 140, 162, 168]
[2024-05-22 12:11:36] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 154 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 5 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 212 cols
[2024-05-22 12:11:36] [INFO ] Computed 34 invariants in 9 ms
[2024-05-22 12:11:36] [INFO ] Implicit Places using invariants in 143 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 158 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 209 cols
[2024-05-22 12:11:36] [INFO ] Computed 32 invariants in 8 ms
[2024-05-22 12:11:36] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 12:11:36] [INFO ] Invariant cache hit.
[2024-05-22 12:11:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:11:38] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3524 ms. Remains : 209/236 places, 214/223 transitions.
RANDOM walk for 40000 steps (5743 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3581 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 818119 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 818119 steps, saw 409141 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2024-05-22 12:11:41] [INFO ] Invariant cache hit.
[2024-05-22 12:11:41] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/205 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 214/419 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 38/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/423 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:11:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 66/205 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:11:41] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-05-22 12:11:41] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-22 12:11:41] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/419 variables, 205/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/423 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2302 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 12:11:44] [INFO ] Invariant cache hit.
[2024-05-22 12:11:44] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 12:11:44] [INFO ] Invariant cache hit.
[2024-05-22 12:11:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:11:45] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 1640 ms to find 0 implicit places.
[2024-05-22 12:11:45] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 12:11:45] [INFO ] Invariant cache hit.
[2024-05-22 12:11:45] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9525 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 12:12:02] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-22 12:12:03] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 494 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints]
After SMT, in 39611ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39614ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41263 ms. Remains : 209/209 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 182 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 182 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 179 transition count 184
Applied a total of 60 rules in 13 ms. Remains 179 /209 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 179 cols
[2024-05-22 12:12:25] [INFO ] Computed 32 invariants in 16 ms
[2024-05-22 12:12:25] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 12:12:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 12:12:25] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-22 12:12:25] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 12:12:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 12:12:25] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 12:12:25] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 12:12:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 12:12:25] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-22 12:12:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
TRAPS : Iteration 1
[2024-05-22 12:12:25] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 12:12:25] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 385 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-22 12:12:26] [INFO ] Computed 50 invariants in 12 ms
[2024-05-22 12:12:26] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 12:12:26] [INFO ] Invariant cache hit.
[2024-05-22 12:12:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 12:12:27] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2024-05-22 12:12:27] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 12:12:27] [INFO ] Invariant cache hit.
[2024-05-22 12:12:27] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/274 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:12:32] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:12:32] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-22 12:12:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 12:12:32] [INFO ] Deduced a trap composed of 139 places in 70 ms of which 2 ms to minimize.
[2024-05-22 12:12:32] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/535 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 18/347 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:12:39] [INFO ] Deduced a trap composed of 108 places in 85 ms of which 2 ms to minimize.
[2024-05-22 12:12:39] [INFO ] Deduced a trap composed of 122 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:12:39] [INFO ] Deduced a trap composed of 123 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:12:40] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 2 ms to minimize.
[2024-05-22 12:12:40] [INFO ] Deduced a trap composed of 118 places in 73 ms of which 1 ms to minimize.
[2024-05-22 12:12:40] [INFO ] Deduced a trap composed of 110 places in 80 ms of which 1 ms to minimize.
[2024-05-22 12:12:40] [INFO ] Deduced a trap composed of 115 places in 79 ms of which 1 ms to minimize.
[2024-05-22 12:12:40] [INFO ] Deduced a trap composed of 124 places in 86 ms of which 2 ms to minimize.
[2024-05-22 12:12:40] [INFO ] Deduced a trap composed of 117 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:12:40] [INFO ] Deduced a trap composed of 123 places in 76 ms of which 2 ms to minimize.
[2024-05-22 12:12:41] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2024-05-22 12:12:41] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:12:41] [INFO ] Deduced a trap composed of 130 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:12:42] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:12:42] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 15/362 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:12:43] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:12:45] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-22 12:12:45] [INFO ] Deduced a trap composed of 125 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:12:45] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 2 ms to minimize.
[2024-05-22 12:12:45] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:12:45] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:12:50] [INFO ] Deduced a trap composed of 127 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:12:50] [INFO ] Deduced a trap composed of 131 places in 70 ms of which 2 ms to minimize.
[2024-05-22 12:12:50] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:12:51] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:12:51] [INFO ] Deduced a trap composed of 113 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:12:51] [INFO ] Deduced a trap composed of 126 places in 73 ms of which 1 ms to minimize.
[2024-05-22 12:12:52] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:12:52] [INFO ] Deduced a trap composed of 133 places in 72 ms of which 2 ms to minimize.
[2024-05-22 12:12:52] [INFO ] Deduced a trap composed of 132 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:12:52] [INFO ] Deduced a trap composed of 137 places in 69 ms of which 2 ms to minimize.
[2024-05-22 12:12:52] [INFO ] Deduced a trap composed of 138 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:12:52] [INFO ] Deduced a trap composed of 132 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:12:53] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-22 12:12:53] [INFO ] Deduced a trap composed of 119 places in 73 ms of which 1 ms to minimize.
[2024-05-22 12:12:54] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:12:55] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-22 12:12:56] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-22 12:12:56] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 139 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 136 places in 69 ms of which 2 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 139 places in 72 ms of which 1 ms to minimize.
[2024-05-22 12:12:57] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 390 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/274 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/535 variables, 274/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 18/390 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 260/650 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:13:12] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:13:12] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:13:13] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:13:13] [INFO ] Deduced a trap composed of 97 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:13:13] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:13:14] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:13:14] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:13:14] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:13:15] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:13:17] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-05-22 12:13:17] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:13:19] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 0 ms to minimize.
[2024-05-22 12:13:19] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 13/663 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 663 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 61/61 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61300 ms. Remains : 274/274 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 857 edges and 274 vertex of which 271 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5640 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3238 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 735264 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 735264 steps, saw 367749 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
[2024-05-22 12:13:30] [INFO ] Invariant cache hit.
[2024-05-22 12:13:30] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/270 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/531 variables, 270/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 18/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/535 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/270 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:13:31] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 12:13:31] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-22 12:13:31] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-22 12:13:31] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 12:13:31] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 261/531 variables, 270/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/535 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/535 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 964ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3525 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 261/261 transitions.
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 274 transition count 223
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 76 place count 236 transition count 223
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 114 place count 236 transition count 223
Applied a total of 114 rules in 11 ms. Remains 236 /274 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/274 places, 223/261 transitions.
RANDOM walk for 40000 steps (5029 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3375 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 747826 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 1
Probabilistic random walk after 747826 steps, saw 374159 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
// Phase 1: matrix 223 rows 236 cols
[2024-05-22 12:13:38] [INFO ] Computed 50 invariants in 19 ms
[2024-05-22 12:13:38] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/230 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/232 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/455 variables, 232/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 38/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/459 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/459 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:13:38] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-22 12:13:38] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 103/230 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:13:38] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:13:38] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:13:38] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:13:38] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:13:38] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:13:39] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:13:39] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/455 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 38/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/459 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/459 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2776 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 12:13:42] [INFO ] Invariant cache hit.
[2024-05-22 12:13:42] [INFO ] Implicit Places using invariants in 316 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 227, 233]
[2024-05-22 12:13:42] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 317 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 222
Applied a total of 2 rules in 8 ms. Remains 233 /234 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 233 cols
[2024-05-22 12:13:42] [INFO ] Computed 48 invariants in 10 ms
[2024-05-22 12:13:42] [INFO ] Implicit Places using invariants in 286 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183, 224, 230]
[2024-05-22 12:13:42] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 287 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 221
Applied a total of 2 rules in 7 ms. Remains 230 /231 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 230 cols
[2024-05-22 12:13:42] [INFO ] Computed 46 invariants in 13 ms
[2024-05-22 12:13:43] [INFO ] Implicit Places using invariants in 249 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183]
[2024-05-22 12:13:43] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 249 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 220
Applied a total of 2 rules in 7 ms. Remains 227 /228 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 227 cols
[2024-05-22 12:13:43] [INFO ] Computed 44 invariants in 9 ms
[2024-05-22 12:13:43] [INFO ] Implicit Places using invariants in 222 ms returned [43, 48, 70, 75, 95, 101, 122, 127, 147, 152, 174, 180]
[2024-05-22 12:13:43] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 223 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 219
Applied a total of 2 rules in 6 ms. Remains 224 /225 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 224 cols
[2024-05-22 12:13:43] [INFO ] Computed 42 invariants in 7 ms
[2024-05-22 12:13:43] [INFO ] Implicit Places using invariants in 200 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 171, 177]
[2024-05-22 12:13:43] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 200 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Applied a total of 2 rules in 6 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 221 cols
[2024-05-22 12:13:43] [INFO ] Computed 40 invariants in 9 ms
[2024-05-22 12:13:43] [INFO ] Implicit Places using invariants in 185 ms returned [89, 95, 116, 121, 141, 146, 168, 174]
[2024-05-22 12:13:43] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 186 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 7 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 218 cols
[2024-05-22 12:13:43] [INFO ] Computed 38 invariants in 8 ms
[2024-05-22 12:13:43] [INFO ] Implicit Places using invariants in 168 ms returned [113, 118, 138, 143, 165, 171]
[2024-05-22 12:13:43] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 168 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 6 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 215 cols
[2024-05-22 12:13:43] [INFO ] Computed 36 invariants in 10 ms
[2024-05-22 12:13:43] [INFO ] Implicit Places using invariants in 163 ms returned [135, 140, 162, 168]
[2024-05-22 12:13:43] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 164 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 212 cols
[2024-05-22 12:13:43] [INFO ] Computed 34 invariants in 9 ms
[2024-05-22 12:13:44] [INFO ] Implicit Places using invariants in 147 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 209 cols
[2024-05-22 12:13:44] [INFO ] Computed 32 invariants in 10 ms
[2024-05-22 12:13:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 12:13:44] [INFO ] Invariant cache hit.
[2024-05-22 12:13:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:13:45] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3665 ms. Remains : 209/236 places, 214/223 transitions.
RANDOM walk for 40000 steps (5760 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3588 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 813603 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :0 out of 1
Probabilistic random walk after 813603 steps, saw 406882 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
[2024-05-22 12:13:48] [INFO ] Invariant cache hit.
[2024-05-22 12:13:48] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/205 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 214/419 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 38/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/423 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:13:49] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 66/205 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 12:13:49] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 12:13:49] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-05-22 12:13:49] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/419 variables, 205/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/423 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2311 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 12:13:51] [INFO ] Invariant cache hit.
[2024-05-22 12:13:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 12:13:52] [INFO ] Invariant cache hit.
[2024-05-22 12:13:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 12:13:53] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
[2024-05-22 12:13:53] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 12:13:53] [INFO ] Invariant cache hit.
[2024-05-22 12:13:53] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9454 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 12:14:10] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 12:14:10] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 494 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints]
After SMT, in 39551ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39554ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41194 ms. Remains : 209/209 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 182 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 182 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 179 transition count 184
Applied a total of 60 rules in 10 ms. Remains 179 /209 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 179 cols
[2024-05-22 12:14:33] [INFO ] Computed 32 invariants in 13 ms
[2024-05-22 12:14:33] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 12:14:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 12:14:33] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-22 12:14:33] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 12:14:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 12:14:33] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-22 12:14:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
TRAPS : Iteration 1
[2024-05-22 12:14:33] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 12:14:33] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 357 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13926 reset in 89 ms.
Product exploration explored 100000 steps with 13938 reset in 95 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 261/261 transitions.
Applied a total of 0 rules in 3 ms. Remains 274 /274 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-22 12:14:33] [INFO ] Computed 50 invariants in 12 ms
[2024-05-22 12:14:34] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 12:14:34] [INFO ] Invariant cache hit.
[2024-05-22 12:14:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 12:14:35] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2024-05-22 12:14:35] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 12:14:35] [INFO ] Invariant cache hit.
[2024-05-22 12:14:35] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/274 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:14:39] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-22 12:14:39] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-22 12:14:39] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 12:14:40] [INFO ] Deduced a trap composed of 139 places in 79 ms of which 2 ms to minimize.
[2024-05-22 12:14:40] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/535 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 18/347 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:14:46] [INFO ] Deduced a trap composed of 108 places in 79 ms of which 2 ms to minimize.
[2024-05-22 12:14:46] [INFO ] Deduced a trap composed of 122 places in 77 ms of which 1 ms to minimize.
[2024-05-22 12:14:46] [INFO ] Deduced a trap composed of 123 places in 74 ms of which 1 ms to minimize.
[2024-05-22 12:14:47] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 1 ms to minimize.
[2024-05-22 12:14:47] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 1 ms to minimize.
[2024-05-22 12:14:47] [INFO ] Deduced a trap composed of 110 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:14:47] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 1 ms to minimize.
[2024-05-22 12:14:48] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 2 ms to minimize.
[2024-05-22 12:14:48] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:14:48] [INFO ] Deduced a trap composed of 123 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:14:49] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-22 12:14:49] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-22 12:14:49] [INFO ] Deduced a trap composed of 130 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:14:49] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:14:50] [INFO ] Deduced a trap composed of 120 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 15/362 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:14:50] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:14:53] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-22 12:14:53] [INFO ] Deduced a trap composed of 125 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:14:53] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 1 ms to minimize.
[2024-05-22 12:14:53] [INFO ] Deduced a trap composed of 95 places in 69 ms of which 1 ms to minimize.
[2024-05-22 12:14:53] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:14:57] [INFO ] Deduced a trap composed of 127 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:14:58] [INFO ] Deduced a trap composed of 131 places in 78 ms of which 1 ms to minimize.
[2024-05-22 12:14:58] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-22 12:14:59] [INFO ] Deduced a trap composed of 121 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:14:59] [INFO ] Deduced a trap composed of 113 places in 65 ms of which 2 ms to minimize.
[2024-05-22 12:14:59] [INFO ] Deduced a trap composed of 126 places in 79 ms of which 2 ms to minimize.
[2024-05-22 12:14:59] [INFO ] Deduced a trap composed of 130 places in 78 ms of which 1 ms to minimize.
[2024-05-22 12:14:59] [INFO ] Deduced a trap composed of 133 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:14:59] [INFO ] Deduced a trap composed of 132 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:15:00] [INFO ] Deduced a trap composed of 137 places in 68 ms of which 2 ms to minimize.
[2024-05-22 12:15:00] [INFO ] Deduced a trap composed of 138 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:15:00] [INFO ] Deduced a trap composed of 132 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:15:00] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-22 12:15:01] [INFO ] Deduced a trap composed of 119 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:15:01] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:15:03] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:15:03] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:15:04] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-22 12:15:04] [INFO ] Deduced a trap composed of 139 places in 75 ms of which 2 ms to minimize.
[2024-05-22 12:15:05] [INFO ] Deduced a trap composed of 136 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:15:05] [INFO ] Deduced a trap composed of 139 places in 66 ms of which 2 ms to minimize.
[2024-05-22 12:15:05] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 390 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/274 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/535 variables, 274/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 18/390 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 260/650 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 12:15:19] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:15:19] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-22 12:15:20] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:15:20] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:15:20] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:15:21] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:15:21] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:15:21] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:15:22] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 0 ms to minimize.
[2024-05-22 12:15:24] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:15:25] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-22 12:15:27] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:15:27] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 13/663 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 663 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 61/61 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61288 ms. Remains : 274/274 places, 261/261 transitions.
Treatment of property DoubleExponent-PT-010-LTLCardinality-14 finished in 316667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p0)))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p0)))))'
[2024-05-22 12:15:36] [INFO ] Flatten gal took : 27 ms
[2024-05-22 12:15:36] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-22 12:15:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 528 places, 497 transitions and 1393 arcs took 7 ms.
Total runtime 2793790 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-010

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 528
TRANSITIONS: 497
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]

SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 9663
MODEL NAME: /home/mcc/execution/412/model
528 places, 497 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -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="DoubleExponent-PT-010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131300555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;