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.r488-tall-171631132900564.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 ltsminxred
Input is DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 340K 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-020-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717194706223

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:31:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:31:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:31:47] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-31 22:31:47] [INFO ] Transformed 1064 places.
[2024-05-31 22:31:47] [INFO ] Transformed 998 transitions.
[2024-05-31 22:31:47] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 136 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2024-05-31 22:31:48] [INFO ] Invariants computation overflowed in 144 ms
[2024-05-31 22:31:48] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2024-05-31 22:31:48] [INFO ] Invariants computation overflowed in 98 ms
[2024-05-31 22:32:03] [INFO ] Implicit Places using invariants and state equation in 14647 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15304 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 139 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:32:03] [INFO ] Invariants computation overflowed in 127 ms
[2024-05-31 22:32:03] [INFO ] Implicit Places using invariants in 499 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:32:04] [INFO ] Invariants computation overflowed in 122 ms
[2024-05-31 22:32:17] [INFO ] Implicit Places using invariants and state equation in 13264 ms returned []
Implicit Place search using SMT with State Equation took 13771 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1064 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29368 ms. Remains : 1057/1064 places, 997/998 transitions.
Support contains 54 out of 1057 places after structural reductions.
[2024-05-31 22:32:17] [INFO ] Flatten gal took : 120 ms
[2024-05-31 22:32:17] [INFO ] Flatten gal took : 51 ms
[2024-05-31 22:32:17] [INFO ] Input system was already deterministic with 997 transitions.
Support contains 52 out of 1057 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (1307 resets) in 1418 ms. (28 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4000 steps (113 resets) in 98 ms. (40 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (113 resets) in 51 ms. (76 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (116 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (114 resets) in 75 ms. (52 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (113 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (111 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (115 resets) in 72 ms. (54 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (106 resets) in 27 ms. (142 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4000 steps (112 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (110 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (119 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (116 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (114 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (107 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (114 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (113 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (108 resets) in 28 ms. (137 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (118 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (115 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (109 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (118 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (109 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (112 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (110 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (116 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (111 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (110 resets) in 42 ms. (93 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (110 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:32:18] [INFO ] Invariants computation overflowed in 118 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 122/171 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 408/579 variables, 184/233 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 559/1138 variables, 276/509 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1138 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 466/1604 variables, 273/782 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1604 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 238/1842 variables, 145/927 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1842 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 135/1977 variables, 76/1003 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1977 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 67/2044 variables, 46/1049 constraints. Problems are: Problem set: 0 solved, 28 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 2044/2054 variables, and 1049 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5011 ms.
Refiners :[State Equation: 1049/1057 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 122/171 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 408/579 variables, 184/233 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 28/261 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 559/1138 variables, 276/537 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1138 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 466/1604 variables, 273/810 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1604 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 238/1842 variables, 145/955 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1842 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 28 unsolved
SMT process timed out in 10195ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 1055 transition count 803
Reduce places removed 192 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 206 rules applied. Total rules applied 400 place count 863 transition count 789
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 414 place count 849 transition count 789
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 414 place count 849 transition count 747
Deduced a syphon composed of 42 places in 8 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 498 place count 807 transition count 747
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 11 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 3 with 324 rules applied. Total rules applied 822 place count 645 transition count 585
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 9 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 890 place count 611 transition count 585
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 892 place count 611 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 894 place count 609 transition count 583
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 4 with 80 rules applied. Total rules applied 974 place count 609 transition count 503
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 1054 place count 529 transition count 503
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 5 with 79 rules applied. Total rules applied 1133 place count 529 transition count 503
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1134 place count 528 transition count 502
Applied a total of 1134 rules in 306 ms. Remains 528 /1057 variables (removed 529) and now considering 502/997 (removed 495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 528/1057 places, 502/997 transitions.
RANDOM walk for 40000 steps (5189 resets) in 555 ms. (71 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (336 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (335 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (328 resets) in 46 ms. (85 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (328 resets) in 54 ms. (72 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (348 resets) in 60 ms. (65 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (342 resets) in 56 ms. (70 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (340 resets) in 48 ms. (81 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (331 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (349 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (356 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (348 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (349 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (339 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (355 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (355 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (342 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (340 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (333 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (361 resets) in 71 ms. (55 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (325 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (343 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (341 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (344 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (345 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (356 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (340 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (325 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (342 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 160007 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :1 out of 28
Probabilistic random walk after 160007 steps, saw 80019 distinct states, run finished after 3009 ms. (steps per millisecond=53 ) properties seen :1
// Phase 1: matrix 502 rows 528 cols
[2024-05-31 22:32:32] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 22:32:32] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 155/204 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 482/686 variables, 232/284 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 24/308 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 312/998 variables, 217/525 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/998 variables, 37/562 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 10 (OVERLAPS) 32/1030 variables, 30/592 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1030 variables, 1/593 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1030 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/1030 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1030/1030 variables, and 593 constraints, problems are : Problem set: 1 solved, 26 unsolved in 6315 ms.
Refiners :[State Equation: 528/528 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 145/191 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 459/650 variables, 220/269 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 24/293 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 25/318 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 327/977 variables, 216/534 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 35/569 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 1/570 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/570 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 52/1029 variables, 45/615 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1029 variables, 3/618 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-31 22:32:49] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 17 ms to minimize.
[2024-05-31 22:32:49] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 3 ms to minimize.
[2024-05-31 22:32:49] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:32:49] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:32:50] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1029 variables, 5/623 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1029 variables, 0/623 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 1/1030 variables, 1/624 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:32:57] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 116 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 113 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 118 places in 95 ms of which 3 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:32:58] [INFO ] Deduced a trap composed of 115 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 121 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 112 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 118 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 121 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1030 variables, 20/644 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-31 22:33:07] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-31 22:33:07] [INFO ] Deduced a trap composed of 147 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:33:07] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2024-05-31 22:33:08] [INFO ] Deduced a trap composed of 109 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:33:08] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:33:09] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:33:09] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:33:09] [INFO ] Deduced a trap composed of 116 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:33:10] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:33:10] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:33:10] [INFO ] Deduced a trap composed of 169 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:33:11] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:33:11] [INFO ] Deduced a trap composed of 124 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:33:12] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
[2024-05-31 22:33:12] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:33:12] [INFO ] Deduced a trap composed of 129 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:33:13] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:33:13] [INFO ] Deduced a trap composed of 109 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:33:13] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:33:14] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1030 variables, 20/664 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-31 22:33:20] [INFO ] Deduced a trap composed of 172 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:33:21] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:33:21] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 2 ms to minimize.
[2024-05-31 22:33:21] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:33:21] [INFO ] Deduced a trap composed of 172 places in 152 ms of which 3 ms to minimize.
[2024-05-31 22:33:21] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:33:22] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:33:22] [INFO ] Deduced a trap composed of 161 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:33:22] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 2 ms to minimize.
[2024-05-31 22:33:22] [INFO ] Deduced a trap composed of 171 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:33:22] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:33:23] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:33:23] [INFO ] Deduced a trap composed of 175 places in 163 ms of which 2 ms to minimize.
[2024-05-31 22:33:23] [INFO ] Deduced a trap composed of 181 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:33:23] [INFO ] Deduced a trap composed of 172 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:33:24] [INFO ] Deduced a trap composed of 185 places in 161 ms of which 3 ms to minimize.
SMT process timed out in 51458ms, After SMT, problems are : Problem set: 1 solved, 26 unsolved
Fused 26 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 30002 ms.
Support contains 46 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 502/502 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 528 transition count 501
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 501
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 525 transition count 499
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 525 transition count 499
Applied a total of 7 rules in 54 ms. Remains 525 /528 variables (removed 3) and now considering 499/502 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 525/528 places, 499/502 transitions.
RANDOM walk for 40000 steps (5133 resets) in 307 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (341 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (344 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (329 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (327 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (335 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (343 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (351 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (342 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (324 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (334 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (348 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (355 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (337 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (339 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (359 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (326 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (340 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (330 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (345 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (344 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (338 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (331 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (329 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (345 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (334 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (323 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 177014 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 26
Probabilistic random walk after 177014 steps, saw 88537 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 499 rows 525 cols
[2024-05-31 22:33:57] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-31 22:33:57] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 145/191 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 459/650 variables, 220/269 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 327/977 variables, 216/509 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 35/544 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 47/1024 variables, 43/587 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/1024 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 590 constraints, problems are : Problem set: 0 solved, 26 unsolved in 6210 ms.
Refiners :[State Equation: 525/525 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 145/191 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 459/650 variables, 220/269 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 25/318 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 327/977 variables, 216/534 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 35/569 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 47/1024 variables, 43/613 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:34:14] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:34:14] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:34:14] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:34:15] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:34:15] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:34:15] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:34:15] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 2 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 2 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 2 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 2 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 2 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 144 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:34:18] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:34:19] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:34:26] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 184 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 176 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:34:28] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:34:28] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:34:28] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
[2024-05-31 22:34:28] [INFO ] Deduced a trap composed of 190 places in 158 ms of which 2 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 193 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 193 places in 150 ms of which 3 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 181 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 176 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1024 variables, 20/656 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:34:48] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 2 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 174 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 185 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 186 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:34:50] [INFO ] Deduced a trap composed of 186 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:34:50] [INFO ] Deduced a trap composed of 183 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:34:50] [INFO ] Deduced a trap composed of 169 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:34:50] [INFO ] Deduced a trap composed of 174 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:34:50] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 161 places in 159 ms of which 2 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 144 places in 158 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1024 variables, 20/676 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 1 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 152 places in 141 ms of which 2 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 157 places in 132 ms of which 2 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 157 places in 143 ms of which 2 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 151 places in 139 ms of which 2 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 150 places in 128 ms of which 2 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 170 places in 138 ms of which 2 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 161 places in 140 ms of which 2 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 2 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 157 places in 136 ms of which 3 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 147 places in 140 ms of which 2 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 2 ms to minimize.
[2024-05-31 22:34:59] [INFO ] Deduced a trap composed of 151 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:34:59] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 3 ms to minimize.
[2024-05-31 22:34:59] [INFO ] Deduced a trap composed of 150 places in 136 ms of which 2 ms to minimize.
[2024-05-31 22:34:59] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:34:59] [INFO ] Deduced a trap composed of 154 places in 135 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1024 variables, 20/696 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:35:06] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 2 ms to minimize.
[2024-05-31 22:35:06] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 3 ms to minimize.
[2024-05-31 22:35:06] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 2 ms to minimize.
[2024-05-31 22:35:06] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 3 ms to minimize.
[2024-05-31 22:35:06] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 3 ms to minimize.
[2024-05-31 22:35:06] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 3 ms to minimize.
[2024-05-31 22:35:07] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 3 ms to minimize.
[2024-05-31 22:35:07] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 3 ms to minimize.
[2024-05-31 22:35:07] [INFO ] Deduced a trap composed of 140 places in 136 ms of which 2 ms to minimize.
[2024-05-31 22:35:07] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 2 ms to minimize.
[2024-05-31 22:35:08] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:35:08] [INFO ] Deduced a trap composed of 145 places in 138 ms of which 3 ms to minimize.
[2024-05-31 22:35:08] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 2 ms to minimize.
[2024-05-31 22:35:08] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 2 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 2 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 2 ms to minimize.
[2024-05-31 22:35:10] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 2 ms to minimize.
[2024-05-31 22:35:10] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 3 ms to minimize.
[2024-05-31 22:35:10] [INFO ] Deduced a trap composed of 141 places in 135 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1024 variables, 20/716 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 716 constraints, problems are : Problem set: 0 solved, 26 unsolved in 75019 ms.
Refiners :[State Equation: 525/525 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 100/100 constraints]
After SMT, in 81350ms problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 499/499 transitions.
Applied a total of 0 rules in 22 ms. Remains 525 /525 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 525/525 places, 499/499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 499/499 transitions.
Applied a total of 0 rules in 18 ms. Remains 525 /525 variables (removed 0) and now considering 499/499 (removed 0) transitions.
// Phase 1: matrix 499 rows 525 cols
[2024-05-31 22:35:19] [INFO ] Invariants computation overflowed in 119 ms
[2024-05-31 22:35:19] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 499 rows 525 cols
[2024-05-31 22:35:19] [INFO ] Invariants computation overflowed in 74 ms
[2024-05-31 22:35:19] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 22:35:26] [INFO ] Implicit Places using invariants and state equation in 7073 ms returned [43, 49, 70, 75, 140, 171, 196, 202, 227, 233, 240, 262, 285, 291, 316, 321, 345, 405, 411, 433, 436, 441, 462, 468, 491, 496, 500, 517, 523]
[2024-05-31 22:35:26] [INFO ] Actually due to overlaps returned [202, 411, 240, 70, 171, 196, 405, 75, 140]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 7507 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 516/525 places, 499/499 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 496
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 513 transition count 496
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 513 transition count 496
Applied a total of 9 rules in 55 ms. Remains 513 /516 variables (removed 3) and now considering 496/499 (removed 3) transitions.
// Phase 1: matrix 496 rows 513 cols
[2024-05-31 22:35:26] [INFO ] Invariants computation overflowed in 59 ms
[2024-05-31 22:35:26] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 496 rows 513 cols
[2024-05-31 22:35:26] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-31 22:35:27] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 22:35:34] [INFO ] Implicit Places using invariants and state equation in 8009 ms returned [43, 49, 220, 226, 253, 276, 282, 307, 312, 336, 421, 424, 429, 450, 456, 479, 484, 488, 505, 511]
[2024-05-31 22:35:34] [INFO ] Actually due to overlaps returned [226, 429, 488, 220, 424, 421]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 8288 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 507/525 places, 496/499 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 507 transition count 493
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 504 transition count 493
Applied a total of 6 rules in 30 ms. Remains 504 /507 variables (removed 3) and now considering 493/496 (removed 3) transitions.
// Phase 1: matrix 493 rows 504 cols
[2024-05-31 22:35:35] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 22:35:35] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 493 rows 504 cols
[2024-05-31 22:35:35] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:35:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 22:35:48] [INFO ] Implicit Places using invariants and state equation in 13274 ms returned [43, 49, 250, 273, 279, 304, 309, 333, 443, 449, 472, 477, 496, 502]
[2024-05-31 22:35:48] [INFO ] Actually due to overlaps returned [250, 449, 43, 443, 49]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 13598 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 499/525 places, 493/499 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 499 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 498 transition count 492
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 498 transition count 492
Applied a total of 4 rules in 33 ms. Remains 498 /499 variables (removed 1) and now considering 492/493 (removed 1) transitions.
// Phase 1: matrix 492 rows 498 cols
[2024-05-31 22:35:48] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:35:48] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 492 rows 498 cols
[2024-05-31 22:35:48] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:35:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 22:35:56] [INFO ] Implicit Places using invariants and state equation in 7165 ms returned [269, 275, 300, 305, 329, 466, 471, 490, 496]
[2024-05-31 22:35:56] [INFO ] Actually due to overlaps returned [275, 471, 269, 466]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7421 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 494/525 places, 492/499 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 494 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 492 transition count 490
Applied a total of 4 rules in 24 ms. Remains 492 /494 variables (removed 2) and now considering 490/492 (removed 2) transitions.
// Phase 1: matrix 490 rows 492 cols
[2024-05-31 22:35:56] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:35:56] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 490 rows 492 cols
[2024-05-31 22:35:56] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:35:56] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 22:36:01] [INFO ] Implicit Places using invariants and state equation in 5458 ms returned [297, 302, 326, 484, 490]
[2024-05-31 22:36:01] [INFO ] Actually due to overlaps returned [302, 297, 484, 490]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 5729 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 488/525 places, 490/499 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 488 transition count 488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 486 transition count 488
Applied a total of 4 rules in 24 ms. Remains 486 /488 variables (removed 2) and now considering 488/490 (removed 2) transitions.
// Phase 1: matrix 488 rows 486 cols
[2024-05-31 22:36:01] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:36:02] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 488 rows 486 cols
[2024-05-31 22:36:02] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:36:02] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 22:36:07] [INFO ] Implicit Places using invariants and state equation in 5789 ms returned [323]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6048 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 485/525 places, 488/499 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 485 transition count 488
Applied a total of 1 rules in 22 ms. Remains 485 /485 variables (removed 0) and now considering 488/488 (removed 0) transitions.
// Phase 1: matrix 488 rows 485 cols
[2024-05-31 22:36:07] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:36:08] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 488 rows 485 cols
[2024-05-31 22:36:08] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:36:08] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 22:36:14] [INFO ] Implicit Places using invariants and state equation in 6608 ms returned []
Implicit Place search using SMT with State Equation took 6847 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 485/525 places, 488/499 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 55646 ms. Remains : 485/525 places, 488/499 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 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 U p1))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 30 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:36:15] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-31 22:36:15] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:36:15] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-31 22:36:28] [INFO ] Implicit Places using invariants and state equation in 13683 ms returned []
Implicit Place search using SMT with State Equation took 14070 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:36:29] [INFO ] Invariants computation overflowed in 106 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30028 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30029 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Finished structural reductions in LTL mode , in 1 iterations and 74478 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 3342 reset in 242 ms.
Product exploration explored 100000 steps with 3329 reset in 165 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (1314 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1128 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1142 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1142 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1147 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 200105 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 4
Probabilistic random walk after 200105 steps, saw 100066 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:37:33] [INFO ] Invariants computation overflowed in 121 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/50 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 89/139 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 136/275 variables, 65/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 155/430 variables, 78/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 151/581 variables, 77/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 184/765 variables, 95/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/765 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 158/923 variables, 82/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/923 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 180/1103 variables, 89/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1103 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 165/1268 variables, 92/635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1268 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 104/1372 variables, 61/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1372 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 68/1440 variables, 36/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1440 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 66/1506 variables, 36/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1506 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 51/1557 variables, 26/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1557 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 60/1617 variables, 31/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1617 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 48/1665 variables, 25/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1665 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 56/1721 variables, 29/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1721 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 47/1768 variables, 24/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1768 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 56/1824 variables, 29/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1824 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 47/1871 variables, 24/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1871 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 56/1927 variables, 29/985 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1927 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 48/1975 variables, 24/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1975 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 59/2034 variables, 31/1040 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:37:36] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 6 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/2034 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2034 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 48 (OVERLAPS) 20/2054 variables, 17/1058 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-31 22:37:37] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 6 ms to minimize.
[2024-05-31 22:37:38] [INFO ] Deduced a trap composed of 16 places in 286 ms of which 5 ms to minimize.
[2024-05-31 22:37:38] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 1061 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5021 ms.
Refiners :[State Equation: 1057/1057 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 39/50 variables, 14/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 3/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 89/139 variables, 40/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 136/275 variables, 65/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 155/430 variables, 78/203 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 151/581 variables, 77/280 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 184/765 variables, 95/375 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/765 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 158/923 variables, 82/457 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/923 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 180/1103 variables, 89/546 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1103 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 165/1268 variables, 92/638 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1268 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 104/1372 variables, 61/699 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1372 variables, 0/699 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 68/1440 variables, 36/735 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1440 variables, 0/735 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 66/1506 variables, 36/771 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1506 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 51/1557 variables, 26/797 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1557 variables, 0/797 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 60/1617 variables, 31/828 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1617 variables, 0/828 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 48/1665 variables, 25/853 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1665 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 56/1721 variables, 29/882 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1721 variables, 0/882 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 47/1768 variables, 24/906 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1768 variables, 0/906 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 56/1824 variables, 29/935 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1824 variables, 0/935 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 47/1871 variables, 24/959 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1871 variables, 0/959 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 56/1927 variables, 29/988 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1927 variables, 0/988 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 48/1975 variables, 24/1012 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1975 variables, 0/1012 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 59/2034 variables, 31/1043 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2034 variables, 1/1044 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2034 variables, 0/1044 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2054/2054 variables, and 1061 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4278 ms.
Refiners :[State Equation: 1057/1057 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/4 constraints]
After SMT, in 9440ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 10 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1000 place count 556 transition count 533
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 1079 place count 556 transition count 454
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 1158 place count 477 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1237 place count 477 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1238 place count 476 transition count 453
Applied a total of 1238 rules in 160 ms. Remains 476 /1057 variables (removed 581) and now considering 453/997 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 476/1057 places, 453/997 transitions.
RANDOM walk for 40000 steps (5072 resets) in 225 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3396 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3319 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3403 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 245920 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 3
Probabilistic random walk after 245920 steps, saw 123014 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 453 rows 476 cols
[2024-05-31 22:38:16] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:38:16] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 176/189 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 529/718 variables, 266/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 46/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 211/929 variables, 171/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 29/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/929 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/929 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 929/929 variables, and 553 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1588 ms.
Refiners :[State Equation: 476/476 constraints, ReadFeed: 77/77 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 176/189 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 529/718 variables, 266/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 46/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/718 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 211/929 variables, 171/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/929 variables, 29/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:38:19] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:38:19] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 1 ms to minimize.
[2024-05-31 22:38:19] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:38:19] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-05-31 22:38:19] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-05-31 22:38:20] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:38:20] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-05-31 22:38:20] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:38:20] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 2 ms to minimize.
[2024-05-31 22:38:20] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:38:21] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 22:38:21] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-31 22:38:21] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-31 22:38:22] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2024-05-31 22:38:22] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 2 ms to minimize.
[2024-05-31 22:38:23] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-31 22:38:23] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 2 ms to minimize.
[2024-05-31 22:38:23] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:38:23] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:38:24] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 929/929 variables, and 576 constraints, problems are : Problem set: 0 solved, 3 unsolved in 20109 ms.
Refiners :[State Equation: 476/476 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 21745ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2024-05-31 22:39:08] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:39:08] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2024-05-31 22:39:08] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:39:08] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:39:18] [INFO ] Implicit Places using invariants and state equation in 10154 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 231, 254, 260, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 414, 420, 442, 447, 451, 468, 474]
[2024-05-31 22:39:18] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10665 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/476 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 452
Applied a total of 2 rules in 24 ms. Remains 473 /474 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 473 cols
[2024-05-31 22:39:18] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-31 22:39:19] [INFO ] Implicit Places using invariants in 488 ms returned []
// Phase 1: matrix 452 rows 473 cols
[2024-05-31 22:39:19] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-31 22:39:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:39:30] [INFO ] Implicit Places using invariants and state equation in 10898 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 228, 251, 257, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 411, 417, 439, 444, 448, 465, 471]
[2024-05-31 22:39:30] [INFO ] Actually due to overlaps returned [448, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11407 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 471/476 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 470 transition count 451
Applied a total of 2 rules in 22 ms. Remains 470 /471 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 470 cols
[2024-05-31 22:39:30] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:39:30] [INFO ] Implicit Places using invariants in 470 ms returned []
// Phase 1: matrix 451 rows 470 cols
[2024-05-31 22:39:30] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:39:31] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:39:43] [INFO ] Implicit Places using invariants and state equation in 12641 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 228, 251, 257, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 410, 416, 438, 443, 462, 468]
[2024-05-31 22:39:43] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13121 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 468/476 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 467 transition count 450
Applied a total of 2 rules in 24 ms. Remains 467 /468 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 467 cols
[2024-05-31 22:39:43] [INFO ] Computed 93 invariants in 58 ms
[2024-05-31 22:39:44] [INFO ] Implicit Places using invariants in 1264 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 225, 248, 254, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 407, 413, 435, 440, 459, 465]
[2024-05-31 22:39:44] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1266 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 465/476 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 464 transition count 449
Applied a total of 2 rules in 19 ms. Remains 464 /465 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 464 cols
[2024-05-31 22:39:44] [INFO ] Computed 91 invariants in 73 ms
[2024-05-31 22:39:45] [INFO ] Implicit Places using invariants in 1129 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 222, 245, 251, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 404, 410, 432, 437, 456, 462]
[2024-05-31 22:39:45] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1131 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 462/476 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 461 transition count 448
Applied a total of 2 rules in 20 ms. Remains 461 /462 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 461 cols
[2024-05-31 22:39:45] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:39:46] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 448 rows 461 cols
[2024-05-31 22:39:46] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:39:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:40:02] [INFO ] Implicit Places using invariants and state equation in 16382 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 219, 242, 248, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 401, 407, 429, 434, 453, 459]
[2024-05-31 22:40:02] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16788 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 459/476 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 459 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 447
Applied a total of 2 rules in 17 ms. Remains 458 /459 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 458 cols
[2024-05-31 22:40:02] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-31 22:40:03] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 447 rows 458 cols
[2024-05-31 22:40:03] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 22:40:03] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:40:19] [INFO ] Implicit Places using invariants and state equation in 16195 ms returned [134, 139, 159, 164, 185, 191, 210, 216, 239, 245, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 398, 404, 426, 431, 450, 456]
[2024-05-31 22:40:19] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16603 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 456/476 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 446
Applied a total of 2 rules in 22 ms. Remains 455 /456 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 455 cols
[2024-05-31 22:40:19] [INFO ] Computed 85 invariants in 48 ms
[2024-05-31 22:40:20] [INFO ] Implicit Places using invariants in 830 ms returned [156, 161, 182, 188, 207, 213, 236, 242, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 395, 401, 423, 428, 447, 453]
[2024-05-31 22:40:20] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 832 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 453/476 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 445
Applied a total of 2 rules in 17 ms. Remains 452 /453 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 452 cols
[2024-05-31 22:40:20] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 22:40:20] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 445 rows 452 cols
[2024-05-31 22:40:20] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:40:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:40:34] [INFO ] Implicit Places using invariants and state equation in 14251 ms returned [179, 185, 204, 210, 233, 239, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 392, 398, 420, 425, 444, 450]
[2024-05-31 22:40:34] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14628 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 450/476 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 444
Applied a total of 2 rules in 20 ms. Remains 449 /450 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 449 cols
[2024-05-31 22:40:34] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:40:35] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 444 rows 449 cols
[2024-05-31 22:40:35] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 22:40:35] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:40:45] [INFO ] Implicit Places using invariants and state equation in 9963 ms returned [201, 207, 230, 236, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 389, 395, 417, 422, 441, 447]
[2024-05-31 22:40:45] [INFO ] Actually due to overlaps returned [207, 201]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10317 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 447/476 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 443
Applied a total of 2 rules in 21 ms. Remains 446 /447 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 446 cols
[2024-05-31 22:40:45] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:40:45] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 443 rows 446 cols
[2024-05-31 22:40:45] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:40:45] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:40:52] [INFO ] Implicit Places using invariants and state equation in 7105 ms returned [227, 233, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 386, 392, 414, 419, 438, 444]
[2024-05-31 22:40:52] [INFO ] Actually due to overlaps returned [233, 227]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7433 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 444/476 places, 443/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 442
Applied a total of 2 rules in 16 ms. Remains 443 /444 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 443 cols
[2024-05-31 22:40:52] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:40:52] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 442 rows 443 cols
[2024-05-31 22:40:52] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:40:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:41:00] [INFO ] Implicit Places using invariants and state equation in 7431 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 383, 389, 411, 416, 435, 441]
[2024-05-31 22:41:00] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7761 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 441/476 places, 442/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 441
Applied a total of 2 rules in 21 ms. Remains 440 /441 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 440 cols
[2024-05-31 22:41:00] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:41:00] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 441 rows 440 cols
[2024-05-31 22:41:00] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:41:00] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:41:08] [INFO ] Implicit Places using invariants and state equation in 7810 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 380, 386, 408, 413, 432, 438]
[2024-05-31 22:41:08] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8128 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 438/476 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 437 transition count 440
Applied a total of 2 rules in 22 ms. Remains 437 /438 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 437 cols
[2024-05-31 22:41:08] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:41:08] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 440 rows 437 cols
[2024-05-31 22:41:08] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:41:09] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:41:24] [INFO ] Implicit Places using invariants and state equation in 15514 ms returned [298, 303, 324, 330, 351, 356, 377, 383, 405, 410, 429, 435]
[2024-05-31 22:41:24] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15839 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 435/476 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 439
Applied a total of 2 rules in 22 ms. Remains 434 /435 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 434 cols
[2024-05-31 22:41:24] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:41:24] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 439 rows 434 cols
[2024-05-31 22:41:24] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:41:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:41:32] [INFO ] Implicit Places using invariants and state equation in 7820 ms returned [321, 327, 348, 353, 374, 380, 402, 407, 426, 432]
[2024-05-31 22:41:32] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8125 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 432/476 places, 439/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 438
Applied a total of 2 rules in 18 ms. Remains 431 /432 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 431 cols
[2024-05-31 22:41:32] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:41:32] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 438 rows 431 cols
[2024-05-31 22:41:32] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:41:33] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:41:44] [INFO ] Implicit Places using invariants and state equation in 11976 ms returned [345, 350, 371, 377, 399, 404, 423, 429]
[2024-05-31 22:41:44] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12266 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 429/476 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 437
Applied a total of 2 rules in 15 ms. Remains 428 /429 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 428 cols
[2024-05-31 22:41:44] [INFO ] Computed 67 invariants in 46 ms
[2024-05-31 22:41:45] [INFO ] Implicit Places using invariants in 471 ms returned [368, 374, 396, 401, 420, 426]
[2024-05-31 22:41:45] [INFO ] Actually due to overlaps returned [374, 368]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 473 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 426/476 places, 437/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 437
Applied a total of 1 rules in 16 ms. Remains 426 /426 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 426 cols
[2024-05-31 22:41:45] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:41:45] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 437 rows 426 cols
[2024-05-31 22:41:45] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:41:45] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:41:51] [INFO ] Implicit Places using invariants and state equation in 6165 ms returned [394, 399, 418, 424]
[2024-05-31 22:41:51] [INFO ] Actually due to overlaps returned [399, 394]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6459 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 424/476 places, 437/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 436
Applied a total of 2 rules in 18 ms. Remains 423 /424 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 423 cols
[2024-05-31 22:41:51] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:41:52] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 436 rows 423 cols
[2024-05-31 22:41:52] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:41:52] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:42:07] [INFO ] Implicit Places using invariants and state equation in 14956 ms returned [415, 421]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15236 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 421/476 places, 436/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 435
Applied a total of 2 rules in 20 ms. Remains 420 /421 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 420 cols
[2024-05-31 22:42:07] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:42:07] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2024-05-31 22:42:07] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:42:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:42:17] [INFO ] Implicit Places using invariants and state equation in 10047 ms returned []
Implicit Place search using SMT with State Equation took 10328 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 420/476 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 189201 ms. Remains : 420/476 places, 435/453 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p1)]
Support contains 2 out of 1057 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 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 479 place count 816 transition count 717
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 556 transition count 533
Applied a total of 998 rules in 88 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-31 22:42:17] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:42:18] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 533 rows 556 cols
[2024-05-31 22:42:18] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:42:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:42:25] [INFO ] Implicit Places using invariants and state equation in 7873 ms returned []
Implicit Place search using SMT with State Equation took 8197 ms to find 0 implicit places.
[2024-05-31 22:42:25] [INFO ] Redundant transitions in 26 ms returned []
Running 532 sub problems to find dead transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-31 22:42:25] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:42:26] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (OVERLAPS) 533/1088 variables, 555/555 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1088 variables, 38/593 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 532 unsolved
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 30175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38499 ms. Remains : 556/1057 places, 533/997 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 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 53 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (5531 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3291 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 430429 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 430429 steps, saw 215285 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
// Phase 1: matrix 533 rows 556 cols
[2024-05-31 22:42:59] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 22:42:59] [INFO ] State equation strengthened by 38 read => feed constraints.
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, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/45 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/163 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 177/340 variables, 83/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 195/535 variables, 100/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 160/695 variables, 93/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/695 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 75/770 variables, 45/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/770 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 55/825 variables, 28/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/825 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 55/880 variables, 28/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/880 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/880 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 55/935 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/935 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/935 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 55/990 variables, 28/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/990 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/990 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 53/1043 variables, 28/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1043 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1043 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 38/1081 variables, 22/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1081 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/1089 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1089 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/1089 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1089/1089 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1000 ms.
Refiners :[State Equation: 556/556 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/45 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/163 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 177/340 variables, 83/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 195/535 variables, 100/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/695 variables, 93/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/695 variables, 8/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/695 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 75/770 variables, 45/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/770 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/770 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 55/825 variables, 28/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/825 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 55/880 variables, 28/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/880 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/880 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 55/935 variables, 28/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/935 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/935 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 55/990 variables, 28/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/990 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/990 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 53/1043 variables, 28/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1043 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1043 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 38/1081 variables, 22/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:01] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:43:01] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1081 variables, 20/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:43:05] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/1089 variables, and 610 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5009 ms.
Refiners :[State Equation: 548/556 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 23/23 constraints]
After SMT, in 6060ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 555 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 553 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 475 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions (Partial Free agglomeration) removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 240 place count 475 transition count 453
Applied a total of 240 rules in 45 ms. Remains 475 /556 variables (removed 81) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 475/556 places, 453/533 transitions.
RANDOM walk for 40000 steps (5109 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3346 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 460722 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 460722 steps, saw 230515 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 22:43:08] [INFO ] Computed 99 invariants in 36 ms
[2024-05-31 22:43:08] [INFO ] State equation strengthened by 77 read => feed constraints.
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) 212/214 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 238/452 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:08] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 3 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 121 places in 246 ms of which 2 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 3 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 3 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 3 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 3 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 3 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 128 places in 227 ms of which 3 ms to minimize.
[2024-05-31 22:43:11] [INFO ] Deduced a trap composed of 128 places in 241 ms of which 3 ms to minimize.
[2024-05-31 22:43:11] [INFO ] Deduced a trap composed of 121 places in 237 ms of which 3 ms to minimize.
[2024-05-31 22:43:11] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:43:11] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 2 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 133 places in 225 ms of which 3 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 124 places in 222 ms of which 2 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2024-05-31 22:43:13] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 2 ms to minimize.
[2024-05-31 22:43:13] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 2 ms to minimize.
[2024-05-31 22:43:13] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:13] [INFO ] Deduced a trap composed of 128 places in 240 ms of which 3 ms to minimize.
[2024-05-31 22:43:14] [INFO ] Deduced a trap composed of 130 places in 239 ms of which 2 ms to minimize.
[2024-05-31 22:43:14] [INFO ] Deduced a trap composed of 129 places in 239 ms of which 3 ms to minimize.
[2024-05-31 22:43:14] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:43:14] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2024-05-31 22:43:14] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-05-31 22:43:14] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 1 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 1 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 1 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 17/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/470 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 453/923 variables, 470/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 77/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/923 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/928 variables, 5/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/928 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 475/475 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 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) 212/214 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 238/452 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:17] [INFO ] Deduced a trap composed of 131 places in 230 ms of which 3 ms to minimize.
[2024-05-31 22:43:17] [INFO ] Deduced a trap composed of 137 places in 235 ms of which 2 ms to minimize.
[2024-05-31 22:43:17] [INFO ] Deduced a trap composed of 140 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 4 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 144 places in 242 ms of which 3 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 2 ms to minimize.
[2024-05-31 22:43:19] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 3 ms to minimize.
[2024-05-31 22:43:19] [INFO ] Deduced a trap composed of 135 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:43:19] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 2 ms to minimize.
[2024-05-31 22:43:19] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 5 ms to minimize.
[2024-05-31 22:43:20] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:43:20] [INFO ] Deduced a trap composed of 114 places in 224 ms of which 3 ms to minimize.
[2024-05-31 22:43:20] [INFO ] Deduced a trap composed of 118 places in 225 ms of which 3 ms to minimize.
[2024-05-31 22:43:20] [INFO ] Deduced a trap composed of 133 places in 237 ms of which 3 ms to minimize.
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 123 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 130 places in 220 ms of which 2 ms to minimize.
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 144 places in 225 ms of which 2 ms to minimize.
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 117 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:43:22] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:22] [INFO ] Deduced a trap composed of 143 places in 212 ms of which 2 ms to minimize.
[2024-05-31 22:43:22] [INFO ] Deduced a trap composed of 142 places in 222 ms of which 3 ms to minimize.
[2024-05-31 22:43:22] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 3 ms to minimize.
[2024-05-31 22:43:22] [INFO ] Deduced a trap composed of 132 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 128 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 141 places in 226 ms of which 3 ms to minimize.
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 3 ms to minimize.
[2024-05-31 22:43:24] [INFO ] Deduced a trap composed of 132 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:43:24] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 2 ms to minimize.
[2024-05-31 22:43:24] [INFO ] Deduced a trap composed of 98 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:43:24] [INFO ] Deduced a trap composed of 119 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:43:25] [INFO ] Deduced a trap composed of 146 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:43:25] [INFO ] Deduced a trap composed of 119 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:43:25] [INFO ] Deduced a trap composed of 99 places in 217 ms of which 3 ms to minimize.
[2024-05-31 22:43:25] [INFO ] Deduced a trap composed of 132 places in 227 ms of which 2 ms to minimize.
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 135 places in 230 ms of which 2 ms to minimize.
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 134 places in 222 ms of which 2 ms to minimize.
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 132 places in 221 ms of which 3 ms to minimize.
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 2 ms to minimize.
[2024-05-31 22:43:27] [INFO ] Deduced a trap composed of 130 places in 215 ms of which 2 ms to minimize.
[2024-05-31 22:43:27] [INFO ] Deduced a trap composed of 123 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:43:27] [INFO ] Deduced a trap composed of 128 places in 230 ms of which 3 ms to minimize.
[2024-05-31 22:43:27] [INFO ] Deduced a trap composed of 125 places in 217 ms of which 3 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 90 places in 237 ms of which 3 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 91 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 117 places in 234 ms of which 2 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 117 places in 231 ms of which 2 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 123 places in 238 ms of which 3 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 118 places in 246 ms of which 2 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 119 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 123 places in 223 ms of which 2 ms to minimize.
[2024-05-31 22:43:30] [INFO ] Deduced a trap composed of 128 places in 230 ms of which 2 ms to minimize.
[2024-05-31 22:43:30] [INFO ] Deduced a trap composed of 127 places in 231 ms of which 2 ms to minimize.
[2024-05-31 22:43:30] [INFO ] Deduced a trap composed of 105 places in 225 ms of which 2 ms to minimize.
[2024-05-31 22:43:30] [INFO ] Deduced a trap composed of 117 places in 226 ms of which 3 ms to minimize.
[2024-05-31 22:43:31] [INFO ] Deduced a trap composed of 124 places in 232 ms of which 3 ms to minimize.
[2024-05-31 22:43:31] [INFO ] Deduced a trap composed of 128 places in 224 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:31] [INFO ] Deduced a trap composed of 131 places in 239 ms of which 3 ms to minimize.
[2024-05-31 22:43:31] [INFO ] Deduced a trap composed of 134 places in 213 ms of which 2 ms to minimize.
[2024-05-31 22:43:32] [INFO ] Deduced a trap composed of 106 places in 239 ms of which 3 ms to minimize.
[2024-05-31 22:43:32] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
[2024-05-31 22:43:32] [INFO ] Deduced a trap composed of 132 places in 214 ms of which 3 ms to minimize.
[2024-05-31 22:43:32] [INFO ] Deduced a trap composed of 134 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:43:33] [INFO ] Deduced a trap composed of 122 places in 214 ms of which 3 ms to minimize.
[2024-05-31 22:43:33] [INFO ] Deduced a trap composed of 143 places in 212 ms of which 3 ms to minimize.
[2024-05-31 22:43:33] [INFO ] Deduced a trap composed of 141 places in 222 ms of which 2 ms to minimize.
[2024-05-31 22:43:33] [INFO ] Deduced a trap composed of 150 places in 223 ms of which 3 ms to minimize.
[2024-05-31 22:43:33] [INFO ] Deduced a trap composed of 152 places in 224 ms of which 3 ms to minimize.
[2024-05-31 22:43:34] [INFO ] Deduced a trap composed of 147 places in 221 ms of which 3 ms to minimize.
[2024-05-31 22:43:34] [INFO ] Deduced a trap composed of 129 places in 217 ms of which 2 ms to minimize.
[2024-05-31 22:43:34] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:43:34] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:43:35] [INFO ] Deduced a trap composed of 132 places in 225 ms of which 2 ms to minimize.
[2024-05-31 22:43:35] [INFO ] Deduced a trap composed of 136 places in 230 ms of which 2 ms to minimize.
[2024-05-31 22:43:35] [INFO ] Deduced a trap composed of 133 places in 238 ms of which 2 ms to minimize.
[2024-05-31 22:43:35] [INFO ] Deduced a trap composed of 145 places in 231 ms of which 2 ms to minimize.
[2024-05-31 22:43:36] [INFO ] Deduced a trap composed of 143 places in 224 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:36] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 2 ms to minimize.
[2024-05-31 22:43:36] [INFO ] Deduced a trap composed of 128 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:43:36] [INFO ] Deduced a trap composed of 120 places in 235 ms of which 2 ms to minimize.
[2024-05-31 22:43:37] [INFO ] Deduced a trap composed of 130 places in 232 ms of which 3 ms to minimize.
[2024-05-31 22:43:37] [INFO ] Deduced a trap composed of 145 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:43:37] [INFO ] Deduced a trap composed of 125 places in 234 ms of which 2 ms to minimize.
[2024-05-31 22:43:37] [INFO ] Deduced a trap composed of 128 places in 227 ms of which 3 ms to minimize.
[2024-05-31 22:43:38] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 2 ms to minimize.
[2024-05-31 22:43:38] [INFO ] Deduced a trap composed of 138 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:43:38] [INFO ] Deduced a trap composed of 147 places in 246 ms of which 2 ms to minimize.
[2024-05-31 22:43:38] [INFO ] Deduced a trap composed of 135 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:43:39] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 3 ms to minimize.
[2024-05-31 22:43:39] [INFO ] Deduced a trap composed of 152 places in 233 ms of which 3 ms to minimize.
[2024-05-31 22:43:39] [INFO ] Deduced a trap composed of 132 places in 235 ms of which 3 ms to minimize.
[2024-05-31 22:43:39] [INFO ] Deduced a trap composed of 134 places in 231 ms of which 2 ms to minimize.
[2024-05-31 22:43:40] [INFO ] Deduced a trap composed of 129 places in 227 ms of which 2 ms to minimize.
[2024-05-31 22:43:40] [INFO ] Deduced a trap composed of 142 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:43:40] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 2 ms to minimize.
[2024-05-31 22:43:40] [INFO ] Deduced a trap composed of 126 places in 228 ms of which 2 ms to minimize.
[2024-05-31 22:43:40] [INFO ] Deduced a trap composed of 170 places in 231 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:41] [INFO ] Deduced a trap composed of 149 places in 231 ms of which 2 ms to minimize.
[2024-05-31 22:43:41] [INFO ] Deduced a trap composed of 122 places in 241 ms of which 2 ms to minimize.
[2024-05-31 22:43:41] [INFO ] Deduced a trap composed of 132 places in 231 ms of which 3 ms to minimize.
[2024-05-31 22:43:41] [INFO ] Deduced a trap composed of 146 places in 228 ms of which 3 ms to minimize.
[2024-05-31 22:43:42] [INFO ] Deduced a trap composed of 134 places in 214 ms of which 2 ms to minimize.
[2024-05-31 22:43:42] [INFO ] Deduced a trap composed of 134 places in 235 ms of which 3 ms to minimize.
[2024-05-31 22:43:42] [INFO ] Deduced a trap composed of 142 places in 243 ms of which 3 ms to minimize.
[2024-05-31 22:43:42] [INFO ] Deduced a trap composed of 142 places in 212 ms of which 3 ms to minimize.
[2024-05-31 22:43:43] [INFO ] Deduced a trap composed of 133 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:43:43] [INFO ] Deduced a trap composed of 108 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:43:43] [INFO ] Deduced a trap composed of 135 places in 216 ms of which 3 ms to minimize.
[2024-05-31 22:43:43] [INFO ] Deduced a trap composed of 135 places in 217 ms of which 2 ms to minimize.
[2024-05-31 22:43:44] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 3 ms to minimize.
[2024-05-31 22:43:44] [INFO ] Deduced a trap composed of 102 places in 216 ms of which 2 ms to minimize.
[2024-05-31 22:43:44] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 3 ms to minimize.
[2024-05-31 22:43:44] [INFO ] Deduced a trap composed of 142 places in 227 ms of which 2 ms to minimize.
[2024-05-31 22:43:45] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 2 ms to minimize.
[2024-05-31 22:43:45] [INFO ] Deduced a trap composed of 147 places in 227 ms of which 4 ms to minimize.
[2024-05-31 22:43:45] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 2 ms to minimize.
[2024-05-31 22:43:45] [INFO ] Deduced a trap composed of 139 places in 224 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:45] [INFO ] Deduced a trap composed of 144 places in 225 ms of which 3 ms to minimize.
[2024-05-31 22:43:46] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 2 ms to minimize.
[2024-05-31 22:43:46] [INFO ] Deduced a trap composed of 144 places in 234 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/470 variables, 7/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:46] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 2 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 3 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 128 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 3 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 3 ms to minimize.
[2024-05-31 22:43:48] [INFO ] Deduced a trap composed of 135 places in 229 ms of which 3 ms to minimize.
[2024-05-31 22:43:48] [INFO ] Deduced a trap composed of 119 places in 240 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/470 variables, 7/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/470 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 453/923 variables, 470/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/923 variables, 77/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/923 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/923 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/928 variables, 5/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/928 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/928 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/928 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 819 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 475/475 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 167/167 constraints]
After SMT, in 43056ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3317 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2024-05-31 22:43:54] [INFO ] Invariant cache hit.
[2024-05-31 22:43:56] [INFO ] Implicit Places using invariants in 1458 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
[2024-05-31 22:43:56] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1459 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 452
Applied a total of 2 rules in 20 ms. Remains 472 /473 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 472 cols
[2024-05-31 22:43:56] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:43:56] [INFO ] Implicit Places using invariants in 470 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2024-05-31 22:43:56] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 22:43:57] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:44:06] [INFO ] Implicit Places using invariants and state equation in 9624 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 279, 284, 304, 309, 330, 335, 356, 362, 383, 385, 389, 410, 416, 438, 443, 447, 464, 470]
[2024-05-31 22:44:06] [INFO ] Actually due to overlaps returned [447, 385]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10100 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 451
Applied a total of 2 rules in 23 ms. Remains 469 /470 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 469 cols
[2024-05-31 22:44:06] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:44:06] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 451 rows 469 cols
[2024-05-31 22:44:06] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:44:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:44:19] [INFO ] Implicit Places using invariants and state equation in 12863 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 409, 415, 437, 442, 461, 467]
[2024-05-31 22:44:19] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13324 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 450
Applied a total of 2 rules in 18 ms. Remains 466 /467 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 466 cols
[2024-05-31 22:44:19] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:44:20] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-31 22:44:20] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 22:44:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:44:29] [INFO ] Implicit Places using invariants and state equation in 9643 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 406, 412, 434, 439, 458, 464]
[2024-05-31 22:44:29] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10086 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 449
Applied a total of 2 rules in 24 ms. Remains 463 /464 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 463 cols
[2024-05-31 22:44:29] [INFO ] Computed 91 invariants in 48 ms
[2024-05-31 22:44:30] [INFO ] Implicit Places using invariants in 1037 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 403, 409, 431, 436, 455, 461]
[2024-05-31 22:44:30] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1038 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 448
Applied a total of 2 rules in 20 ms. Remains 460 /461 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 460 cols
[2024-05-31 22:44:31] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:44:31] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 448 rows 460 cols
[2024-05-31 22:44:31] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:44:31] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:44:42] [INFO ] Implicit Places using invariants and state equation in 11576 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 270, 275, 295, 300, 321, 326, 347, 353, 374, 379, 400, 406, 428, 433, 452, 458]
[2024-05-31 22:44:42] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11975 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 447
Applied a total of 2 rules in 16 ms. Remains 457 /458 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 457 cols
[2024-05-31 22:44:43] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:44:43] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 447 rows 457 cols
[2024-05-31 22:44:43] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 22:44:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:44:51] [INFO ] Implicit Places using invariants and state equation in 7616 ms returned [134, 139, 159, 164, 185, 191, 210, 215, 238, 244, 267, 272, 292, 297, 318, 323, 344, 350, 371, 376, 397, 403, 425, 430, 449, 455]
[2024-05-31 22:44:51] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8021 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 446
Applied a total of 2 rules in 22 ms. Remains 454 /455 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 454 cols
[2024-05-31 22:44:51] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:44:51] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 446 rows 454 cols
[2024-05-31 22:44:51] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:44:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:45:01] [INFO ] Implicit Places using invariants and state equation in 9935 ms returned [156, 161, 182, 188, 207, 212, 235, 241, 264, 269, 289, 294, 315, 320, 341, 347, 368, 373, 394, 400, 422, 427, 446, 452]
[2024-05-31 22:45:01] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10290 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 445
Applied a total of 2 rules in 23 ms. Remains 451 /452 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 451 cols
[2024-05-31 22:45:01] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:45:01] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 445 rows 451 cols
[2024-05-31 22:45:01] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:45:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:45:08] [INFO ] Implicit Places using invariants and state equation in 6937 ms returned [179, 185, 204, 209, 232, 238, 261, 266, 286, 291, 312, 317, 338, 344, 365, 370, 391, 397, 419, 424, 443, 449]
[2024-05-31 22:45:08] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7278 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 444
Applied a total of 2 rules in 20 ms. Remains 448 /449 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 448 cols
[2024-05-31 22:45:08] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 22:45:08] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 444 rows 448 cols
[2024-05-31 22:45:08] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 22:45:09] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:45:23] [INFO ] Implicit Places using invariants and state equation in 14905 ms returned [201, 206, 229, 235, 258, 263, 283, 288, 309, 314, 335, 341, 362, 367, 388, 394, 416, 421, 440, 446]
[2024-05-31 22:45:23] [INFO ] Actually due to overlaps returned [206, 201]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15233 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 443
Applied a total of 2 rules in 15 ms. Remains 445 /446 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 445 cols
[2024-05-31 22:45:23] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:45:24] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 443 rows 445 cols
[2024-05-31 22:45:24] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:45:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:45:31] [INFO ] Implicit Places using invariants and state equation in 7730 ms returned [226, 232, 255, 260, 280, 285, 306, 311, 332, 338, 359, 364, 385, 391, 413, 418, 437, 443]
[2024-05-31 22:45:31] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8050 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 443/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 442
Applied a total of 2 rules in 16 ms. Remains 442 /443 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 442 cols
[2024-05-31 22:45:32] [INFO ] Computed 77 invariants in 60 ms
[2024-05-31 22:45:32] [INFO ] Implicit Places using invariants in 623 ms returned [252, 257, 277, 282, 303, 308, 329, 335, 356, 361, 382, 388, 410, 415, 434, 440]
[2024-05-31 22:45:32] [INFO ] Actually due to overlaps returned [257, 252]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 625 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 442/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 441
Applied a total of 2 rules in 19 ms. Remains 439 /440 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 439 cols
[2024-05-31 22:45:32] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:45:32] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 441 rows 439 cols
[2024-05-31 22:45:32] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:45:33] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:45:38] [INFO ] Implicit Places using invariants and state equation in 5604 ms returned [274, 279, 300, 305, 326, 332, 353, 358, 379, 385, 407, 412, 431, 437]
[2024-05-31 22:45:38] [INFO ] Actually due to overlaps returned [279, 274]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5936 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 440
Applied a total of 2 rules in 20 ms. Remains 436 /437 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 436 cols
[2024-05-31 22:45:38] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:45:38] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 440 rows 436 cols
[2024-05-31 22:45:38] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:45:39] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:45:50] [INFO ] Implicit Places using invariants and state equation in 11670 ms returned [297, 302, 323, 329, 350, 355, 376, 382, 404, 409, 428, 434]
[2024-05-31 22:45:50] [INFO ] Actually due to overlaps returned [302, 297]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11987 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 439
Applied a total of 2 rules in 19 ms. Remains 433 /434 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 433 cols
[2024-05-31 22:45:50] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:45:50] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 439 rows 433 cols
[2024-05-31 22:45:50] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:45:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:46:02] [INFO ] Implicit Places using invariants and state equation in 11506 ms returned [320, 326, 347, 352, 373, 379, 401, 406, 425, 431]
[2024-05-31 22:46:02] [INFO ] Actually due to overlaps returned [326, 320]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11811 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 439/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 438
Applied a total of 2 rules in 16 ms. Remains 430 /431 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 430 cols
[2024-05-31 22:46:02] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:46:02] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 438 rows 430 cols
[2024-05-31 22:46:02] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:46:02] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:46:10] [INFO ] Implicit Places using invariants and state equation in 7377 ms returned [344, 349, 370, 376, 398, 403, 422, 428]
[2024-05-31 22:46:10] [INFO ] Actually due to overlaps returned [349, 344]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7690 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 437
Applied a total of 2 rules in 20 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 427 cols
[2024-05-31 22:46:10] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 22:46:10] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 437 rows 427 cols
[2024-05-31 22:46:10] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 22:46:10] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:46:15] [INFO ] Implicit Places using invariants and state equation in 5552 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-31 22:46:15] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5868 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 437/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 437
Applied a total of 1 rules in 19 ms. Remains 425 /425 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 425 cols
[2024-05-31 22:46:16] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:46:16] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 437 rows 425 cols
[2024-05-31 22:46:16] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:46:16] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:46:27] [INFO ] Implicit Places using invariants and state equation in 11256 ms returned [393, 398, 417, 423]
[2024-05-31 22:46:27] [INFO ] Actually due to overlaps returned [398, 393]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11561 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 423/475 places, 437/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 423 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 422 transition count 436
Applied a total of 2 rules in 21 ms. Remains 422 /423 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 422 cols
[2024-05-31 22:46:27] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 22:46:27] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 436 rows 422 cols
[2024-05-31 22:46:27] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:46:28] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:46:37] [INFO ] Implicit Places using invariants and state equation in 9602 ms returned [414, 420]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9903 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 420/475 places, 436/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 420 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 419 transition count 435
Applied a total of 2 rules in 15 ms. Remains 419 /420 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 419 cols
[2024-05-31 22:46:37] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:46:37] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2024-05-31 22:46:37] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:46:38] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:46:53] [INFO ] Implicit Places using invariants and state equation in 15445 ms returned []
Implicit Place search using SMT with State Equation took 15748 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 178363 ms. Remains : 419/475 places, 435/453 transitions.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 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 65 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 13877 reset in 123 ms.
Product exploration explored 100000 steps with 13793 reset in 121 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 556 transition count 531
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 554 transition count 531
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 2 with 2 rules applied. Total rules applied 6 place count 553 transition count 531
Applied a total of 6 rules in 19 ms. Remains 553 /556 variables (removed 3) and now considering 531/533 (removed 2) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:46:53] [INFO ] Computed 99 invariants in 49 ms
[2024-05-31 22:46:54] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 22:46:54] [INFO ] Invariant cache hit.
[2024-05-31 22:46:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:47:01] [INFO ] Implicit Places using invariants and state equation in 7654 ms returned []
Implicit Place search using SMT with State Equation took 7970 ms to find 0 implicit places.
[2024-05-31 22:47:01] [INFO ] Redundant transitions in 14 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-31 22:47:01] [INFO ] Invariant cache hit.
[2024-05-31 22:47:01] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1084 variables, and 689 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 527/1216 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1084 variables, and 1216 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 553/556 places, 531/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68134 ms. Remains : 553/556 places, 531/533 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 707279 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)&&F(G(p1))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 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 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 817 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 481 place count 815 transition count 755
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 481 place count 815 transition count 714
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 999 place count 556 transition count 533
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 556 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1001 place count 555 transition count 532
Applied a total of 1001 rules in 96 ms. Remains 555 /1057 variables (removed 502) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 555 cols
[2024-05-31 22:48:02] [INFO ] Computed 99 invariants in 40 ms
[2024-05-31 22:48:02] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-31 22:48:02] [INFO ] Invariant cache hit.
[2024-05-31 22:48:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 22:48:15] [INFO ] Implicit Places using invariants and state equation in 13103 ms returned []
Implicit Place search using SMT with State Equation took 13430 ms to find 0 implicit places.
[2024-05-31 22:48:15] [INFO ] Redundant transitions in 4 ms returned []
Running 531 sub problems to find dead transitions.
[2024-05-31 22:48:15] [INFO ] Invariant cache hit.
[2024-05-31 22:48:15] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 532/1086 variables, 554/653 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 37/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
SMT process timed out in 30105ms, After SMT, problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 30110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 555/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43654 ms. Remains : 555/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-01 finished in 43777 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)&&(X((!p0||G(p1)))||F(p2))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 34 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:48:46] [INFO ] Invariants computation overflowed in 97 ms
[2024-05-31 22:48:46] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:48:46] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-31 22:49:00] [INFO ] Implicit Places using invariants and state equation in 13877 ms returned []
Implicit Place search using SMT with State Equation took 14258 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:49:00] [INFO ] Invariants computation overflowed in 99 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30031 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30032 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60300ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Finished structural reductions in LTL mode , in 1 iterations and 74602 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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 : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-03 finished in 75543 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 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 815 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 483 place count 814 transition count 714
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 927 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1003 place count 554 transition count 532
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1004 place count 554 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1005 place count 553 transition count 531
Applied a total of 1005 rules in 83 ms. Remains 553 /1057 variables (removed 504) and now considering 531/997 (removed 466) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:50:01] [INFO ] Computed 99 invariants in 47 ms
[2024-05-31 22:50:01] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-31 22:50:01] [INFO ] Invariant cache hit.
[2024-05-31 22:50:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:50:11] [INFO ] Implicit Places using invariants and state equation in 9874 ms returned []
Implicit Place search using SMT with State Equation took 10205 ms to find 0 implicit places.
[2024-05-31 22:50:11] [INFO ] Redundant transitions in 5 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-31 22:50:11] [INFO ] Invariant cache hit.
[2024-05-31 22:50:11] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
SMT process timed out in 30094ms, After SMT, problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 30103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 553/1057 places, 531/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40412 ms. Remains : 553/1057 places, 531/997 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04
Product exploration explored 100000 steps with 14031 reset in 120 ms.
Product exploration explored 100000 steps with 13953 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 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 73 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 (5525 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3188 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 433309 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 433309 steps, saw 216724 distinct states, run finished after 3003 ms. (steps per millisecond=144 ) properties seen :0
[2024-05-31 22:50:45] [INFO ] Invariant cache hit.
[2024-05-31 22:50:45] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 204/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 216/424 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/482 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/496 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 521/1017 variables, 496/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1017 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/1078 variables, 52/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1078 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1080 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1080 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1080 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1084 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1084 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1084 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/553 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 204/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/424 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/482 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:50:46] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/496 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 521/1017 variables, 496/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 36/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1017 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1084 variables, and 680 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1443 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 548/553 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2112ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 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 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 36 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 480/553 places, 458/531 transitions.
RANDOM walk for 40000 steps (4990 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3410 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 451021 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 451021 steps, saw 225628 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
// Phase 1: matrix 458 rows 480 cols
[2024-05-31 22:50:50] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:50:50] [INFO ] State equation strengthened by 78 read => feed constraints.
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) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 177/191 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 534/725 variables, 264/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 47/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/938 variables, 172/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/938 variables, 30/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/938 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1773 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 78/78 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/191 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 534/725 variables, 264/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 47/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 213/938 variables, 172/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 30/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/938 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1067 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2881ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 413 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2024-05-31 22:50:53] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:50:54] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2024-05-31 22:50:54] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:50:54] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:09] [INFO ] Implicit Places using invariants and state equation in 14929 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 152, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 338, 343, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
[2024-05-31 22:51:09] [INFO ] Actually due to overlaps returned [343, 214, 180, 152, 175, 338]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 15200 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 474 transition count 455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 471 transition count 455
Applied a total of 6 rules in 18 ms. Remains 471 /474 variables (removed 3) and now considering 455/458 (removed 3) transitions.
// Phase 1: matrix 455 rows 471 cols
[2024-05-31 22:51:09] [INFO ] Computed 93 invariants in 75 ms
[2024-05-31 22:51:09] [INFO ] Implicit Places using invariants in 530 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 197, 203, 222, 227, 250, 256, 278, 283, 304, 356, 362, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2024-05-31 22:51:09] [INFO ] Actually due to overlaps returned [362, 446, 203, 197, 356, 385]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 531 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 465/480 places, 455/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 465 transition count 452
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 462 transition count 452
Applied a total of 6 rules in 15 ms. Remains 462 /465 variables (removed 3) and now considering 452/455 (removed 3) transitions.
// Phase 1: matrix 452 rows 462 cols
[2024-05-31 22:51:09] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 22:51:09] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 452 rows 462 cols
[2024-05-31 22:51:09] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:51:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:14] [INFO ] Implicit Places using invariants and state equation in 4567 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 219, 224, 247, 253, 275, 280, 301, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-31 22:51:14] [INFO ] Actually due to overlaps returned [382, 48, 224, 42, 219, 377]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 4827 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 456/480 places, 452/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 456 transition count 449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 453 transition count 449
Applied a total of 6 rules in 17 ms. Remains 453 /456 variables (removed 3) and now considering 449/452 (removed 3) transitions.
// Phase 1: matrix 449 rows 453 cols
[2024-05-31 22:51:14] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:51:14] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 449 rows 453 cols
[2024-05-31 22:51:14] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:51:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:21] [INFO ] Implicit Places using invariants and state equation in 6683 ms returned [65, 70, 91, 96, 116, 122, 241, 247, 269, 274, 295, 393, 399, 421, 426, 445, 451]
[2024-05-31 22:51:21] [INFO ] Actually due to overlaps returned [399, 70, 247, 65, 241, 393]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 6933 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 447/480 places, 449/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 447 transition count 446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 446
Applied a total of 6 rules in 14 ms. Remains 444 /447 variables (removed 3) and now considering 446/449 (removed 3) transitions.
// Phase 1: matrix 446 rows 444 cols
[2024-05-31 22:51:21] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:51:21] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 446 rows 444 cols
[2024-05-31 22:51:21] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 22:51:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:25] [INFO ] Implicit Places using invariants and state equation in 4348 ms returned [88, 93, 113, 119, 263, 268, 289, 412, 417, 436, 442]
[2024-05-31 22:51:25] [INFO ] Actually due to overlaps returned [417, 93, 268, 88, 263, 412]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 4581 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 438/480 places, 446/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 438 transition count 443
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 435 transition count 443
Applied a total of 6 rules in 14 ms. Remains 435 /438 variables (removed 3) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 435 cols
[2024-05-31 22:51:26] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:51:26] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 443 rows 435 cols
[2024-05-31 22:51:26] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:51:26] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:30] [INFO ] Implicit Places using invariants and state equation in 4580 ms returned [110, 116, 283, 427, 433]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 4822 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 430/480 places, 443/458 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 430 transition count 441
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 428 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 428 transition count 441
Applied a total of 5 rules in 24 ms. Remains 428 /430 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 428 cols
[2024-05-31 22:51:30] [INFO ] Computed 64 invariants in 38 ms
[2024-05-31 22:51:31] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-31 22:51:31] [INFO ] Invariant cache hit.
[2024-05-31 22:51:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:37] [INFO ] Implicit Places using invariants and state equation in 6035 ms returned []
Implicit Place search using SMT with State Equation took 6343 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 428/480 places, 441/458 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 43348 ms. Remains : 428/480 places, 441/458 transitions.
RANDOM walk for 40000 steps (5762 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3665 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 486313 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 486313 steps, saw 243201 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-31 22:51:40] [INFO ] Invariant cache hit.
[2024-05-31 22:51:40] [INFO ] State equation strengthened by 78 read => feed constraints.
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) 70/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 269/343 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/419 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 2 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 3 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/423 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 441/864 variables, 423/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/864 variables, 78/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/864 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/869 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/869 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 869/869 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3319 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 70/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 269/343 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:51:43] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 76/419 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:51:43] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 4 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/423 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 441/864 variables, 423/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/864 variables, 78/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/864 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/864 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/869 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/869 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/869 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/869 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 869/869 variables, and 600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 4567ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 338 ms.
Support contains 4 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 7 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 428/428 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-31 22:51:45] [INFO ] Invariant cache hit.
[2024-05-31 22:51:45] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-31 22:51:45] [INFO ] Invariant cache hit.
[2024-05-31 22:51:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:51:51] [INFO ] Implicit Places using invariants and state equation in 5995 ms returned []
Implicit Place search using SMT with State Equation took 6260 ms to find 0 implicit places.
[2024-05-31 22:51:51] [INFO ] Redundant transitions in 4 ms returned []
Running 440 sub problems to find dead transitions.
[2024-05-31 22:51:51] [INFO ] Invariant cache hit.
[2024-05-31 22:51:51] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:52:00] [INFO ] Deduced a trap composed of 160 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:52:00] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 196 places in 112 ms of which 3 ms to minimize.
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 196 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 2 ms to minimize.
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 174 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:52:02] [INFO ] Deduced a trap composed of 148 places in 126 ms of which 3 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 175 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 167 places in 121 ms of which 2 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 171 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 167 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 192 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 187 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:52:04] [INFO ] Deduced a trap composed of 168 places in 125 ms of which 2 ms to minimize.
[2024-05-31 22:52:07] [INFO ] Deduced a trap composed of 174 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:52:07] [INFO ] Deduced a trap composed of 193 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:52:07] [INFO ] Deduced a trap composed of 173 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:52:07] [INFO ] Deduced a trap composed of 187 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:52:07] [INFO ] Deduced a trap composed of 184 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 165 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 154 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 160 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 188 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 171 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 146 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 154 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 185 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 176 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 4 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 144 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 124 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 173 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 177 places in 102 ms of which 1 ms to minimize.
[2024-05-31 22:52:11] [INFO ] Deduced a trap composed of 175 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:52:14] [INFO ] Deduced a trap composed of 157 places in 102 ms of which 1 ms to minimize.
[2024-05-31 22:52:14] [INFO ] Deduced a trap composed of 154 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:52:14] [INFO ] Deduced a trap composed of 152 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:52:18] [INFO ] Deduced a trap composed of 183 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:52:19] [INFO ] Deduced a trap composed of 182 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:52:19] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:52:20] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:20] [INFO ] Deduced a trap composed of 173 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:52:20] [INFO ] Deduced a trap composed of 182 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:52:20] [INFO ] Deduced a trap composed of 174 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:52:21] [INFO ] Deduced a trap composed of 183 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:52:21] [INFO ] Deduced a trap composed of 183 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/869 variables, and 113 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 0/428 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 49/113 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:52:30] [INFO ] Deduced a trap composed of 194 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:52:30] [INFO ] Deduced a trap composed of 197 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:52:30] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:30] [INFO ] Deduced a trap composed of 193 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 174 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 193 places in 125 ms of which 2 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 167 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 168 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 173 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 171 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 139 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 181 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 181 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 186 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 187 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 179 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 180 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 174 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 173 places in 111 ms of which 1 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 182 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 173 places in 114 ms of which 1 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 2 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 2 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 2 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 5 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 117 places in 145 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 3 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:52:38] [INFO ] Deduced a trap composed of 197 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:39] [INFO ] Deduced a trap composed of 190 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 191 places in 111 ms of which 1 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 195 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 199 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 148 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 201 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 199 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 146 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 167 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 189 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 193 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Deduced a trap composed of 190 places in 100 ms of which 1 ms to minimize.
[2024-05-31 22:52:42] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:52:42] [INFO ] Deduced a trap composed of 193 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:52:45] [INFO ] Deduced a trap composed of 181 places in 120 ms of which 6 ms to minimize.
[2024-05-31 22:52:46] [INFO ] Deduced a trap composed of 210 places in 107 ms of which 1 ms to minimize.
[2024-05-31 22:52:46] [INFO ] Deduced a trap composed of 210 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:52:47] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:52:47] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:52:47] [INFO ] Deduced a trap composed of 198 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:52:47] [INFO ] Deduced a trap composed of 195 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:52:49] [INFO ] Deduced a trap composed of 155 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:52:49] [INFO ] Deduced a trap composed of 183 places in 103 ms of which 1 ms to minimize.
[2024-05-31 22:52:49] [INFO ] Deduced a trap composed of 156 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:52:49] [INFO ] Deduced a trap composed of 183 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:52:49] [INFO ] Deduced a trap composed of 149 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:52:50] [INFO ] Deduced a trap composed of 148 places in 106 ms of which 1 ms to minimize.
[2024-05-31 22:52:50] [INFO ] Deduced a trap composed of 157 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:52:50] [INFO ] Deduced a trap composed of 189 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:52:50] [INFO ] Deduced a trap composed of 156 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:52:50] [INFO ] Deduced a trap composed of 185 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:52:50] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:52:50] [INFO ] Deduced a trap composed of 139 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:52:50] [INFO ] Deduced a trap composed of 130 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:52:51] [INFO ] Deduced a trap composed of 173 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:52:51] [INFO ] Deduced a trap composed of 170 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/869 variables, and 192 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 0/428 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 0/440 constraints, Known Traps: 128/128 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66471 ms. Remains : 428/428 places, 441/441 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 12 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:52:51] [INFO ] Computed 99 invariants in 48 ms
[2024-05-31 22:52:52] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-31 22:52:52] [INFO ] Invariant cache hit.
[2024-05-31 22:52:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:53:00] [INFO ] Implicit Places using invariants and state equation in 8772 ms returned []
Implicit Place search using SMT with State Equation took 9078 ms to find 0 implicit places.
[2024-05-31 22:53:00] [INFO ] Redundant transitions in 2 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-31 22:53:00] [INFO ] Invariant cache hit.
[2024-05-31 22:53:00] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 30106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39204 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 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 61 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 (5518 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3304 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 434028 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 434028 steps, saw 217087 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2024-05-31 22:53:34] [INFO ] Invariant cache hit.
[2024-05-31 22:53:34] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 204/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 216/424 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/482 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/496 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 521/1017 variables, 496/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1017 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/1078 variables, 52/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1078 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1080 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1080 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1080 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1084 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1084 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1084 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/553 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 204/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/424 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/482 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/496 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 521/1017 variables, 496/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 36/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1017 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1084 variables, and 680 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1419 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 548/553 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2094ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 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 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 34 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 480/553 places, 458/531 transitions.
RANDOM walk for 40000 steps (5057 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3409 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 450028 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 450028 steps, saw 225133 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
// Phase 1: matrix 458 rows 480 cols
[2024-05-31 22:53:39] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:53:39] [INFO ] State equation strengthened by 78 read => feed constraints.
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) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 177/191 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 534/725 variables, 264/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 47/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/938 variables, 172/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/938 variables, 30/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/938 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1736 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 78/78 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/191 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 534/725 variables, 264/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 47/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 213/938 variables, 172/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 30/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/938 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1071 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2846ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 412 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2024-05-31 22:53:42] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:53:42] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2024-05-31 22:53:42] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 22:53:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:53:57] [INFO ] Implicit Places using invariants and state equation in 14910 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 152, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 338, 343, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
[2024-05-31 22:53:57] [INFO ] Actually due to overlaps returned [343, 214, 180, 152, 175, 338]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 15178 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 474 transition count 455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 471 transition count 455
Applied a total of 6 rules in 16 ms. Remains 471 /474 variables (removed 3) and now considering 455/458 (removed 3) transitions.
// Phase 1: matrix 455 rows 471 cols
[2024-05-31 22:53:57] [INFO ] Computed 93 invariants in 78 ms
[2024-05-31 22:53:58] [INFO ] Implicit Places using invariants in 539 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 197, 203, 222, 227, 250, 256, 278, 283, 304, 356, 362, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2024-05-31 22:53:58] [INFO ] Actually due to overlaps returned [362, 446, 203, 197, 356, 385]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 541 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 465/480 places, 455/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 465 transition count 452
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 462 transition count 452
Applied a total of 6 rules in 15 ms. Remains 462 /465 variables (removed 3) and now considering 452/455 (removed 3) transitions.
// Phase 1: matrix 452 rows 462 cols
[2024-05-31 22:53:58] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:53:58] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 452 rows 462 cols
[2024-05-31 22:53:58] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:53:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:03] [INFO ] Implicit Places using invariants and state equation in 4577 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 219, 224, 247, 253, 275, 280, 301, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-31 22:54:03] [INFO ] Actually due to overlaps returned [382, 48, 224, 42, 219, 377]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 4839 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 456/480 places, 452/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 456 transition count 449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 453 transition count 449
Applied a total of 6 rules in 18 ms. Remains 453 /456 variables (removed 3) and now considering 449/452 (removed 3) transitions.
// Phase 1: matrix 449 rows 453 cols
[2024-05-31 22:54:03] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 22:54:03] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 449 rows 453 cols
[2024-05-31 22:54:03] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 22:54:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:10] [INFO ] Implicit Places using invariants and state equation in 6791 ms returned [65, 70, 91, 96, 116, 122, 241, 247, 269, 274, 295, 393, 399, 421, 426, 445, 451]
[2024-05-31 22:54:10] [INFO ] Actually due to overlaps returned [399, 70, 247, 65, 241, 393]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 7065 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 447/480 places, 449/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 447 transition count 446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 446
Applied a total of 6 rules in 15 ms. Remains 444 /447 variables (removed 3) and now considering 446/449 (removed 3) transitions.
// Phase 1: matrix 446 rows 444 cols
[2024-05-31 22:54:10] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:54:10] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 446 rows 444 cols
[2024-05-31 22:54:10] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 22:54:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:14] [INFO ] Implicit Places using invariants and state equation in 4479 ms returned [88, 93, 113, 119, 263, 268, 289, 412, 417, 436, 442]
[2024-05-31 22:54:14] [INFO ] Actually due to overlaps returned [417, 93, 268, 88, 263, 412]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 4709 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 438/480 places, 446/458 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 438 transition count 443
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 435 transition count 443
Applied a total of 6 rules in 13 ms. Remains 435 /438 variables (removed 3) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 435 cols
[2024-05-31 22:54:14] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:54:15] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 443 rows 435 cols
[2024-05-31 22:54:15] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 22:54:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:19] [INFO ] Implicit Places using invariants and state equation in 4454 ms returned [110, 116, 283, 427, 433]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 4694 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 430/480 places, 443/458 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 430 transition count 441
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 428 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 428 transition count 441
Applied a total of 5 rules in 24 ms. Remains 428 /430 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 428 cols
[2024-05-31 22:54:19] [INFO ] Computed 64 invariants in 38 ms
[2024-05-31 22:54:19] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-31 22:54:19] [INFO ] Invariant cache hit.
[2024-05-31 22:54:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:25] [INFO ] Implicit Places using invariants and state equation in 5957 ms returned []
Implicit Place search using SMT with State Equation took 6263 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 428/480 places, 441/458 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 43401 ms. Remains : 428/480 places, 441/458 transitions.
RANDOM walk for 40000 steps (5710 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3559 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 480725 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 480725 steps, saw 240410 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-05-31 22:54:28] [INFO ] Invariant cache hit.
[2024-05-31 22:54:28] [INFO ] State equation strengthened by 78 read => feed constraints.
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) 70/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 269/343 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 3 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 3 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/419 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 3 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/423 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 441/864 variables, 423/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/864 variables, 78/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/864 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/869 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/869 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 869/869 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3385 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 70/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 269/343 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 76/419 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 5 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/423 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 441/864 variables, 423/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/864 variables, 78/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/864 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/864 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/869 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/869 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/869 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/869 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 869/869 variables, and 600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 4937ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 333 ms.
Support contains 4 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 428/428 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-31 22:54:34] [INFO ] Invariant cache hit.
[2024-05-31 22:54:34] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-31 22:54:34] [INFO ] Invariant cache hit.
[2024-05-31 22:54:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 22:54:40] [INFO ] Implicit Places using invariants and state equation in 5994 ms returned []
Implicit Place search using SMT with State Equation took 6260 ms to find 0 implicit places.
[2024-05-31 22:54:40] [INFO ] Redundant transitions in 3 ms returned []
Running 440 sub problems to find dead transitions.
[2024-05-31 22:54:40] [INFO ] Invariant cache hit.
[2024-05-31 22:54:40] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 160 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 196 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 196 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 132 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 174 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 148 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 175 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 167 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 171 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 149 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 167 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 192 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 187 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 168 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 174 places in 108 ms of which 1 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 193 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 173 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 187 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 184 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 154 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 160 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 188 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 171 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 146 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 154 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 185 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 176 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 140 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 144 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 173 places in 117 ms of which 1 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 177 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 175 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 157 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:55:04] [INFO ] Deduced a trap composed of 154 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:55:04] [INFO ] Deduced a trap composed of 152 places in 106 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:55:08] [INFO ] Deduced a trap composed of 183 places in 119 ms of which 2 ms to minimize.
[2024-05-31 22:55:08] [INFO ] Deduced a trap composed of 182 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 1 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 143 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 173 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 182 places in 115 ms of which 1 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 174 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 183 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 183 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/869 variables, and 113 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 0/428 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 49/113 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:55:19] [INFO ] Deduced a trap composed of 194 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:55:19] [INFO ] Deduced a trap composed of 197 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:55:20] [INFO ] Deduced a trap composed of 147 places in 98 ms of which 1 ms to minimize.
[2024-05-31 22:55:20] [INFO ] Deduced a trap composed of 193 places in 101 ms of which 1 ms to minimize.
[2024-05-31 22:55:20] [INFO ] Deduced a trap composed of 174 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:55:20] [INFO ] Deduced a trap composed of 193 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:55:20] [INFO ] Deduced a trap composed of 167 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 168 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 173 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 171 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 181 places in 104 ms of which 1 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 181 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 186 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 187 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:55:22] [INFO ] Deduced a trap composed of 179 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:55:22] [INFO ] Deduced a trap composed of 180 places in 109 ms of which 1 ms to minimize.
[2024-05-31 22:55:22] [INFO ] Deduced a trap composed of 174 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:55:22] [INFO ] Deduced a trap composed of 173 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:55:22] [INFO ] Deduced a trap composed of 182 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:55:23] [INFO ] Deduced a trap composed of 173 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:55:24] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:55:24] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 4 ms to minimize.
[2024-05-31 22:55:24] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:55:24] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:55:24] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 2 ms to minimize.
[2024-05-31 22:55:25] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:55:25] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 3 ms to minimize.
[2024-05-31 22:55:25] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:55:25] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
[2024-05-31 22:55:25] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 2 ms to minimize.
[2024-05-31 22:55:25] [INFO ] Deduced a trap composed of 117 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 2 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 2 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 197 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 190 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:55:29] [INFO ] Deduced a trap composed of 191 places in 101 ms of which 1 ms to minimize.
[2024-05-31 22:55:29] [INFO ] Deduced a trap composed of 195 places in 127 ms of which 2 ms to minimize.
[2024-05-31 22:55:29] [INFO ] Deduced a trap composed of 199 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:55:29] [INFO ] Deduced a trap composed of 148 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 201 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 199 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 146 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 137 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 167 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 138 places in 114 ms of which 2 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 189 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 193 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Deduced a trap composed of 190 places in 108 ms of which 1 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 4 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Deduced a trap composed of 193 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:55:34] [INFO ] Deduced a trap composed of 181 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:55:35] [INFO ] Deduced a trap composed of 210 places in 109 ms of which 1 ms to minimize.
[2024-05-31 22:55:35] [INFO ] Deduced a trap composed of 210 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-31 22:55:36] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:55:37] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:55:37] [INFO ] Deduced a trap composed of 198 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:55:37] [INFO ] Deduced a trap composed of 195 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:55:38] [INFO ] Deduced a trap composed of 155 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 183 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 156 places in 103 ms of which 1 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 183 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 149 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 148 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 157 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 189 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 156 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 185 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 139 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 173 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 170 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 60227ms, After SMT, problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66510 ms. Remains : 428/428 places, 441/441 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13874 reset in 110 ms.
Product exploration explored 100000 steps with 13828 reset in 123 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 9 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-31 22:55:41] [INFO ] Computed 99 invariants in 51 ms
[2024-05-31 22:55:41] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 22:55:41] [INFO ] Invariant cache hit.
[2024-05-31 22:55:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:55:50] [INFO ] Implicit Places using invariants and state equation in 8989 ms returned []
Implicit Place search using SMT with State Equation took 9307 ms to find 0 implicit places.
[2024-05-31 22:55:50] [INFO ] Redundant transitions in 5 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-31 22:55:50] [INFO ] Invariant cache hit.
[2024-05-31 22:55:50] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 531/1083 variables, 552/651 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 38/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 530 unsolved
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 30108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39439 ms. Remains : 553/553 places, 531/531 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 379264 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)&&X(X(G(p1)))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 29 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:56:20] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-31 22:56:21] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:56:21] [INFO ] Invariants computation overflowed in 87 ms
[2024-05-31 22:56:34] [INFO ] Implicit Places using invariants and state equation in 13768 ms returned []
Implicit Place search using SMT with State Equation took 14118 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 22:56:34] [INFO ] Invariants computation overflowed in 102 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30033 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30032 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Finished structural reductions in LTL mode , in 1 iterations and 74468 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-05
Stuttering criterion allowed to conclude after 181 steps with 5 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-05 finished in 74667 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&&(p1||F(p2))))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 1055 transition count 761
Reduce places removed 234 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 236 rules applied. Total rules applied 471 place count 821 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 473 place count 819 transition count 759
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 473 place count 819 transition count 719
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 553 place count 779 transition count 719
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 919 place count 596 transition count 536
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 993 place count 559 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 994 place count 558 transition count 535
Applied a total of 994 rules in 80 ms. Remains 558 /1057 variables (removed 499) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 22:57:35] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:57:35] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 22:57:35] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:57:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 22:57:43] [INFO ] Implicit Places using invariants and state equation in 7660 ms returned []
Implicit Place search using SMT with State Equation took 7925 ms to find 0 implicit places.
[2024-05-31 22:57:43] [INFO ] Redundant transitions in 6 ms returned []
Running 534 sub problems to find dead transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 22:57:43] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 22:57:43] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 535/1092 variables, 557/557 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1092 variables, 37/594 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1092 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30126ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1057 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38148 ms. Remains : 558/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-07
Product exploration explored 100000 steps with 13954 reset in 206 ms.
Product exploration explored 100000 steps with 14000 reset in 159 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 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 p0 (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (5481 resets) in 173 ms. (229 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (3204 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3257 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3243 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 22:58:14] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 22:58:14] [INFO ] State equation strengthened by 37 read => feed constraints.
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) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 74/94 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 134/228 variables, 63/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 139/367 variables, 75/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 128/495 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 119/614 variables, 66/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/614 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/614 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 64/678 variables, 37/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/678 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/678 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 55/733 variables, 28/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/733 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/733 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 55/788 variables, 28/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/788 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/788 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 55/843 variables, 28/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/843 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/843 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 55/898 variables, 28/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/898 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/898 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 55/953 variables, 28/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/953 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/953 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 55/1008 variables, 28/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1008 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1008 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 53/1061 variables, 28/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1061 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1061 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 30/1091 variables, 21/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1091 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1091 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 595 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3659 ms.
Refiners :[State Equation: 558/558 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/74 variables, 23/26 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 98/172 variables, 49/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 4/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 92/264 variables, 47/128 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 3/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 95/359 variables, 48/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 4/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 106/465 variables, 53/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 4/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/465 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 109/574 variables, 55/295 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 4/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/574 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 107/681 variables, 56/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/681 variables, 3/358 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/681 variables, 0/358 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 91/772 variables, 49/407 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/772 variables, 2/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 22:58:18] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:58:18] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:58:18] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:58:19] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/772 variables, 11/420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/772 variables, 0/420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 70/842 variables, 39/459 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/842 variables, 2/461 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/842 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 56/898 variables, 29/490 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/898 variables, 2/492 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/898 variables, 0/492 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 55/953 variables, 28/520 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/953 variables, 2/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/953 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 55/1008 variables, 28/550 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1008 variables, 2/552 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1008 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 53/1061 variables, 28/580 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1061 variables, 2/582 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1061 variables, 0/582 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 30/1091 variables, 21/603 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1091 variables, 3/606 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1091 variables, 0/606 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 2/1093 variables, 2/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1093 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 0/1093 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1093/1093 variables, and 608 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2274 ms.
Refiners :[State Equation: 558/558 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 5974ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 5531 ms.
Support contains 3 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 557 transition count 532
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 555 transition count 532
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 243 place count 477 transition count 455
Applied a total of 243 rules in 37 ms. Remains 477 /558 variables (removed 81) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 477/558 places, 455/535 transitions.
RANDOM walk for 40000 steps (5079 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3401 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 285611 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 285611 steps, saw 142897 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 22:58:29] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:58:29] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 174/192 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 501/693 variables, 248/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 43/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/693 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 239/932 variables, 189/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 29/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/932 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 554 constraints, problems are : Problem set: 0 solved, 2 unsolved in 784 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 174/192 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 501/693 variables, 248/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/693 variables, 43/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/693 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 239/932 variables, 189/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 29/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:58:30] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/932 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 858 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1698ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 10613 ms.
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 22:58:41] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:58:42] [INFO ] Implicit Places using invariants in 503 ms returned []
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 22:58:42] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 22:58:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:58:53] [INFO ] Implicit Places using invariants and state equation in 11535 ms returned [42, 48, 68, 73, 94, 99, 121, 127, 150, 155, 156, 176, 181, 202, 208, 215, 229, 234, 257, 263, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2024-05-31 22:58:53] [INFO ] Actually due to overlaps returned [215, 155]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12043 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 475/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 454
Applied a total of 2 rules in 21 ms. Remains 474 /475 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 474 cols
[2024-05-31 22:58:53] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 22:58:54] [INFO ] Implicit Places using invariants in 476 ms returned []
// Phase 1: matrix 454 rows 474 cols
[2024-05-31 22:58:54] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 22:58:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:59:03] [INFO ] Implicit Places using invariants and state equation in 9631 ms returned [42, 48, 68, 73, 94, 99, 121, 127, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2024-05-31 22:59:03] [INFO ] Actually due to overlaps returned [449, 388]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10111 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 472/477 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 453
Applied a total of 2 rules in 22 ms. Remains 471 /472 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 471 cols
[2024-05-31 22:59:04] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 22:59:04] [INFO ] Implicit Places using invariants in 462 ms returned []
// Phase 1: matrix 453 rows 471 cols
[2024-05-31 22:59:04] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:59:04] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:59:14] [INFO ] Implicit Places using invariants and state equation in 10109 ms returned [42, 48, 68, 73, 94, 99, 121, 127, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 391, 411, 417, 439, 444, 463, 469]
[2024-05-31 22:59:14] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10574 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/477 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 452
Applied a total of 2 rules in 20 ms. Remains 468 /469 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 468 cols
[2024-05-31 22:59:14] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 22:59:15] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 452 rows 468 cols
[2024-05-31 22:59:15] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 22:59:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:59:36] [INFO ] Implicit Places using invariants and state equation in 21478 ms returned [65, 70, 91, 96, 118, 124, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 408, 414, 436, 441, 460, 466]
[2024-05-31 22:59:36] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 21914 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 466/477 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 451
Applied a total of 2 rules in 16 ms. Remains 465 /466 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 465 cols
[2024-05-31 22:59:36] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 22:59:36] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2024-05-31 22:59:36] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 22:59:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 22:59:45] [INFO ] Implicit Places using invariants and state equation in 8514 ms returned [88, 93, 115, 121, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2024-05-31 22:59:45] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8929 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 463/477 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 450
Applied a total of 2 rules in 20 ms. Remains 462 /463 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 462 cols
[2024-05-31 22:59:45] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 22:59:45] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 450 rows 462 cols
[2024-05-31 22:59:45] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 22:59:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:00:00] [INFO ] Implicit Places using invariants and state equation in 14596 ms returned [112, 118, 141, 146, 166, 171, 192, 198, 217, 222, 245, 251, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-31 23:00:00] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15002 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 460/477 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 460 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 459 transition count 449
Applied a total of 2 rules in 17 ms. Remains 459 /460 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 459 cols
[2024-05-31 23:00:00] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:00:00] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 449 rows 459 cols
[2024-05-31 23:00:00] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 23:00:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:00:18] [INFO ] Implicit Places using invariants and state equation in 17437 ms returned [138, 143, 163, 168, 189, 195, 214, 219, 242, 248, 270, 275, 295, 300, 321, 326, 347, 353, 374, 379, 399, 405, 427, 432, 451, 457]
[2024-05-31 23:00:18] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17811 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 457/477 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 457 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 456 transition count 448
Applied a total of 2 rules in 17 ms. Remains 456 /457 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 456 cols
[2024-05-31 23:00:18] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:00:18] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 448 rows 456 cols
[2024-05-31 23:00:18] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 23:00:18] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:00:28] [INFO ] Implicit Places using invariants and state equation in 9917 ms returned [160, 165, 186, 192, 211, 216, 239, 245, 267, 272, 292, 297, 318, 323, 344, 350, 371, 376, 396, 402, 424, 429, 448, 454]
[2024-05-31 23:00:28] [INFO ] Actually due to overlaps returned [165, 160]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10284 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 454/477 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 447
Applied a total of 2 rules in 16 ms. Remains 453 /454 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 453 cols
[2024-05-31 23:00:28] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:00:28] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 447 rows 453 cols
[2024-05-31 23:00:28] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:00:29] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:00:43] [INFO ] Implicit Places using invariants and state equation in 14515 ms returned [183, 189, 208, 213, 236, 242, 264, 269, 289, 294, 315, 320, 341, 347, 368, 373, 393, 399, 421, 426, 445, 451]
[2024-05-31 23:00:43] [INFO ] Actually due to overlaps returned [189, 183]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14860 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 451/477 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 451 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 450 transition count 446
Applied a total of 2 rules in 21 ms. Remains 450 /451 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 450 cols
[2024-05-31 23:00:43] [INFO ] Computed 81 invariants in 47 ms
[2024-05-31 23:00:44] [INFO ] Implicit Places using invariants in 698 ms returned [205, 210, 233, 239, 261, 266, 286, 291, 312, 317, 338, 344, 365, 370, 390, 396, 418, 423, 442, 448]
[2024-05-31 23:00:44] [INFO ] Actually due to overlaps returned [210, 205]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 700 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 448/477 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 445
Applied a total of 2 rules in 15 ms. Remains 447 /448 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 447 cols
[2024-05-31 23:00:44] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:00:44] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 445 rows 447 cols
[2024-05-31 23:00:44] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:00:44] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:00:54] [INFO ] Implicit Places using invariants and state equation in 9612 ms returned [230, 236, 258, 263, 283, 288, 309, 314, 335, 341, 362, 367, 387, 393, 415, 420, 439, 445]
[2024-05-31 23:00:54] [INFO ] Actually due to overlaps returned [236, 230]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9952 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 445/477 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 444
Applied a total of 2 rules in 14 ms. Remains 444 /445 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 444 cols
[2024-05-31 23:00:54] [INFO ] Computed 77 invariants in 51 ms
[2024-05-31 23:00:54] [INFO ] Implicit Places using invariants in 631 ms returned [255, 260, 280, 285, 306, 311, 332, 338, 359, 364, 384, 390, 412, 417, 436, 442]
[2024-05-31 23:00:54] [INFO ] Actually due to overlaps returned [260, 255]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 631 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 442/477 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 443
Applied a total of 2 rules in 16 ms. Remains 441 /442 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 441 cols
[2024-05-31 23:00:54] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:00:55] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 443 rows 441 cols
[2024-05-31 23:00:55] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 23:00:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:01:04] [INFO ] Implicit Places using invariants and state equation in 9866 ms returned [277, 282, 303, 308, 329, 335, 356, 361, 381, 387, 409, 414, 433, 439]
[2024-05-31 23:01:04] [INFO ] Actually due to overlaps returned [282, 277]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10174 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 439/477 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 438 transition count 442
Applied a total of 2 rules in 15 ms. Remains 438 /439 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 438 cols
[2024-05-31 23:01:05] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:01:05] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 442 rows 438 cols
[2024-05-31 23:01:05] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 23:01:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:01:12] [INFO ] Implicit Places using invariants and state equation in 6935 ms returned [300, 305, 326, 332, 353, 358, 378, 384, 406, 411, 430, 436]
[2024-05-31 23:01:12] [INFO ] Actually due to overlaps returned [305, 300]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7237 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 436/477 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 436 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 435 transition count 441
Applied a total of 2 rules in 18 ms. Remains 435 /436 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 435 cols
[2024-05-31 23:01:12] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:01:12] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 441 rows 435 cols
[2024-05-31 23:01:12] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 23:01:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:01:20] [INFO ] Implicit Places using invariants and state equation in 8124 ms returned [323, 329, 350, 355, 375, 381, 403, 408, 427, 433]
[2024-05-31 23:01:20] [INFO ] Actually due to overlaps returned [329, 323]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8430 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 433/477 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 440
Applied a total of 2 rules in 19 ms. Remains 432 /433 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 432 cols
[2024-05-31 23:01:20] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:01:20] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 440 rows 432 cols
[2024-05-31 23:01:21] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 23:01:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:01:33] [INFO ] Implicit Places using invariants and state equation in 12774 ms returned [347, 352, 372, 378, 400, 405, 424, 430]
[2024-05-31 23:01:33] [INFO ] Actually due to overlaps returned [352, 347]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13051 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 430/477 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 430 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 429 transition count 439
Applied a total of 2 rules in 23 ms. Remains 429 /430 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 429 cols
[2024-05-31 23:01:33] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:01:34] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2024-05-31 23:01:34] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 23:01:34] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:01:45] [INFO ] Implicit Places using invariants and state equation in 11849 ms returned [369, 375, 397, 402, 421, 427]
[2024-05-31 23:01:45] [INFO ] Actually due to overlaps returned [375, 369]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12135 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 427/477 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 426 transition count 438
Applied a total of 2 rules in 15 ms. Remains 426 /427 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 426 cols
[2024-05-31 23:01:45] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:01:46] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 438 rows 426 cols
[2024-05-31 23:01:46] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:01:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:01:53] [INFO ] Implicit Places using invariants and state equation in 6860 ms returned [394, 399, 418, 424]
[2024-05-31 23:01:53] [INFO ] Actually due to overlaps returned [399, 394]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7146 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 424/477 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 437
Applied a total of 2 rules in 19 ms. Remains 423 /424 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 423 cols
[2024-05-31 23:01:53] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:01:53] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 437 rows 423 cols
[2024-05-31 23:01:53] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:01:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:02:02] [INFO ] Implicit Places using invariants and state equation in 8743 ms returned [415, 421]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9036 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 421/477 places, 437/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 436
Applied a total of 2 rules in 20 ms. Remains 420 /421 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 420 cols
[2024-05-31 23:02:02] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:02:02] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2024-05-31 23:02:02] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:02:02] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:02:11] [INFO ] Implicit Places using invariants and state equation in 8954 ms returned []
Implicit Place search using SMT with State Equation took 9236 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 420/477 places, 436/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 209623 ms. Remains : 420/477 places, 436/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT p1))), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND (OR p2 p0) (OR p2 p1))))]
Knowledge based reduction with 14 factoid took 240 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 558 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 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 13 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 23:02:11] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:02:12] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 23:02:12] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:02:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:02:19] [INFO ] Implicit Places using invariants and state equation in 7747 ms returned []
Implicit Place search using SMT with State Equation took 8023 ms to find 0 implicit places.
[2024-05-31 23:02:19] [INFO ] Redundant transitions in 5 ms returned []
Running 534 sub problems to find dead transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 23:02:19] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:02:19] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 535/1092 variables, 557/557 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1092 variables, 37/594 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1092 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30131ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38185 ms. Remains : 558/558 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 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 p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 77 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (5514 resets) in 64 ms. (615 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (3195 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
// Phase 1: matrix 535 rows 558 cols
[2024-05-31 23:02:50] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:02:50] [INFO ] State equation strengthened by 37 read => feed constraints.
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) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/64 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/159 variables, 44/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/259 variables, 53/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/356 variables, 49/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/464 variables, 54/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/464 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/464 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/574 variables, 56/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 107/681 variables, 56/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/681 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/681 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 91/772 variables, 49/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/772 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/772 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 70/842 variables, 39/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/842 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/842 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 56/898 variables, 29/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/898 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/898 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 55/953 variables, 28/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/953 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/953 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 55/1008 variables, 28/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1008 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1008 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 53/1061 variables, 28/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1061 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1061 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 30/1091 variables, 21/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1091 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1091 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/1093 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1093 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/1093 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[State Equation: 558/558 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) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/64 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/159 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/259 variables, 53/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/356 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/464 variables, 54/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/464 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/464 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 110/574 variables, 56/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/574 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 107/681 variables, 56/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/681 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/681 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 91/772 variables, 49/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/772 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:02:50] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/772 variables, 10/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/772 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 70/842 variables, 39/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/842 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/842 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 56/898 variables, 29/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/898 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/898 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 55/953 variables, 28/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/953 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/953 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 55/1008 variables, 28/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1008 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1008 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 53/1061 variables, 28/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1061 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1061 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 30/1091 variables, 21/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1091 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1091 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 2/1093 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1093 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 0/1093 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1093/1093 variables, and 606 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1586 ms.
Refiners :[State Equation: 558/558 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 2061ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 462 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 43 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 475/558 places, 453/535 transitions.
RANDOM walk for 40000 steps (5132 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3339 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 461510 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 461510 steps, saw 230911 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 23:02:55] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 23:02:55] [INFO ] State equation strengthened by 77 read => feed constraints.
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) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 173/188 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 501/689 variables, 248/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 43/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 239/928 variables, 189/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/928 variables, 29/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/928 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 77/77 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) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 173/188 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 501/689 variables, 248/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/928 variables, 189/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 29/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:02:56] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-05-31 23:02:56] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-05-31 23:02:57] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 ms to minimize.
[2024-05-31 23:02:57] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/928 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1238 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 448 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 23:02:57] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 23:02:58] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2024-05-31 23:02:58] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:02:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:03:23] [INFO ] Implicit Places using invariants and state equation in 25427 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-31 23:03:23] [INFO ] Actually due to overlaps returned [213, 153]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25914 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 452
Applied a total of 2 rules in 18 ms. Remains 472 /473 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 472 cols
[2024-05-31 23:03:23] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:03:24] [INFO ] Implicit Places using invariants in 489 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2024-05-31 23:03:24] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:03:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:03:34] [INFO ] Implicit Places using invariants and state equation in 9852 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-31 23:03:34] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10346 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 451
Applied a total of 2 rules in 29 ms. Remains 469 /470 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 469 cols
[2024-05-31 23:03:34] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:03:34] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 451 rows 469 cols
[2024-05-31 23:03:34] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:03:34] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:03:49] [INFO ] Implicit Places using invariants and state equation in 15016 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-31 23:03:49] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15480 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 450
Applied a total of 2 rules in 20 ms. Remains 466 /467 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 466 cols
[2024-05-31 23:03:49] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:03:50] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-31 23:03:50] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:03:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:04:07] [INFO ] Implicit Places using invariants and state equation in 17346 ms returned [65, 70, 91, 96, 117, 123, 145, 150, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-31 23:04:07] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17779 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 449
Applied a total of 2 rules in 17 ms. Remains 463 /464 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 463 cols
[2024-05-31 23:04:07] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:04:07] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 449 rows 463 cols
[2024-05-31 23:04:07] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:04:08] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:04:20] [INFO ] Implicit Places using invariants and state equation in 12666 ms returned [88, 93, 114, 120, 142, 147, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-31 23:04:20] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13069 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 448
Applied a total of 2 rules in 16 ms. Remains 460 /461 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 460 cols
[2024-05-31 23:04:20] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:04:20] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 448 rows 460 cols
[2024-05-31 23:04:20] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 23:04:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:04:38] [INFO ] Implicit Places using invariants and state equation in 17563 ms returned [111, 117, 139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 23:04:38] [INFO ] Actually due to overlaps returned [117, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17963 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 447
Applied a total of 2 rules in 22 ms. Remains 457 /458 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 457 cols
[2024-05-31 23:04:38] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:04:38] [INFO ] Implicit Places using invariants in 387 ms returned []
// Phase 1: matrix 447 rows 457 cols
[2024-05-31 23:04:38] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:04:39] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:04:50] [INFO ] Implicit Places using invariants and state equation in 11091 ms returned [136, 141, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-31 23:04:50] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11479 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 446
Applied a total of 2 rules in 17 ms. Remains 454 /455 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 454 cols
[2024-05-31 23:04:50] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:04:50] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 446 rows 454 cols
[2024-05-31 23:04:50] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:04:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:05:00] [INFO ] Implicit Places using invariants and state equation in 10406 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-31 23:05:00] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10777 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 445
Applied a total of 2 rules in 16 ms. Remains 451 /452 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 451 cols
[2024-05-31 23:05:00] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:05:01] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 445 rows 451 cols
[2024-05-31 23:05:01] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:05:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:05:08] [INFO ] Implicit Places using invariants and state equation in 7418 ms returned [181, 187, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-31 23:05:08] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7779 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 444
Applied a total of 2 rules in 15 ms. Remains 448 /449 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 448 cols
[2024-05-31 23:05:08] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:05:08] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 444 rows 448 cols
[2024-05-31 23:05:08] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:05:09] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:05:22] [INFO ] Implicit Places using invariants and state equation in 13393 ms returned [203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-31 23:05:22] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13725 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 443
Applied a total of 2 rules in 15 ms. Remains 445 /446 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 445 cols
[2024-05-31 23:05:22] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:05:22] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 443 rows 445 cols
[2024-05-31 23:05:22] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:05:22] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:05:31] [INFO ] Implicit Places using invariants and state equation in 8436 ms returned [228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-31 23:05:31] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8765 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 443/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 442
Applied a total of 2 rules in 15 ms. Remains 442 /443 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 442 cols
[2024-05-31 23:05:31] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:05:31] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 442 rows 442 cols
[2024-05-31 23:05:31] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 23:05:31] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:05:40] [INFO ] Implicit Places using invariants and state equation in 9021 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-31 23:05:40] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9350 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 442/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 441
Applied a total of 2 rules in 18 ms. Remains 439 /440 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 439 cols
[2024-05-31 23:05:40] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:05:40] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 441 rows 439 cols
[2024-05-31 23:05:40] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 23:05:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:05:48] [INFO ] Implicit Places using invariants and state equation in 7987 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-31 23:05:48] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8296 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 440
Applied a total of 2 rules in 15 ms. Remains 436 /437 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 436 cols
[2024-05-31 23:05:48] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:05:49] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 440 rows 436 cols
[2024-05-31 23:05:49] [INFO ] Invariants computation overflowed in 19 ms
[2024-05-31 23:05:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:05:55] [INFO ] Implicit Places using invariants and state equation in 6810 ms returned [298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-31 23:05:55] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7107 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 439
Applied a total of 2 rules in 15 ms. Remains 433 /434 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 433 cols
[2024-05-31 23:05:55] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:05:56] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 439 rows 433 cols
[2024-05-31 23:05:56] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:05:56] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:06:03] [INFO ] Implicit Places using invariants and state equation in 7347 ms returned [321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-31 23:06:03] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7657 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 439/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 438
Applied a total of 2 rules in 15 ms. Remains 430 /431 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 430 cols
[2024-05-31 23:06:03] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:06:03] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 438 rows 430 cols
[2024-05-31 23:06:03] [INFO ] Invariants computation overflowed in 20 ms
[2024-05-31 23:06:04] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:06:10] [INFO ] Implicit Places using invariants and state equation in 6140 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-31 23:06:10] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6427 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 437
Applied a total of 2 rules in 19 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 427 cols
[2024-05-31 23:06:10] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:06:10] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 437 rows 427 cols
[2024-05-31 23:06:10] [INFO ] Invariants computation overflowed in 20 ms
[2024-05-31 23:06:10] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:06:16] [INFO ] Implicit Places using invariants and state equation in 6483 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-31 23:06:16] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6771 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 437/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 436
Applied a total of 2 rules in 20 ms. Remains 424 /425 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 424 cols
[2024-05-31 23:06:16] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:06:17] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 436 rows 424 cols
[2024-05-31 23:06:17] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 23:06:17] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:06:28] [INFO ] Implicit Places using invariants and state equation in 11043 ms returned [392, 397, 416, 422]
[2024-05-31 23:06:28] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11321 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 422/475 places, 436/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 435
Applied a total of 2 rules in 18 ms. Remains 421 /422 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 421 cols
[2024-05-31 23:06:28] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:06:28] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 435 rows 421 cols
[2024-05-31 23:06:28] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:06:28] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:06:35] [INFO ] Implicit Places using invariants and state equation in 7035 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7318 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 419/475 places, 435/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 419 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 418 transition count 434
Applied a total of 2 rules in 18 ms. Remains 418 /419 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-31 23:06:35] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 23:06:35] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2024-05-31 23:06:35] [INFO ] Invariants computation overflowed in 20 ms
[2024-05-31 23:06:35] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 23:06:46] [INFO ] Implicit Places using invariants and state equation in 10828 ms returned []
Implicit Place search using SMT with State Equation took 11091 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 228769 ms. Remains : 418/475 places, 434/453 transitions.
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13959 reset in 114 ms.
Product exploration explored 100000 steps with 13984 reset in 118 ms.
Support contains 3 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 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 558 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 557 transition count 534
Applied a total of 2 rules in 12 ms. Remains 557 /558 variables (removed 1) and now considering 534/535 (removed 1) transitions.
// Phase 1: matrix 534 rows 557 cols
[2024-05-31 23:06:47] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 23:06:47] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2024-05-31 23:06:47] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:06:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:06:58] [INFO ] Implicit Places using invariants and state equation in 10641 ms returned []
Implicit Place search using SMT with State Equation took 10895 ms to find 0 implicit places.
[2024-05-31 23:06:58] [INFO ] Redundant transitions in 6 ms returned []
Running 533 sub problems to find dead transitions.
// Phase 1: matrix 534 rows 557 cols
[2024-05-31 23:06:58] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:06:58] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (OVERLAPS) 534/1090 variables, 556/556 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1090 variables, 37/593 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1090 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 533 unsolved
SMT process timed out in 30125ms, After SMT, problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 557/558 places, 534/535 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41056 ms. Remains : 557/558 places, 534/535 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-07 finished in 592950 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(!(((F(p0) U p1)||!p0) U X(p2))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 30 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:07:28] [INFO ] Invariants computation overflowed in 98 ms
[2024-05-31 23:07:28] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:07:28] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-31 23:07:43] [INFO ] Implicit Places using invariants and state equation in 14354 ms returned []
Implicit Place search using SMT with State Equation took 14736 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:07:43] [INFO ] Invariants computation overflowed in 94 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30027 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30025 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Finished structural reductions in LTL mode , in 1 iterations and 75066 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 305 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08
Product exploration explored 100000 steps with 33342 reset in 223 ms.
Product exploration explored 100000 steps with 33346 reset in 357 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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 : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 141 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (1336 resets) in 303 ms. (131 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (108 resets) in 90 ms. (43 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (114 resets) in 57 ms. (68 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (114 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (117 resets) in 109 ms. (36 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (113 resets) in 65 ms. (60 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (109 resets) in 79 ms. (50 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (115 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (112 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (111 resets) in 103 ms. (38 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (106 resets) in 72 ms. (54 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (106 resets) in 45 ms. (86 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (107 resets) in 76 ms. (51 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (118 resets) in 119 ms. (33 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (113 resets) in 67 ms. (58 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (113 resets) in 160 ms. (24 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (109 resets) in 55 ms. (71 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (103 resets) in 56 ms. (70 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (108 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (114 resets) in 69 ms. (57 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 66132 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 19
Probabilistic random walk after 66132 steps, saw 33077 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:08:48] [INFO ] Invariants computation overflowed in 89 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 45/58 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 125/183 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 215/398 variables, 105/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 274/672 variables, 128/302 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 282/954 variables, 161/463 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/954 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 199/1153 variables, 106/569 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1153 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 190/1343 variables, 99/668 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1343 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 181/1524 variables, 89/757 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1524 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 212/1736 variables, 112/869 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1736 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (OVERLAPS) 137/1873 variables, 82/951 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1873 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (OVERLAPS) 98/1971 variables, 52/1003 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1971 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (OVERLAPS) 65/2036 variables, 41/1044 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2036 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (OVERLAPS) 13/2049 variables, 10/1054 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 23:08:53] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 2.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 2.0)
(s24 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 2.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 2.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 3.0)
(s70 3.0)
(s71 1.0)
(s72 3.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 2.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 40994.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 40994.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 40994.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 2.0)
(s661 2.0)
(s662 2.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 1.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 1.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 1.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2049/2054 variables, and 1055 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5016 ms.
Refiners :[State Equation: 1054/1057 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 45/58 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 125/183 variables, 49/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 215/398 variables, 105/193 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 274/672 variables, 128/321 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/672 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 282/954 variables, 161/482 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/954 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 199/1153 variables, 106/588 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1153 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 190/1343 variables, 99/687 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1343 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 181/1524 variables, 89/776 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1524 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 212/1736 variables, 112/888 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1736 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 137/1873 variables, 82/970 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1873 variables, 1/971 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1873 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (OVERLAPS) 98/1971 variables, 52/1023 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1971 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2036/2054 variables, and 1064 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5011 ms.
Refiners :[State Equation: 1044/1057 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
After SMT, in 10127ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 81 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 478/1057 places, 455/997 transitions.
RANDOM walk for 40000 steps (5107 resets) in 1113 ms. (35 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (339 resets) in 63 ms. (62 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (340 resets) in 66 ms. (59 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (327 resets) in 98 ms. (40 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (339 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (346 resets) in 22 ms. (173 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (327 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (340 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (338 resets) in 64 ms. (61 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (335 resets) in 102 ms. (38 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (333 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (330 resets) in 67 ms. (58 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (312 resets) in 222 ms. (17 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (341 resets) in 87 ms. (45 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (337 resets) in 81 ms. (48 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (332 resets) in 71 ms. (55 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (344 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (334 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (346 resets) in 62 ms. (63 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (345 resets) in 62 ms. (63 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 75253 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 19
Probabilistic random walk after 75253 steps, saw 37645 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 23:09:02] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:09:02] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 538/771 variables, 287/349 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 50/399 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
Problem apf19 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 162/933 variables, 134/533 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 23/556 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 6 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 6 solved, 13 unsolved in 3164 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 13/75 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 538/771 variables, 287/362 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 50/412 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/412 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 162/933 variables, 134/546 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 23/569 constraints. Problems are: Problem set: 6 solved, 13 unsolved
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 15/584 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/584 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/933 variables, 0/584 constraints. Problems are: Problem set: 6 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 584 constraints, problems are : Problem set: 6 solved, 13 unsolved in 5097 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 13/19 constraints, Known Traps: 15/15 constraints]
After SMT, in 8317ms problems are : Problem set: 6 solved, 13 unsolved
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 478/478 places, 455/455 transitions.
RANDOM walk for 40000 steps (5107 resets) in 924 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3414 resets) in 911 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3363 resets) in 906 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 765 ms. (52 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3447 resets) in 664 ms. (60 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3327 resets) in 957 ms. (41 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3348 resets) in 591 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3385 resets) in 891 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3406 resets) in 1016 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3329 resets) in 677 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3409 resets) in 740 ms. (53 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3450 resets) in 770 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3351 resets) in 768 ms. (52 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3384 resets) in 771 ms. (51 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 300119 steps, run timeout after 9001 ms. (steps per millisecond=33 ) properties seen :0 out of 13
Probabilistic random walk after 300119 steps, saw 150150 distinct states, run finished after 9001 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 23:09:53] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:09:53] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 538/771 variables, 287/349 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 50/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 162/933 variables, 134/533 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 23/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4501 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 538/771 variables, 287/362 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 50/412 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 162/933 variables, 134/546 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 23/569 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 23:10:00] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2024-05-31 23:10:00] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-05-31 23:10:00] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-31 23:10:00] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2024-05-31 23:10:00] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-31 23:10:00] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:10:01] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:10:01] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:10:01] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-05-31 23:10:01] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-05-31 23:10:01] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-31 23:10:01] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-31 23:10:01] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-31 23:10:02] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-05-31 23:10:02] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 15/584 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/933 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 584 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5565 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 15/15 constraints]
After SMT, in 10118ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 23:10:34] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:10:34] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 23:10:34] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:10:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:10:45] [INFO ] Implicit Places using invariants and state equation in 10706 ms returned [42, 48, 68, 73, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 315, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2024-05-31 23:10:45] [INFO ] Actually due to overlaps returned [128, 214, 122, 154]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 11107 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 472 transition count 453
Applied a total of 4 rules in 20 ms. Remains 472 /474 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 23:10:45] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:10:45] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 23:10:45] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:10:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:10:54] [INFO ] Implicit Places using invariants and state equation in 9394 ms returned [42, 48, 68, 73, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 304, 309, 330, 335, 356, 362, 383, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-31 23:10:54] [INFO ] Actually due to overlaps returned [151, 447, 146, 386]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9739 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 468/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 466 transition count 451
Applied a total of 4 rules in 17 ms. Remains 466 /468 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 23:10:54] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:10:55] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 23:10:55] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:10:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:11:03] [INFO ] Implicit Places using invariants and state equation in 8816 ms returned [42, 48, 68, 73, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 301, 306, 327, 332, 353, 359, 380, 386, 406, 412, 434, 439, 458, 464]
[2024-05-31 23:11:03] [INFO ] Actually due to overlaps returned [173, 48, 42, 168]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9148 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 462/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 460 transition count 449
Applied a total of 4 rules in 18 ms. Remains 460 /462 variables (removed 2) and now considering 449/451 (removed 2) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 23:11:04] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:11:04] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 23:11:04] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:11:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:11:16] [INFO ] Implicit Places using invariants and state equation in 12604 ms returned [65, 70, 188, 194, 213, 218, 241, 247, 269, 274, 295, 300, 321, 326, 347, 353, 374, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 23:11:16] [INFO ] Actually due to overlaps returned [194, 65, 188, 70]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 12917 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 456/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 456 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 454 transition count 447
Applied a total of 4 rules in 15 ms. Remains 454 /456 variables (removed 2) and now considering 447/449 (removed 2) transitions.
// Phase 1: matrix 447 rows 454 cols
[2024-05-31 23:11:16] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:11:17] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 447 rows 454 cols
[2024-05-31 23:11:17] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:11:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:11:25] [INFO ] Implicit Places using invariants and state equation in 7901 ms returned [207, 212, 235, 241, 263, 268, 289, 294, 315, 320, 341, 347, 368, 374, 394, 400, 422, 427, 446, 452]
[2024-05-31 23:11:25] [INFO ] Actually due to overlaps returned [212, 207]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8206 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 446
Applied a total of 2 rules in 15 ms. Remains 451 /452 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 451 cols
[2024-05-31 23:11:25] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:11:25] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 446 rows 451 cols
[2024-05-31 23:11:25] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 23:11:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:11:36] [INFO ] Implicit Places using invariants and state equation in 11389 ms returned [232, 238, 260, 265, 286, 291, 312, 317, 338, 344, 365, 371, 391, 397, 419, 424, 443, 449]
[2024-05-31 23:11:36] [INFO ] Actually due to overlaps returned [238, 232]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11673 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 449/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 445
Applied a total of 2 rules in 15 ms. Remains 448 /449 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 448 cols
[2024-05-31 23:11:36] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:11:37] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 445 rows 448 cols
[2024-05-31 23:11:37] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:11:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:11:50] [INFO ] Implicit Places using invariants and state equation in 13304 ms returned [257, 262, 283, 288, 309, 314, 335, 341, 362, 368, 388, 394, 416, 421, 440, 446]
[2024-05-31 23:11:50] [INFO ] Actually due to overlaps returned [262, 257]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13587 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 446/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 444
Applied a total of 2 rules in 21 ms. Remains 445 /446 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 445 cols
[2024-05-31 23:11:50] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:11:50] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 444 rows 445 cols
[2024-05-31 23:11:50] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 23:11:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:11:55] [INFO ] Implicit Places using invariants and state equation in 5056 ms returned [280, 285, 306, 311, 332, 338, 359, 365, 385, 391, 413, 418, 437, 443]
[2024-05-31 23:11:55] [INFO ] Actually due to overlaps returned [285, 280]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5344 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 443/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 443
Applied a total of 2 rules in 19 ms. Remains 442 /443 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 442 cols
[2024-05-31 23:11:55] [INFO ] Computed 75 invariants in 44 ms
[2024-05-31 23:11:56] [INFO ] Implicit Places using invariants in 466 ms returned [303, 308, 329, 335, 356, 362, 382, 388, 410, 415, 434, 440]
[2024-05-31 23:11:56] [INFO ] Actually due to overlaps returned [308, 303]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 467 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 440/478 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 442
Applied a total of 2 rules in 15 ms. Remains 439 /440 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 439 cols
[2024-05-31 23:11:56] [INFO ] Computed 73 invariants in 42 ms
[2024-05-31 23:11:56] [INFO ] Implicit Places using invariants in 452 ms returned [326, 332, 353, 359, 379, 385, 407, 412, 431, 437]
[2024-05-31 23:11:56] [INFO ] Actually due to overlaps returned [332, 326]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 454 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 437/478 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 441
Applied a total of 2 rules in 16 ms. Remains 436 /437 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 436 cols
[2024-05-31 23:11:56] [INFO ] Computed 71 invariants in 53 ms
[2024-05-31 23:11:57] [INFO ] Implicit Places using invariants in 434 ms returned [350, 356, 376, 382, 404, 409, 428, 434]
[2024-05-31 23:11:57] [INFO ] Actually due to overlaps returned [356, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 435 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 434/478 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 440
Applied a total of 2 rules in 15 ms. Remains 433 /434 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 433 cols
[2024-05-31 23:11:57] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:11:57] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 440 rows 433 cols
[2024-05-31 23:11:57] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:11:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:12:01] [INFO ] Implicit Places using invariants and state equation in 4410 ms returned [373, 379, 401, 406, 425, 431]
[2024-05-31 23:12:01] [INFO ] Actually due to overlaps returned [379, 373]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4669 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 431/478 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 439
Applied a total of 2 rules in 17 ms. Remains 430 /431 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 430 cols
[2024-05-31 23:12:01] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:12:02] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 439 rows 430 cols
[2024-05-31 23:12:02] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:12:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:12:08] [INFO ] Implicit Places using invariants and state equation in 6596 ms returned [398, 403, 422, 428]
[2024-05-31 23:12:08] [INFO ] Actually due to overlaps returned [403, 398]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6879 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 428/478 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 438
Applied a total of 2 rules in 21 ms. Remains 427 /428 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 427 cols
[2024-05-31 23:12:08] [INFO ] Computed 65 invariants in 42 ms
[2024-05-31 23:12:09] [INFO ] Implicit Places using invariants in 383 ms returned [419, 425]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 384 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 425/478 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 437
Applied a total of 2 rules in 15 ms. Remains 424 /425 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 424 cols
[2024-05-31 23:12:09] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:12:09] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2024-05-31 23:12:09] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:12:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:12:15] [INFO ] Implicit Places using invariants and state equation in 6442 ms returned []
Implicit Place search using SMT with State Equation took 6697 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 101959 ms. Remains : 424/478 places, 437/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 575 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 307 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:12:17] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-31 23:12:17] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:12:17] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-31 23:12:31] [INFO ] Implicit Places using invariants and state equation in 14403 ms returned []
Implicit Place search using SMT with State Equation took 14782 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:12:32] [INFO ] Invariants computation overflowed in 92 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30030 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30032 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Finished structural reductions in LTL mode , in 1 iterations and 75120 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 599 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
RANDOM walk for 40000 steps (1330 resets) in 606 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1143 resets) in 508 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1164 resets) in 589 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1135 resets) in 666 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1131 resets) in 698 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1146 resets) in 422 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1127 resets) in 591 ms. (67 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 144770 steps, run timeout after 3009 ms. (steps per millisecond=48 ) properties seen :0 out of 6
Probabilistic random walk after 144770 steps, saw 72400 distinct states, run finished after 3010 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:13:37] [INFO ] Invariants computation overflowed in 89 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 45/58 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 125/183 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 215/398 variables, 105/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 274/672 variables, 128/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 282/954 variables, 161/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/954 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 199/1153 variables, 106/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1153 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 190/1343 variables, 99/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1343 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 181/1524 variables, 89/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1524 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 212/1736 variables, 112/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1736 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 137/1873 variables, 82/951 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1873 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 98/1971 variables, 52/1003 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1971 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 65/2036 variables, 41/1044 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2036 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 13/2049 variables, 10/1054 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:13:40] [INFO ] Deduced a trap composed of 121 places in 234 ms of which 5 ms to minimize.
[2024-05-31 23:13:40] [INFO ] Deduced a trap composed of 115 places in 234 ms of which 5 ms to minimize.
[2024-05-31 23:13:40] [INFO ] Deduced a trap composed of 101 places in 223 ms of which 4 ms to minimize.
[2024-05-31 23:13:40] [INFO ] Deduced a trap composed of 127 places in 221 ms of which 5 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2049 variables, 4/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2049 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 4/2053 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2053 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 1/2054 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:13:42] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 3 ms to minimize.
[2024-05-31 23:13:42] [INFO ] Deduced a trap composed of 139 places in 210 ms of which 3 ms to minimize.
SMT process timed out in 5205ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 78 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 478/1057 places, 455/997 transitions.
RANDOM walk for 40000 steps (5188 resets) in 887 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3377 resets) in 340 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3407 resets) in 425 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3400 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3389 resets) in 390 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3395 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3415 resets) in 532 ms. (75 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 161862 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 6
Probabilistic random walk after 161862 steps, saw 80967 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 23:13:47] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:13:47] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 538/771 variables, 287/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 50/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 162/933 variables, 134/533 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 23/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6270 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 217/233 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 538/771 variables, 287/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 50/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 162/933 variables, 134/539 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 23/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:13:55] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-31 23:13:55] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-31 23:13:55] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2024-05-31 23:13:55] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:13:55] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:13:55] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-31 23:13:56] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2024-05-31 23:13:56] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-31 23:13:56] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-31 23:13:56] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-31 23:13:56] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-31 23:13:56] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-31 23:13:56] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2024-05-31 23:13:57] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 14/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/933 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 576 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4380 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 14/14 constraints]
After SMT, in 10700ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 23:14:27] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:14:28] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-31 23:14:28] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:14:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:14:39] [INFO ] Implicit Places using invariants and state equation in 10902 ms returned [42, 48, 68, 73, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 315, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2024-05-31 23:14:39] [INFO ] Actually due to overlaps returned [128, 214, 122, 154]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 11273 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 472 transition count 453
Applied a total of 4 rules in 22 ms. Remains 472 /474 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 23:14:39] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:14:39] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-31 23:14:39] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:14:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:14:49] [INFO ] Implicit Places using invariants and state equation in 9543 ms returned [42, 48, 68, 73, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 304, 309, 330, 335, 356, 362, 383, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-31 23:14:49] [INFO ] Actually due to overlaps returned [151, 447, 146, 386]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9902 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 468/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 466 transition count 451
Applied a total of 4 rules in 17 ms. Remains 466 /468 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 23:14:49] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:14:49] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-31 23:14:49] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:14:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:14:57] [INFO ] Implicit Places using invariants and state equation in 8587 ms returned [42, 48, 68, 73, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 301, 306, 327, 332, 353, 359, 380, 386, 406, 412, 434, 439, 458, 464]
[2024-05-31 23:14:57] [INFO ] Actually due to overlaps returned [173, 48, 42, 168]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 8915 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 462/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 460 transition count 449
Applied a total of 4 rules in 16 ms. Remains 460 /462 variables (removed 2) and now considering 449/451 (removed 2) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 23:14:58] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:14:58] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-31 23:14:58] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:14:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:15:10] [INFO ] Implicit Places using invariants and state equation in 12516 ms returned [65, 70, 188, 194, 213, 218, 241, 247, 269, 274, 295, 300, 321, 326, 347, 353, 374, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 23:15:10] [INFO ] Actually due to overlaps returned [194, 65, 188, 70]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 12825 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 456/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 456 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 454 transition count 447
Applied a total of 4 rules in 15 ms. Remains 454 /456 variables (removed 2) and now considering 447/449 (removed 2) transitions.
// Phase 1: matrix 447 rows 454 cols
[2024-05-31 23:15:10] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:15:11] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 447 rows 454 cols
[2024-05-31 23:15:11] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:15:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:15:19] [INFO ] Implicit Places using invariants and state equation in 7891 ms returned [207, 212, 235, 241, 263, 268, 289, 294, 315, 320, 341, 347, 368, 374, 394, 400, 422, 427, 446, 452]
[2024-05-31 23:15:19] [INFO ] Actually due to overlaps returned [212, 207]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8186 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 446
Applied a total of 2 rules in 14 ms. Remains 451 /452 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 451 cols
[2024-05-31 23:15:19] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:15:19] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 446 rows 451 cols
[2024-05-31 23:15:19] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:15:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:15:30] [INFO ] Implicit Places using invariants and state equation in 11148 ms returned [232, 238, 260, 265, 286, 291, 312, 317, 338, 344, 365, 371, 391, 397, 419, 424, 443, 449]
[2024-05-31 23:15:30] [INFO ] Actually due to overlaps returned [238, 232]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11431 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 449/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 445
Applied a total of 2 rules in 15 ms. Remains 448 /449 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 448 cols
[2024-05-31 23:15:30] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:15:30] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 445 rows 448 cols
[2024-05-31 23:15:30] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:15:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:15:43] [INFO ] Implicit Places using invariants and state equation in 13000 ms returned [257, 262, 283, 288, 309, 314, 335, 341, 362, 368, 388, 394, 416, 421, 440, 446]
[2024-05-31 23:15:43] [INFO ] Actually due to overlaps returned [262, 257]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13277 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 446/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 444
Applied a total of 2 rules in 15 ms. Remains 445 /446 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 445 cols
[2024-05-31 23:15:43] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-31 23:15:44] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 444 rows 445 cols
[2024-05-31 23:15:44] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-31 23:15:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:15:49] [INFO ] Implicit Places using invariants and state equation in 4987 ms returned [280, 285, 306, 311, 332, 338, 359, 365, 385, 391, 413, 418, 437, 443]
[2024-05-31 23:15:49] [INFO ] Actually due to overlaps returned [285, 280]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5256 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 443/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 443
Applied a total of 2 rules in 19 ms. Remains 442 /443 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 442 cols
[2024-05-31 23:15:49] [INFO ] Computed 75 invariants in 41 ms
[2024-05-31 23:15:49] [INFO ] Implicit Places using invariants in 494 ms returned [303, 308, 329, 335, 356, 362, 382, 388, 410, 415, 434, 440]
[2024-05-31 23:15:49] [INFO ] Actually due to overlaps returned [308, 303]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 495 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 440/478 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 442
Applied a total of 2 rules in 14 ms. Remains 439 /440 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 439 cols
[2024-05-31 23:15:49] [INFO ] Computed 73 invariants in 44 ms
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants in 463 ms returned [326, 332, 353, 359, 379, 385, 407, 412, 431, 437]
[2024-05-31 23:15:50] [INFO ] Actually due to overlaps returned [332, 326]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 465 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 437/478 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 441
Applied a total of 2 rules in 16 ms. Remains 436 /437 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 436 cols
[2024-05-31 23:15:50] [INFO ] Computed 71 invariants in 53 ms
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants in 426 ms returned [350, 356, 376, 382, 404, 409, 428, 434]
[2024-05-31 23:15:50] [INFO ] Actually due to overlaps returned [356, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 427 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 434/478 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 440
Applied a total of 2 rules in 15 ms. Remains 433 /434 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 433 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 440 rows 433 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:15:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:15:55] [INFO ] Implicit Places using invariants and state equation in 4318 ms returned [373, 379, 401, 406, 425, 431]
[2024-05-31 23:15:55] [INFO ] Actually due to overlaps returned [379, 373]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4592 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 431/478 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 439
Applied a total of 2 rules in 20 ms. Remains 430 /431 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 430 cols
[2024-05-31 23:15:55] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:15:55] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 439 rows 430 cols
[2024-05-31 23:15:55] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:15:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:16:01] [INFO ] Implicit Places using invariants and state equation in 6193 ms returned [398, 403, 422, 428]
[2024-05-31 23:16:01] [INFO ] Actually due to overlaps returned [403, 398]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6450 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 428/478 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 438
Applied a total of 2 rules in 20 ms. Remains 427 /428 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 427 cols
[2024-05-31 23:16:01] [INFO ] Computed 65 invariants in 42 ms
[2024-05-31 23:16:01] [INFO ] Implicit Places using invariants in 359 ms returned [419, 425]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 360 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 425/478 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 437
Applied a total of 2 rules in 14 ms. Remains 424 /425 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 424 cols
[2024-05-31 23:16:01] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:16:02] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2024-05-31 23:16:02] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:16:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:16:08] [INFO ] Implicit Places using invariants and state equation in 6225 ms returned []
Implicit Place search using SMT with State Equation took 6482 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 100580 ms. Remains : 424/478 places, 437/455 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 588 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 307 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 334 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 33329 reset in 209 ms.
Product exploration explored 100000 steps with 33357 reset in 222 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:16:11] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-31 23:16:11] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:16:11] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-31 23:16:25] [INFO ] Implicit Places using invariants and state equation in 14086 ms returned []
Implicit Place search using SMT with State Equation took 14466 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:16:26] [INFO ] Invariants computation overflowed in 101 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30032 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30044 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60319ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Finished structural reductions in LTL mode , in 1 iterations and 74831 ms. Remains : 1057/1057 places, 997/997 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 597999 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&&F((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 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 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 818 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 477 place count 817 transition count 757
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 477 place count 817 transition count 717
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 919 place count 596 transition count 536
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 995 place count 558 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 996 place count 557 transition count 535
Applied a total of 996 rules in 67 ms. Remains 557 /1057 variables (removed 500) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 557 cols
[2024-05-31 23:17:26] [INFO ] Computed 99 invariants in 51 ms
[2024-05-31 23:17:26] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-31 23:17:26] [INFO ] Invariant cache hit.
[2024-05-31 23:17:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:17:33] [INFO ] Implicit Places using invariants and state equation in 6496 ms returned []
Implicit Place search using SMT with State Equation took 6811 ms to find 0 implicit places.
[2024-05-31 23:17:33] [INFO ] Redundant transitions in 2 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-31 23:17:33] [INFO ] Invariant cache hit.
[2024-05-31 23:17:33] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1057 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36994 ms. Remains : 557/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-10
Product exploration explored 100000 steps with 13914 reset in 117 ms.
Product exploration explored 100000 steps with 13900 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 557 vertex of which 556 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 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (5589 resets) in 921 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3260 resets) in 440 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3212 resets) in 489 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3209 resets) in 466 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3222 resets) in 566 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3236 resets) in 536 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3225 resets) in 551 ms. (72 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 183687 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 6
Probabilistic random walk after 183687 steps, saw 91877 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-31 23:18:08] [INFO ] Invariant cache hit.
[2024-05-31 23:18:08] [INFO ] State equation strengthened by 37 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 135/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 200/339 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 71/410 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 57/486 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/500 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 525/1025 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 35/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1025 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 61/1086 variables, 52/682 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1086 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/1088 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1088 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 4/1092 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1092 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1092 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/1092 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 693 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 135/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 200/339 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 71/410 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 57/486 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/500 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 525/1025 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 35/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1025 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:18:11] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1025 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1025 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 61/1086 variables, 52/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1086 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1086 variables, 5/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:18:14] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-05-31 23:18:14] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:18:15] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-31 23:18:15] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:18:15] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:18:15] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-31 23:18:15] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:18:16] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1086/1092 variables, and 700 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 552/557 constraints, ReadFeed: 36/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 8072ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 535/535 transitions.
Graph (complete) has 1660 edges and 557 vertex of which 556 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 556 transition count 534
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 556 transition count 455
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 477 transition count 455
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 2 with 82 rules applied. Total rules applied 242 place count 477 transition count 455
Applied a total of 242 rules in 35 ms. Remains 477 /557 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 477/557 places, 455/535 transitions.
RANDOM walk for 40000 steps (5054 resets) in 575 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 593 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3395 resets) in 467 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3345 resets) in 932 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3378 resets) in 659 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3299 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3293 resets) in 489 ms. (81 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 180638 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 6
Probabilistic random walk after 180638 steps, saw 90346 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 23:18:20] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:18:20] [INFO ] State equation strengthened by 78 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 186/204 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 499/703 variables, 255/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 44/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 229/932 variables, 181/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 27/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 555 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1310 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 186/204 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 499/703 variables, 255/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 44/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 229/932 variables, 181/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 27/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/932 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 561 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1731 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3101ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12810 ms.
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 23:18:36] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:18:37] [INFO ] Implicit Places using invariants in 470 ms returned []
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 23:18:37] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:18:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:18:48] [INFO ] Implicit Places using invariants and state equation in 10759 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 156, 176, 181, 202, 208, 215, 229, 234, 257, 263, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2024-05-31 23:18:48] [INFO ] Actually due to overlaps returned [215, 155]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11233 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 475/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 454
Applied a total of 2 rules in 22 ms. Remains 474 /475 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 474 cols
[2024-05-31 23:18:48] [INFO ] Computed 97 invariants in 51 ms
[2024-05-31 23:18:49] [INFO ] Implicit Places using invariants in 1494 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2024-05-31 23:18:49] [INFO ] Actually due to overlaps returned [449, 388]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1495 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 472/477 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 453
Applied a total of 2 rules in 18 ms. Remains 471 /472 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 471 cols
[2024-05-31 23:18:49] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:18:50] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 453 rows 471 cols
[2024-05-31 23:18:50] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:18:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:19:04] [INFO ] Implicit Places using invariants and state equation in 14249 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 391, 411, 417, 439, 444, 463, 469]
[2024-05-31 23:19:04] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14708 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/477 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 452
Applied a total of 2 rules in 17 ms. Remains 468 /469 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 468 cols
[2024-05-31 23:19:04] [INFO ] Computed 93 invariants in 73 ms
[2024-05-31 23:19:05] [INFO ] Implicit Places using invariants in 1191 ms returned [65, 70, 92, 97, 119, 125, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 408, 414, 436, 441, 460, 466]
[2024-05-31 23:19:05] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1192 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 466/477 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 451
Applied a total of 2 rules in 20 ms. Remains 465 /466 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 465 cols
[2024-05-31 23:19:05] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 23:19:05] [INFO ] Implicit Places using invariants in 442 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2024-05-31 23:19:05] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-31 23:19:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:19:22] [INFO ] Implicit Places using invariants and state equation in 16445 ms returned [89, 94, 116, 122, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2024-05-31 23:19:22] [INFO ] Actually due to overlaps returned [94, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16889 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 463/477 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 450
Applied a total of 2 rules in 17 ms. Remains 462 /463 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 462 cols
[2024-05-31 23:19:22] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 23:19:22] [INFO ] Implicit Places using invariants in 442 ms returned []
// Phase 1: matrix 450 rows 462 cols
[2024-05-31 23:19:22] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 23:19:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:19:47] [INFO ] Implicit Places using invariants and state equation in 25151 ms returned [113, 119, 141, 146, 166, 171, 192, 198, 217, 222, 245, 251, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-31 23:19:47] [INFO ] Actually due to overlaps returned [119, 113]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25594 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 460/477 places, 450/455 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 460 transition count 450
Applied a total of 2 rules in 15 ms. Remains 460 /460 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 460 cols
[2024-05-31 23:19:48] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:19:48] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 450 rows 460 cols
[2024-05-31 23:19:48] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:19:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:19:55] [INFO ] Implicit Places using invariants and state equation in 7561 ms returned [139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 23:19:55] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7951 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/477 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 449
Applied a total of 2 rules in 16 ms. Remains 457 /458 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 457 cols
[2024-05-31 23:19:56] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:19:56] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 449 rows 457 cols
[2024-05-31 23:19:56] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:19:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:20:04] [INFO ] Implicit Places using invariants and state equation in 8375 ms returned [161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-31 23:20:04] [INFO ] Actually due to overlaps returned [166, 161]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8778 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/477 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 448
Applied a total of 2 rules in 23 ms. Remains 454 /455 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 454 cols
[2024-05-31 23:20:04] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:20:05] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 448 rows 454 cols
[2024-05-31 23:20:05] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:20:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:20:13] [INFO ] Implicit Places using invariants and state equation in 8542 ms returned [184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-31 23:20:13] [INFO ] Actually due to overlaps returned [190, 184]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8917 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 452/477 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 447
Applied a total of 2 rules in 20 ms. Remains 451 /452 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 451 cols
[2024-05-31 23:20:13] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:20:14] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 447 rows 451 cols
[2024-05-31 23:20:14] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:20:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:20:23] [INFO ] Implicit Places using invariants and state equation in 9334 ms returned [206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-31 23:20:23] [INFO ] Actually due to overlaps returned [211, 206]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9694 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 449/477 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 446
Applied a total of 2 rules in 19 ms. Remains 448 /449 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 448 cols
[2024-05-31 23:20:23] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:20:23] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2024-05-31 23:20:23] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:20:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:20:37] [INFO ] Implicit Places using invariants and state equation in 13791 ms returned [231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-31 23:20:37] [INFO ] Actually due to overlaps returned [237, 231]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14122 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 446/477 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 445
Applied a total of 2 rules in 15 ms. Remains 445 /446 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 445 cols
[2024-05-31 23:20:37] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:20:37] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 445 rows 445 cols
[2024-05-31 23:20:37] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:20:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:20:48] [INFO ] Implicit Places using invariants and state equation in 10253 ms returned [256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-31 23:20:48] [INFO ] Actually due to overlaps returned [261, 256]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10578 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 443/477 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 444
Applied a total of 2 rules in 20 ms. Remains 442 /443 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 442 cols
[2024-05-31 23:20:48] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:20:48] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 444 rows 442 cols
[2024-05-31 23:20:48] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:20:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:20:57] [INFO ] Implicit Places using invariants and state equation in 9428 ms returned [278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-31 23:20:57] [INFO ] Actually due to overlaps returned [283, 278]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9756 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 440/477 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 443
Applied a total of 2 rules in 20 ms. Remains 439 /440 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 439 cols
[2024-05-31 23:20:57] [INFO ] Computed 73 invariants in 41 ms
[2024-05-31 23:20:58] [INFO ] Implicit Places using invariants in 543 ms returned [301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-31 23:20:58] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 545 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 437/477 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 442
Applied a total of 2 rules in 18 ms. Remains 436 /437 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 436 cols
[2024-05-31 23:20:58] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 23:20:58] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 442 rows 436 cols
[2024-05-31 23:20:58] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:20:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:21:04] [INFO ] Implicit Places using invariants and state equation in 5311 ms returned [324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-31 23:21:04] [INFO ] Actually due to overlaps returned [330, 324]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5615 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 434/477 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 441
Applied a total of 2 rules in 17 ms. Remains 433 /434 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 433 cols
[2024-05-31 23:21:04] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:21:04] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 441 rows 433 cols
[2024-05-31 23:21:04] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:21:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:21:22] [INFO ] Implicit Places using invariants and state equation in 17656 ms returned [348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-31 23:21:22] [INFO ] Actually due to overlaps returned [353, 348]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17967 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 431/477 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 440
Applied a total of 2 rules in 19 ms. Remains 430 /431 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 430 cols
[2024-05-31 23:21:22] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:21:22] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 440 rows 430 cols
[2024-05-31 23:21:22] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:21:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:21:35] [INFO ] Implicit Places using invariants and state equation in 12925 ms returned [370, 376, 398, 403, 422, 428]
[2024-05-31 23:21:35] [INFO ] Actually due to overlaps returned [376, 370]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13229 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 428/477 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 439
Applied a total of 2 rules in 14 ms. Remains 427 /428 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 427 cols
[2024-05-31 23:21:35] [INFO ] Computed 65 invariants in 42 ms
[2024-05-31 23:21:35] [INFO ] Implicit Places using invariants in 429 ms returned [395, 400, 419, 425]
[2024-05-31 23:21:35] [INFO ] Actually due to overlaps returned [400, 395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 431 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 425/477 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 438
Applied a total of 2 rules in 14 ms. Remains 424 /425 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 424 cols
[2024-05-31 23:21:35] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:21:36] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 438 rows 424 cols
[2024-05-31 23:21:36] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:21:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:21:53] [INFO ] Implicit Places using invariants and state equation in 17290 ms returned [416, 422]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17585 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 422/477 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 437
Applied a total of 2 rules in 16 ms. Remains 421 /422 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 421 cols
[2024-05-31 23:21:53] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:21:53] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2024-05-31 23:21:53] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:21:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:22:07] [INFO ] Implicit Places using invariants and state equation in 13409 ms returned []
Implicit Place search using SMT with State Equation took 13680 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 421/477 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 210322 ms. Remains : 421/477 places, 437/455 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 535/535 transitions.
Applied a total of 0 rules in 14 ms. Remains 557 /557 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 557 cols
[2024-05-31 23:22:07] [INFO ] Computed 99 invariants in 51 ms
[2024-05-31 23:22:07] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 23:22:07] [INFO ] Invariant cache hit.
[2024-05-31 23:22:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:22:14] [INFO ] Implicit Places using invariants and state equation in 6811 ms returned []
Implicit Place search using SMT with State Equation took 7129 ms to find 0 implicit places.
[2024-05-31 23:22:14] [INFO ] Redundant transitions in 4 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-31 23:22:14] [INFO ] Invariant cache hit.
[2024-05-31 23:22:14] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1092 variables, and 692 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 531/1223 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1092 variables, and 1223 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67275 ms. Remains : 557/557 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 557 vertex of which 556 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 p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 104 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (5560 resets) in 392 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3256 resets) in 561 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3266 resets) in 519 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3244 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3268 resets) in 265 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3276 resets) in 311 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3202 resets) in 343 ms. (116 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 160320 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 6
Probabilistic random walk after 160320 steps, saw 80197 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-31 23:23:18] [INFO ] Invariant cache hit.
[2024-05-31 23:23:18] [INFO ] State equation strengthened by 37 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 135/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 200/339 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 71/410 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 57/486 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/500 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 525/1025 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 35/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1025 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 61/1086 variables, 52/682 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1086 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/1088 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1088 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 4/1092 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1092 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1092 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/1092 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 693 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 135/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 200/339 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 71/410 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 57/486 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/500 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 525/1025 variables, 500/595 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 35/630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1025 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:23:22] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1025 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1025 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 61/1086 variables, 52/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1086 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1086 variables, 5/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:23:25] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-31 23:23:25] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-31 23:23:26] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-05-31 23:23:26] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 2 ms to minimize.
[2024-05-31 23:23:26] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-31 23:23:26] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-31 23:23:27] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-31 23:23:27] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1086/1092 variables, and 700 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 552/557 constraints, ReadFeed: 36/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 8460ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 535/535 transitions.
Graph (complete) has 1660 edges and 557 vertex of which 556 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 556 transition count 534
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 556 transition count 455
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 477 transition count 455
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 2 with 82 rules applied. Total rules applied 242 place count 477 transition count 455
Applied a total of 242 rules in 35 ms. Remains 477 /557 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 477/557 places, 455/535 transitions.
RANDOM walk for 40000 steps (5051 resets) in 639 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3370 resets) in 424 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3392 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 566 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3326 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3322 resets) in 430 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3336 resets) in 708 ms. (56 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 165364 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 6
Probabilistic random walk after 165364 steps, saw 82714 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 23:23:31] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:23:31] [INFO ] State equation strengthened by 78 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 186/204 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 499/703 variables, 255/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 44/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 229/932 variables, 181/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 27/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 555 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1269 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 186/204 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 499/703 variables, 255/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 44/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 229/932 variables, 181/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 27/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/932 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 561 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1681 ms.
Refiners :[State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2986ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 11729 ms.
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 23:23:46] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 23:23:47] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 455 rows 477 cols
[2024-05-31 23:23:47] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 23:23:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:23:57] [INFO ] Implicit Places using invariants and state equation in 10791 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 156, 176, 181, 202, 208, 215, 229, 234, 257, 263, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2024-05-31 23:23:57] [INFO ] Actually due to overlaps returned [215, 155]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11275 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 475/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 454
Applied a total of 2 rules in 24 ms. Remains 474 /475 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 474 cols
[2024-05-31 23:23:57] [INFO ] Computed 97 invariants in 48 ms
[2024-05-31 23:23:59] [INFO ] Implicit Places using invariants in 1440 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2024-05-31 23:23:59] [INFO ] Actually due to overlaps returned [449, 388]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1442 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 472/477 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 453
Applied a total of 2 rules in 19 ms. Remains 471 /472 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 471 cols
[2024-05-31 23:23:59] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:23:59] [INFO ] Implicit Places using invariants in 445 ms returned []
// Phase 1: matrix 453 rows 471 cols
[2024-05-31 23:23:59] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:24:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:24:13] [INFO ] Implicit Places using invariants and state equation in 13747 ms returned [42, 48, 68, 73, 95, 100, 122, 128, 150, 155, 175, 180, 201, 207, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 391, 411, 417, 439, 444, 463, 469]
[2024-05-31 23:24:13] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14194 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/477 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 452
Applied a total of 2 rules in 17 ms. Remains 468 /469 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 468 cols
[2024-05-31 23:24:13] [INFO ] Computed 93 invariants in 73 ms
[2024-05-31 23:24:14] [INFO ] Implicit Places using invariants in 1163 ms returned [65, 70, 92, 97, 119, 125, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 408, 414, 436, 441, 460, 466]
[2024-05-31 23:24:14] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1165 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 466/477 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 451
Applied a total of 2 rules in 20 ms. Remains 465 /466 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 465 cols
[2024-05-31 23:24:14] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-31 23:24:15] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2024-05-31 23:24:15] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:24:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:24:31] [INFO ] Implicit Places using invariants and state equation in 16056 ms returned [89, 94, 116, 122, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2024-05-31 23:24:31] [INFO ] Actually due to overlaps returned [94, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16492 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 463/477 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 450
Applied a total of 2 rules in 17 ms. Remains 462 /463 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 462 cols
[2024-05-31 23:24:31] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:24:31] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 450 rows 462 cols
[2024-05-31 23:24:31] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:24:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:24:55] [INFO ] Implicit Places using invariants and state equation in 23809 ms returned [113, 119, 141, 146, 166, 171, 192, 198, 217, 222, 245, 251, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 402, 408, 430, 435, 454, 460]
[2024-05-31 23:24:55] [INFO ] Actually due to overlaps returned [119, 113]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24220 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 460/477 places, 450/455 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 460 transition count 450
Applied a total of 2 rules in 16 ms. Remains 460 /460 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 460 cols
[2024-05-31 23:24:55] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:24:55] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 450 rows 460 cols
[2024-05-31 23:24:55] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:24:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:25:03] [INFO ] Implicit Places using invariants and state equation in 7370 ms returned [139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-31 23:25:03] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7747 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/477 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 449
Applied a total of 2 rules in 21 ms. Remains 457 /458 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 457 cols
[2024-05-31 23:25:03] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:25:03] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 449 rows 457 cols
[2024-05-31 23:25:03] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:25:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:25:11] [INFO ] Implicit Places using invariants and state equation in 7923 ms returned [161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-31 23:25:11] [INFO ] Actually due to overlaps returned [166, 161]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8294 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/477 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 448
Applied a total of 2 rules in 16 ms. Remains 454 /455 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 454 cols
[2024-05-31 23:25:11] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:25:11] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 448 rows 454 cols
[2024-05-31 23:25:12] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:25:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:25:19] [INFO ] Implicit Places using invariants and state equation in 7676 ms returned [184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-31 23:25:19] [INFO ] Actually due to overlaps returned [190, 184]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8033 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 452/477 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 447
Applied a total of 2 rules in 21 ms. Remains 451 /452 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 451 cols
[2024-05-31 23:25:19] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:25:20] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 447 rows 451 cols
[2024-05-31 23:25:20] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-31 23:25:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:25:28] [INFO ] Implicit Places using invariants and state equation in 8599 ms returned [206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-31 23:25:28] [INFO ] Actually due to overlaps returned [211, 206]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8945 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 449/477 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 446
Applied a total of 2 rules in 20 ms. Remains 448 /449 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 448 cols
[2024-05-31 23:25:28] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:25:28] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2024-05-31 23:25:29] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-31 23:25:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:25:42] [INFO ] Implicit Places using invariants and state equation in 13603 ms returned [231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-31 23:25:42] [INFO ] Actually due to overlaps returned [237, 231]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13932 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 446/477 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 445
Applied a total of 2 rules in 21 ms. Remains 445 /446 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 445 cols
[2024-05-31 23:25:42] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:25:42] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 445 rows 445 cols
[2024-05-31 23:25:42] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:25:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:25:53] [INFO ] Implicit Places using invariants and state equation in 10139 ms returned [256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-31 23:25:53] [INFO ] Actually due to overlaps returned [261, 256]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10476 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 443/477 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 444
Applied a total of 2 rules in 23 ms. Remains 442 /443 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 442 cols
[2024-05-31 23:25:53] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:25:53] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 444 rows 442 cols
[2024-05-31 23:25:53] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:25:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:26:02] [INFO ] Implicit Places using invariants and state equation in 9355 ms returned [278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-31 23:26:02] [INFO ] Actually due to overlaps returned [283, 278]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9668 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 440/477 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 443
Applied a total of 2 rules in 15 ms. Remains 439 /440 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 439 cols
[2024-05-31 23:26:02] [INFO ] Computed 73 invariants in 40 ms
[2024-05-31 23:26:03] [INFO ] Implicit Places using invariants in 511 ms returned [301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-31 23:26:03] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 514 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 437/477 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 442
Applied a total of 2 rules in 16 ms. Remains 436 /437 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 436 cols
[2024-05-31 23:26:03] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:26:03] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 442 rows 436 cols
[2024-05-31 23:26:03] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:26:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:26:08] [INFO ] Implicit Places using invariants and state equation in 5285 ms returned [324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-31 23:26:08] [INFO ] Actually due to overlaps returned [330, 324]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5592 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 434/477 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 441
Applied a total of 2 rules in 18 ms. Remains 433 /434 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 433 cols
[2024-05-31 23:26:08] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:26:09] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 441 rows 433 cols
[2024-05-31 23:26:09] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:26:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:26:26] [INFO ] Implicit Places using invariants and state equation in 17457 ms returned [348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-31 23:26:26] [INFO ] Actually due to overlaps returned [353, 348]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17766 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 431/477 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 440
Applied a total of 2 rules in 15 ms. Remains 430 /431 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 430 cols
[2024-05-31 23:26:26] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:26:27] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 440 rows 430 cols
[2024-05-31 23:26:27] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:26:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:26:39] [INFO ] Implicit Places using invariants and state equation in 12896 ms returned [370, 376, 398, 403, 422, 428]
[2024-05-31 23:26:39] [INFO ] Actually due to overlaps returned [376, 370]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13196 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 428/477 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 439
Applied a total of 2 rules in 18 ms. Remains 427 /428 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 427 cols
[2024-05-31 23:26:39] [INFO ] Computed 65 invariants in 47 ms
[2024-05-31 23:26:40] [INFO ] Implicit Places using invariants in 426 ms returned [395, 400, 419, 425]
[2024-05-31 23:26:40] [INFO ] Actually due to overlaps returned [400, 395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 428 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 425/477 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 438
Applied a total of 2 rules in 15 ms. Remains 424 /425 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 424 cols
[2024-05-31 23:26:40] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:26:40] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 438 rows 424 cols
[2024-05-31 23:26:40] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:26:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:26:57] [INFO ] Implicit Places using invariants and state equation in 17134 ms returned [416, 422]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17422 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 422/477 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 437
Applied a total of 2 rules in 14 ms. Remains 421 /422 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 421 cols
[2024-05-31 23:26:57] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:26:58] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2024-05-31 23:26:58] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:26:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:27:11] [INFO ] Implicit Places using invariants and state equation in 13435 ms returned []
Implicit Place search using SMT with State Equation took 13715 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 421/477 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 204876 ms. Remains : 421/477 places, 437/455 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 13946 reset in 108 ms.
Product exploration explored 100000 steps with 13946 reset in 113 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 535/535 transitions.
Applied a total of 0 rules in 8 ms. Remains 557 /557 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 557 cols
[2024-05-31 23:27:12] [INFO ] Computed 99 invariants in 49 ms
[2024-05-31 23:27:12] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-31 23:27:12] [INFO ] Invariant cache hit.
[2024-05-31 23:27:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:27:19] [INFO ] Implicit Places using invariants and state equation in 6574 ms returned []
Implicit Place search using SMT with State Equation took 6889 ms to find 0 implicit places.
[2024-05-31 23:27:19] [INFO ] Redundant transitions in 5 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-31 23:27:19] [INFO ] Invariant cache hit.
[2024-05-31 23:27:19] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1092 variables, and 692 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1091 variables, 556/655 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 531/1223 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1092 variables, and 1223 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 556/557 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67049 ms. Remains : 557/557 places, 535/535 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-10 finished in 652954 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' '!((p0 U G((X(!p1) U p2))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:28:19] [INFO ] Invariants computation overflowed in 100 ms
[2024-05-31 23:28:19] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:28:19] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-31 23:28:33] [INFO ] Implicit Places using invariants and state equation in 13374 ms returned []
Implicit Place search using SMT with State Equation took 13752 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-31 23:28:33] [INFO ] Invariants computation overflowed in 96 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 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 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30029 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30032 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60298ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Finished structural reductions in LTL mode , in 1 iterations and 74096 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-11
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-11 finished in 74313 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(F(!p0))||(F(!p0)&&F(p1)))&&F(p2))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 481 place count 815 transition count 755
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 481 place count 815 transition count 716
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 559 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 556 transition count 533
Applied a total of 998 rules in 65 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-31 23:29:33] [INFO ] Computed 99 invariants in 47 ms
[2024-05-31 23:29:33] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-31 23:29:33] [INFO ] Invariant cache hit.
[2024-05-31 23:29:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 23:29:41] [INFO ] Implicit Places using invariants and state equation in 7590 ms returned []
Implicit Place search using SMT with State Equation took 7914 ms to find 0 implicit places.
[2024-05-31 23:29:41] [INFO ] Redundant transitions in 6 ms returned []
Running 532 sub problems to find dead transitions.
[2024-05-31 23:29:41] [INFO ] Invariant cache hit.
[2024-05-31 23:29:41] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/555 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (OVERLAPS) 533/1088 variables, 555/654 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 38/692 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1089 variables, and 692 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 555/556 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/555 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (OVERLAPS) 533/1088 variables, 555/654 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 38/692 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 529/1221 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1089 variables, and 1221 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 555/556 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 529/532 constraints, Known Traps: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68119 ms. Remains : 556/1057 places, 533/997 transitions.
Stuttering acceptance computed with spot in 215 ms :[p0, p0, (AND (NOT p2) p0), (AND (NOT p1) p0), (AND p0 (NOT p2)), (AND p0 (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12
Product exploration explored 100000 steps with 13815 reset in 109 ms.
Product exploration explored 100000 steps with 13948 reset in 115 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 556 vertex of which 555 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 (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (5462 resets) in 408 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3248 resets) in 347 ms. (114 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (3258 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3189 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
[2024-05-31 23:30:42] [INFO ] Invariant cache hit.
[2024-05-31 23:30:42] [INFO ] State equation strengthened by 38 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 201/203 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 201/404 variables, 54/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/428 variables, 6/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 23:30:43] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/485 variables, 8/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/499 variables, 6/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 523/1022 variables, 499/595 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1022 variables, 36/631 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1022 variables, 0/631 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1089 variables, and 683 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1452 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 551/556 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 201/203 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 201/404 variables, 54/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/428 variables, 6/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/485 variables, 8/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/499 variables, 6/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 523/1022 variables, 499/595 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1022 variables, 36/631 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1022 variables, 1/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1022 variables, 0/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1089 variables, and 684 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 551/556 constraints, ReadFeed: 36/38 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2823ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1660 edges and 556 vertex of which 555 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.
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 2 rules applied. Total rules applied 3 place count 555 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 554 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 81 place count 554 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 158 place count 477 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 238 place count 477 transition count 454
Applied a total of 238 rules in 37 ms. Remains 477 /556 variables (removed 79) and now considering 454/533 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 477/556 places, 454/533 transitions.
RANDOM walk for 40000 steps (5129 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3323 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 469898 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 469898 steps, saw 235061 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
// Phase 1: matrix 454 rows 477 cols
[2024-05-31 23:30:48] [INFO ] Computed 99 invariants in 50 ms
[2024-05-31 23:30:48] [INFO ] State equation strengthened by 78 read => feed constraints.
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) 212/214 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/424 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 3 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 3 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 3 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 48/472 variables, 16/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 128 places in 234 ms of which 3 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 3 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 132 places in 242 ms of which 3 ms to minimize.
[2024-05-31 23:30:52] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 3 ms to minimize.
[2024-05-31 23:30:52] [INFO ] Deduced a trap composed of 129 places in 231 ms of which 3 ms to minimize.
[2024-05-31 23:30:52] [INFO ] Deduced a trap composed of 129 places in 238 ms of which 3 ms to minimize.
[2024-05-31 23:30:52] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 454/926 variables, 472/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/926 variables, 78/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/926 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/931 variables, 5/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/931 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/931 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/931 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 931/931 variables, and 679 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4879 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 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) 212/214 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/424 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:30:53] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:30:54] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/472 variables, 16/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:30:54] [INFO ] Deduced a trap composed of 113 places in 241 ms of which 3 ms to minimize.
[2024-05-31 23:30:54] [INFO ] Deduced a trap composed of 115 places in 243 ms of which 3 ms to minimize.
[2024-05-31 23:30:54] [INFO ] Deduced a trap composed of 117 places in 237 ms of which 3 ms to minimize.
[2024-05-31 23:30:55] [INFO ] Deduced a trap composed of 131 places in 242 ms of which 2 ms to minimize.
[2024-05-31 23:30:55] [INFO ] Deduced a trap composed of 121 places in 243 ms of which 3 ms to minimize.
[2024-05-31 23:30:55] [INFO ] Deduced a trap composed of 135 places in 246 ms of which 3 ms to minimize.
[2024-05-31 23:30:55] [INFO ] Deduced a trap composed of 135 places in 242 ms of which 2 ms to minimize.
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 136 places in 236 ms of which 2 ms to minimize.
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 2 ms to minimize.
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
[2024-05-31 23:30:57] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 2 ms to minimize.
[2024-05-31 23:30:57] [INFO ] Deduced a trap composed of 121 places in 224 ms of which 3 ms to minimize.
[2024-05-31 23:30:57] [INFO ] Deduced a trap composed of 123 places in 238 ms of which 2 ms to minimize.
[2024-05-31 23:30:57] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 2 ms to minimize.
[2024-05-31 23:30:58] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:30:58] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:30:58] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-05-31 23:30:58] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 454/926 variables, 472/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/926 variables, 78/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/926 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/931 variables, 5/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/931 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/931 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/931 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 931/931 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 477/477 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 49/49 constraints]
After SMT, in 11437ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3439 ms.
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 477/477 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-05-31 23:31:03] [INFO ] Invariant cache hit.
[2024-05-31 23:31:05] [INFO ] Implicit Places using invariants in 1486 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 231, 254, 260, 283, 288, 308, 313, 335, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
[2024-05-31 23:31:05] [INFO ] Actually due to overlaps returned [212, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1487 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 475/477 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 453
Applied a total of 2 rules in 18 ms. Remains 474 /475 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 474 cols
[2024-05-31 23:31:05] [INFO ] Computed 97 invariants in 32 ms
[2024-05-31 23:31:06] [INFO ] Implicit Places using invariants in 1397 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 280, 285, 305, 310, 332, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2024-05-31 23:31:06] [INFO ] Actually due to overlaps returned [449, 388]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1399 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 472/477 places, 453/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 452
Applied a total of 2 rules in 19 ms. Remains 471 /472 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 471 cols
[2024-05-31 23:31:06] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:31:07] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 452 rows 471 cols
[2024-05-31 23:31:07] [INFO ] Invariants computation overflowed in 19 ms
[2024-05-31 23:31:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:31:21] [INFO ] Implicit Places using invariants and state equation in 14446 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 280, 285, 305, 310, 332, 338, 359, 365, 386, 391, 411, 417, 439, 444, 463, 469]
[2024-05-31 23:31:21] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14887 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/477 places, 452/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 451
Applied a total of 2 rules in 21 ms. Remains 468 /469 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 468 cols
[2024-05-31 23:31:21] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 23:31:21] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 451 rows 468 cols
[2024-05-31 23:31:22] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-31 23:31:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 23:31:42] [INFO ] Implicit Places using invariants and state equation in 20221 ms returned [66, 71, 92, 97, 117, 123, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 277, 282, 302, 307, 329, 335, 356, 362, 383, 388, 408, 414, 436, 441, 460, 466]
[2024-05-31 23:31:42] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20677 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 466/477 places, 451/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 450
Applied a total of 2 rules in 17 ms. Remains 465 /466 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 465 cols
[2024-05-31 23:31:42] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:31:42] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 450 rows 465 cols
[2024-05-31 23:31:42] [INFO ] Invariants computation overflowed in 20 ms
[2024-05-31 23:31:42] [INFO ] State equation strengthened by 78 read => feed constraints.

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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132900564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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