About the Execution of GreatSPN+red for DES-PT-60a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6516.203 | 1357465.00 | 1794508.00 | 2924.90 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r091-tall-171624188300749.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DES-PT-60a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300749
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 12 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 08:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 110K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-60a-UpperBounds-00
FORMULA_NAME DES-PT-60a-UpperBounds-01
FORMULA_NAME DES-PT-60a-UpperBounds-02
FORMULA_NAME DES-PT-60a-UpperBounds-03
FORMULA_NAME DES-PT-60a-UpperBounds-04
FORMULA_NAME DES-PT-60a-UpperBounds-05
FORMULA_NAME DES-PT-60a-UpperBounds-06
FORMULA_NAME DES-PT-60a-UpperBounds-07
FORMULA_NAME DES-PT-60a-UpperBounds-08
FORMULA_NAME DES-PT-60a-UpperBounds-09
FORMULA_NAME DES-PT-60a-UpperBounds-10
FORMULA_NAME DES-PT-60a-UpperBounds-11
FORMULA_NAME DES-PT-60a-UpperBounds-12
FORMULA_NAME DES-PT-60a-UpperBounds-13
FORMULA_NAME DES-PT-60a-UpperBounds-14
FORMULA_NAME DES-PT-60a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716329465167
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 22:11:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 22:11:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:11:06] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-21 22:11:06] [INFO ] Transformed 354 places.
[2024-05-21 22:11:06] [INFO ] Transformed 311 transitions.
[2024-05-21 22:11:06] [INFO ] Found NUPN structural information;
[2024-05-21 22:11:06] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-60a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 297 rows 354 cols
[2024-05-21 22:11:06] [INFO ] Computed 59 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (219 resets) in 59 ms. (166 steps per ms)
FORMULA DES-PT-60a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (353 resets) in 140 ms. (567 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-21 22:11:06] [INFO ] Invariant cache hit.
[2024-05-21 22:11:07] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2024-05-21 22:11:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-21 22:11:07] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-21 22:11:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-21 22:11:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:11:07] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-05-21 22:11:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:11:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 92 ms returned sat
[2024-05-21 22:11:08] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 7 ms to minimize.
[2024-05-21 22:11:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-21 22:11:08] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 31 ms.
[2024-05-21 22:11:09] [INFO ] Added : 125 causal constraints over 25 iterations in 1086 ms. Result :sat
Minimization took 253 ms.
[2024-05-21 22:11:09] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2024-05-21 22:11:09] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:09] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-21 22:11:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2024-05-21 22:11:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2024-05-21 22:11:09] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-21 22:11:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 63 ms returned sat
[2024-05-21 22:11:10] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 3 ms to minimize.
[2024-05-21 22:11:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2024-05-21 22:11:10] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 27 ms.
[2024-05-21 22:11:11] [INFO ] Added : 142 causal constraints over 29 iterations in 1058 ms. Result :sat
Minimization took 240 ms.
[2024-05-21 22:11:11] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 22:11:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-21 22:11:11] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-21 22:11:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 22:11:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:12] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-05-21 22:11:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 239 ms returned sat
[2024-05-21 22:11:12] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 3 ms to minimize.
[2024-05-21 22:11:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-05-21 22:11:12] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 21 ms.
[2024-05-21 22:11:14] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-21 22:11:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-21 22:11:14] [INFO ] Added : 202 causal constraints over 41 iterations in 1760 ms. Result :sat
Minimization took 413 ms.
[2024-05-21 22:11:14] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 22:11:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-21 22:11:14] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-21 22:11:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 22:11:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-21 22:11:15] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-21 22:11:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 58 ms returned sat
[2024-05-21 22:11:15] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2024-05-21 22:11:17] [INFO ] Added : 180 causal constraints over 37 iterations in 1984 ms. Result :sat
Minimization took 274 ms.
[2024-05-21 22:11:17] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 22:11:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:11:17] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-21 22:11:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 22:11:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:11:18] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-05-21 22:11:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 47 ms returned sat
[2024-05-21 22:11:18] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 18 ms.
[2024-05-21 22:11:18] [INFO ] Added : 98 causal constraints over 20 iterations in 724 ms. Result :sat
Minimization took 259 ms.
[2024-05-21 22:11:19] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 22:11:19] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:19] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-21 22:11:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2024-05-21 22:11:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:11:19] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-21 22:11:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 102 ms returned sat
[2024-05-21 22:11:19] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-21 22:11:19] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 17 ms.
[2024-05-21 22:11:21] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 22:11:21] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:11:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2024-05-21 22:11:21] [INFO ] Added : 210 causal constraints over 43 iterations in 1826 ms. Result :sat
Minimization took 332 ms.
[2024-05-21 22:11:22] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 22:11:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:11:22] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-21 22:11:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 22:11:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2024-05-21 22:11:22] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-21 22:11:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2024-05-21 22:11:22] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 21 ms.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-05-21 22:11:23] [INFO ] Added : 149 causal constraints over 30 iterations in 1103 ms. Result :sat
Minimization took 365 ms.
[2024-05-21 22:11:24] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 22:11:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:24] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-21 22:11:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2024-05-21 22:11:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-21 22:11:24] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-21 22:11:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2024-05-21 22:11:24] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-21 22:11:25] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:11:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 22:11:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2024-05-21 22:11:25] [INFO ] Added : 94 causal constraints over 19 iterations in 909 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 353 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 352 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 351 transition count 293
Applied a total of 12 rules in 147 ms. Remains 351 /354 variables (removed 3) and now considering 293/297 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 351/354 places, 293/297 transitions.
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:11:29] [INFO ] Computed 60 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13584 resets) in 2134 ms. (468 steps per ms)
BEST_FIRST walk for 8000007 steps (18234 resets) in 7386 ms. (1082 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-21 22:11:38] [INFO ] Invariant cache hit.
[2024-05-21 22:11:38] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 22:11:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:11:38] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-21 22:11:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-21 22:11:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 37 ms returned sat
[2024-05-21 22:11:39] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-21 22:11:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:11:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 22:11:39] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2024-05-21 22:11:39] [INFO ] Added : 145 causal constraints over 29 iterations in 694 ms. Result :sat
Minimization took 174 ms.
[2024-05-21 22:11:39] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 22:11:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:40] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 22:11:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-21 22:11:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-21 22:11:40] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-21 22:11:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 22:11:40] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-21 22:11:41] [INFO ] Added : 136 causal constraints over 28 iterations in 674 ms. Result :sat
Minimization took 155 ms.
[2024-05-21 22:11:41] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:11:41] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-21 22:11:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-21 22:11:41] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-21 22:11:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 22:11:41] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:11:41] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:11:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2024-05-21 22:11:41] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 22:11:42] [INFO ] Added : 245 causal constraints over 49 iterations in 1144 ms. Result :sat
Minimization took 232 ms.
[2024-05-21 22:11:43] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:11:43] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-21 22:11:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:43] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-21 22:11:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:11:43] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-21 22:11:44] [INFO ] Added : 197 causal constraints over 40 iterations in 902 ms. Result :sat
Minimization took 196 ms.
[2024-05-21 22:11:44] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 22:11:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:44] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 22:11:44] [INFO ] [Real]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-21 22:11:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 95 ms returned sat
[2024-05-21 22:11:45] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-21 22:11:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2024-05-21 22:11:45] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-21 22:11:45] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:11:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-21 22:11:45] [INFO ] Added : 97 causal constraints over 20 iterations in 509 ms. Result :sat
Minimization took 149 ms.
[2024-05-21 22:11:45] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-21 22:11:46] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-21 22:11:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:46] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-21 22:11:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 21 ms returned sat
[2024-05-21 22:11:46] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:11:46] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:11:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-05-21 22:11:46] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 22:11:47] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-21 22:11:47] [INFO ] Added : 261 causal constraints over 53 iterations in 1336 ms. Result :sat
Minimization took 181 ms.
[2024-05-21 22:11:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 22:11:48] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-21 22:11:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-21 22:11:48] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-21 22:11:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:11:48] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-21 22:11:49] [INFO ] Added : 170 causal constraints over 34 iterations in 790 ms. Result :sat
Minimization took 154 ms.
[2024-05-21 22:11:49] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-21 22:11:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-21 22:11:49] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-21 22:11:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:11:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:11:49] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-21 22:11:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-21 22:11:49] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 22:11:50] [INFO ] Added : 72 causal constraints over 15 iterations in 348 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 17 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-21 22:11:53] [INFO ] Invariant cache hit.
[2024-05-21 22:11:53] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-21 22:11:53] [INFO ] Invariant cache hit.
[2024-05-21 22:11:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:11:54] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2024-05-21 22:11:54] [INFO ] Redundant transitions in 16 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-21 22:11:54] [INFO ] Invariant cache hit.
[2024-05-21 22:11:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/350 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 293/643 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:12:01] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:12:07] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:12:09] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:12:13] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:12:15] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:12:21] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.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)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/644 variables, and 418 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:12:26] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:12:28] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
[2024-05-21 22:12:28] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:12:28] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 293/643 variables, 350/420 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 290/712 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 712 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61190 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (545 resets) in 1527 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (11 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 572993 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 16
Probabilistic random walk after 572993 steps, saw 82351 distinct states, run finished after 3006 ms. (steps per millisecond=190 ) properties seen :0
[2024-05-21 22:12:58] [INFO ] Invariant cache hit.
[2024-05-21 22:12:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 73/586 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/587 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 57/644 variables, 57/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 413 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3002 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 14/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 73/586 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/586 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1/587 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 57/644 variables, 57/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 434 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 8024ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 729 ms.
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (542 resets) in 346 ms. (115 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (11 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 576963 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 16
Probabilistic random walk after 576963 steps, saw 82880 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2024-05-21 22:13:10] [INFO ] Invariant cache hit.
[2024-05-21 22:13:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 73/586 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/587 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 57/644 variables, 57/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 413 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3108 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 14/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 73/586 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 22:13:15] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:13:15] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:13:15] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:13:15] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/586 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1/587 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 57/644 variables, 57/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 434 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5174 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 8291ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 3087 ms.
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-21 22:13:21] [INFO ] Invariant cache hit.
[2024-05-21 22:13:21] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-21 22:13:21] [INFO ] Invariant cache hit.
[2024-05-21 22:13:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:13:22] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-05-21 22:13:22] [INFO ] Redundant transitions in 5 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-21 22:13:22] [INFO ] Invariant cache hit.
[2024-05-21 22:13:22] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/350 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 293/643 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:13:37] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:13:42] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:13:49] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/644 variables, and 418 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-21 22:13:54] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:13:56] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:13:56] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:13:56] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 293/643 variables, 350/420 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 290/712 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 712 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60935 ms. Remains : 351/351 places, 293/293 transitions.
Attempting over-approximation, by ignoring read arcs.
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 351 transition count 293
Applied a total of 1 rules in 25 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:14:22] [INFO ] Computed 60 invariants in 17 ms
[2024-05-21 22:14:22] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 22:14:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-21 22:14:22] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-21 22:14:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 22:14:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-21 22:14:23] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-05-21 22:14:23] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:14:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-21 22:14:23] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:14:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-21 22:14:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-21 22:14:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
TRAPS : Iteration 1
[2024-05-21 22:14:24] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-05-21 22:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 2
[2024-05-21 22:14:25] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
TRAPS : Iteration 3
[2024-05-21 22:14:26] [INFO ] After 2812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-05-21 22:14:26] [INFO ] After 3398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 3739 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Starting property specific reduction for DES-PT-60a-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:14:26] [INFO ] Computed 60 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (140 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (23 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:14:26] [INFO ] Invariant cache hit.
[2024-05-21 22:14:26] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:14:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:14:26] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-21 22:14:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:14:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:14:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-21 22:14:26] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-05-21 22:14:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:14:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-21 22:14:26] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-21 22:14:27] [INFO ] Added : 145 causal constraints over 29 iterations in 708 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p94) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 330 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 329 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 328 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 327 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 326 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 325 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 324 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 323 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 322 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 321 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 320 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 319 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 318 transition count 259
Applied a total of 33 rules in 65 ms. Remains 318 /351 variables (removed 33) and now considering 259/292 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 318/351 places, 259/292 transitions.
// Phase 1: matrix 259 rows 318 cols
[2024-05-21 22:14:28] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13699 resets) in 2042 ms. (489 steps per ms)
BEST_FIRST walk for 1000001 steps (2316 resets) in 957 ms. (1043 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:14:31] [INFO ] Invariant cache hit.
[2024-05-21 22:14:31] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:14:31] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 22:14:31] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 22:14:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:14:31] [INFO ] [Real]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-21 22:14:31] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:14:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:14:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 22:14:31] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 22:14:31] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-21 22:14:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 22:14:31] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:14:31] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:14:31] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
[2024-05-21 22:14:31] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:14:31] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:14:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 345 ms
[2024-05-21 22:14:31] [INFO ] Computed and/alt/rep : 250/436/250 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 22:14:32] [INFO ] Added : 145 causal constraints over 29 iterations in 627 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 259/259 transitions.
Applied a total of 0 rules in 17 ms. Remains 318 /318 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 318/318 places, 259/259 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 259/259 transitions.
Applied a total of 0 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-21 22:14:33] [INFO ] Invariant cache hit.
[2024-05-21 22:14:33] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-21 22:14:33] [INFO ] Invariant cache hit.
[2024-05-21 22:14:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:14:41] [INFO ] Implicit Places using invariants and state equation in 7533 ms returned []
Implicit Place search using SMT with State Equation took 7890 ms to find 0 implicit places.
[2024-05-21 22:14:41] [INFO ] Redundant transitions in 5 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 22:14:41] [INFO ] Invariant cache hit.
[2024-05-21 22:14:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 2/316 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-21 22:14:45] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/317 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (OVERLAPS) 259/576 variables, 317/379 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 2/381 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-21 22:14:53] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:54] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:14:54] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:14:54] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:14:54] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 5/386 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-21 22:14:56] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:14:57] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 2/388 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/388 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 14 (OVERLAPS) 1/577 variables, 1/389 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/577 variables, 0/389 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-21 22:15:07] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-21 22:15:07] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 22:15:07] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-21 22:15:07] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-21 22:15:07] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/577 variables, 5/394 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/577 variables, 0/394 constraints. Problems are: Problem set: 64 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 394 constraints, problems are : Problem set: 64 solved, 192 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 64 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 35/35 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 17/52 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/65 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/65 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 2/252 variables, 1/66 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/66 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 65/317 variables, 8/74 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-21 22:15:14] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/75 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-21 22:15:14] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:15:14] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/77 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/77 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 259/576 variables, 317/394 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 2/396 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 192/588 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/588 constraints. Problems are: Problem set: 64 solved, 192 unsolved
SMT process timed out in 60238ms, After SMT, problems are : Problem set: 64 solved, 192 unsolved
Search for dead transitions found 64 dead transitions in 60243ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 318/318 places, 195/259 transitions.
Graph (complete) has 850 edges and 318 vertex of which 254 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 254 /318 variables (removed 64) and now considering 195/195 (removed 0) transitions.
// Phase 1: matrix 195 rows 254 cols
[2024-05-21 22:15:41] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 22:15:41] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 22:15:41] [INFO ] Invariant cache hit.
[2024-05-21 22:15:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:15:41] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 254/318 places, 195/259 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68622 ms. Remains : 254/318 places, 195/259 transitions.
[2024-05-21 22:15:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13682 resets) in 1827 ms. (547 steps per ms)
BEST_FIRST walk for 1000001 steps (2291 resets) in 873 ms. (1144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:15:44] [INFO ] Invariant cache hit.
[2024-05-21 22:15:44] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 22:15:44] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 22:15:44] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-21 22:15:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:15:44] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 22:15:44] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 22:15:44] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-21 22:15:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:15:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-21 22:15:44] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:15:44] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:15:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2024-05-21 22:15:44] [INFO ] Computed and/alt/rep : 186/298/186 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-21 22:15:45] [INFO ] Added : 144 causal constraints over 30 iterations in 468 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 195/195 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 254/254 places, 195/195 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 195/195 transitions.
Applied a total of 0 rules in 17 ms. Remains 254 /254 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-21 22:15:45] [INFO ] Invariant cache hit.
[2024-05-21 22:15:45] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 22:15:45] [INFO ] Invariant cache hit.
[2024-05-21 22:15:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:15:46] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-21 22:15:46] [INFO ] Redundant transitions in 2 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-21 22:15:46] [INFO ] Invariant cache hit.
[2024-05-21 22:15:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 2/252 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 1/253 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 195/448 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (OVERLAPS) 1/449 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-21 22:15:53] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-21 22:15:53] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-21 22:15:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:15:53] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:15:53] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:15:53] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:15:53] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:15:54] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:15:54] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:15:55] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 10/327 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-21 22:15:57] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:15:57] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/449 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 16 (OVERLAPS) 0/449 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 329 constraints, problems are : Problem set: 0 solved, 192 unsolved in 16225 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 2/252 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (OVERLAPS) 195/448 variables, 253/326 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 192/520 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-21 22:16:11] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/449 variables, and 521 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 253/254 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 13/13 constraints]
After SMT, in 46343ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 46345ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46773 ms. Remains : 254/254 places, 195/195 transitions.
RANDOM walk for 40000 steps (542 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1039082 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 2
Probabilistic random walk after 1039082 steps, saw 146579 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
[2024-05-21 22:16:35] [INFO ] Invariant cache hit.
[2024-05-21 22:16:35] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 89/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/151 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/176 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/183 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 132/315 variables, 183/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/327 variables, 8/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/328 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/328 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/390 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/390 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/390 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/449 variables, 59/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/449 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/449 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 317 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 89/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/151 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:16:35] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:16:35] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/176 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/183 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 132/315 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/327 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:16:36] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:16:36] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:16:36] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 62/390 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/390 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/390 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 59/449 variables, 59/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/449 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/449 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 324 constraints, problems are : Problem set: 0 solved, 2 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 831ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1043 ms.
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 195/195 transitions.
Applied a total of 0 rules in 13 ms. Remains 254 /254 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 254/254 places, 195/195 transitions.
RANDOM walk for 40000 steps (555 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (88 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (86 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1080447 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 2
Probabilistic random walk after 1080447 steps, saw 151513 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
[2024-05-21 22:16:40] [INFO ] Invariant cache hit.
[2024-05-21 22:16:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 89/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/151 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/176 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/183 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 132/315 variables, 183/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/327 variables, 8/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/328 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/328 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/390 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/390 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/390 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/449 variables, 59/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/449 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/449 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 317 constraints, problems are : Problem set: 0 solved, 2 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 89/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/151 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:16:40] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:16:40] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/176 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/183 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 132/315 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/327 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:16:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:16:41] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:16:41] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 62/390 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/390 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/390 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 59/449 variables, 59/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/449 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/449 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 324 constraints, problems are : Problem set: 0 solved, 2 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 801ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 51618 steps, including 320 resets, run visited all 2 properties in 528 ms. (steps per millisecond=97 )
Parikh walk visited 2 properties in 534 ms.
FORMULA DES-PT-60a-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60a-UpperBounds-02 in 135527 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:16:41] [INFO ] Computed 60 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (138 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:16:41] [INFO ] Invariant cache hit.
[2024-05-21 22:16:41] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:16:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:16:42] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-21 22:16:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:16:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2024-05-21 22:16:42] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-21 22:16:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:16:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:16:42] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2024-05-21 22:16:43] [INFO ] Added : 136 causal constraints over 28 iterations in 663 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p38) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 330 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 329 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 328 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 327 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 326 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 325 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 324 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 323 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 322 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 321 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 320 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 319 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 318 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 317 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 316 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 315 transition count 256
Applied a total of 36 rules in 52 ms. Remains 315 /351 variables (removed 36) and now considering 256/292 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 315/351 places, 256/292 transitions.
// Phase 1: matrix 256 rows 315 cols
[2024-05-21 22:16:43] [INFO ] Computed 61 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13711 resets) in 1884 ms. (530 steps per ms)
BEST_FIRST walk for 1000001 steps (2253 resets) in 893 ms. (1118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:16:46] [INFO ] Invariant cache hit.
[2024-05-21 22:16:46] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:16:46] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 22:16:46] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-21 22:16:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 22:16:46] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 22:16:46] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-21 22:16:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:16:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-21 22:16:46] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:16:46] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:16:46] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:16:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 261 ms
[2024-05-21 22:16:46] [INFO ] Computed and/alt/rep : 247/359/247 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 22:16:47] [INFO ] Added : 136 causal constraints over 28 iterations in 516 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 256/256 transitions.
Applied a total of 0 rules in 6 ms. Remains 315 /315 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 315/315 places, 256/256 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 315 /315 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 22:16:47] [INFO ] Invariant cache hit.
[2024-05-21 22:16:47] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 22:16:47] [INFO ] Invariant cache hit.
[2024-05-21 22:16:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:16:48] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-21 22:16:48] [INFO ] Redundant transitions in 2 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 22:16:48] [INFO ] Invariant cache hit.
[2024-05-21 22:16:48] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 2/314 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 7 (OVERLAPS) 256/570 variables, 314/375 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 2/377 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-21 22:16:58] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 22:16:58] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:16:58] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:16:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 4/381 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-21 22:17:02] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:17:02] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:17:02] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:17:02] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 4/385 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-21 22:17:03] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 1/386 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-21 22:17:07] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 1/387 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 0/387 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 14 (OVERLAPS) 1/571 variables, 1/388 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 0/388 constraints. Problems are: Problem set: 68 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/571 variables, and 388 constraints, problems are : Problem set: 68 solved, 185 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 315/315 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 68 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 35/35 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 17/52 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 7/59 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/59 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/244 variables, 1/60 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-21 22:17:19] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 1/61 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/61 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 70/314 variables, 8/69 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 3/72 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-21 22:17:22] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 1/73 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/73 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 256/570 variables, 314/387 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 2/389 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 185/574 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-21 22:17:34] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 1/575 constraints. Problems are: Problem set: 68 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/571 variables, and 575 constraints, problems are : Problem set: 68 solved, 185 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/315 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/253 constraints, Known Traps: 13/13 constraints]
After SMT, in 60187ms problems are : Problem set: 68 solved, 185 unsolved
Search for dead transitions found 68 dead transitions in 60191ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 315/315 places, 188/256 transitions.
Graph (complete) has 820 edges and 315 vertex of which 247 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.0 ms
Discarding 68 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 247 /315 variables (removed 68) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 247 cols
[2024-05-21 22:17:48] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 22:17:48] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 22:17:48] [INFO ] Invariant cache hit.
[2024-05-21 22:17:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:17:48] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 247/315 places, 188/256 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61131 ms. Remains : 247/315 places, 188/256 transitions.
[2024-05-21 22:17:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13524 resets) in 1947 ms. (513 steps per ms)
BEST_FIRST walk for 1000001 steps (2280 resets) in 956 ms. (1044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:17:51] [INFO ] Invariant cache hit.
[2024-05-21 22:17:51] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 22:17:51] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 22:17:51] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-21 22:17:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:17:52] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-21 22:17:52] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 22:17:52] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-21 22:17:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:17:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 22:17:52] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:17:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-21 22:17:52] [INFO ] Computed and/alt/rep : 179/283/179 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 22:17:52] [INFO ] Added : 133 causal constraints over 27 iterations in 403 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 247 /247 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 247/247 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 247 /247 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-21 22:17:53] [INFO ] Invariant cache hit.
[2024-05-21 22:17:53] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 22:17:53] [INFO ] Invariant cache hit.
[2024-05-21 22:17:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:17:53] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2024-05-21 22:17:53] [INFO ] Redundant transitions in 0 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 22:17:53] [INFO ] Invariant cache hit.
[2024-05-21 22:17:53] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 1/244 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 2/246 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 188/434 variables, 246/307 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 22:17:58] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:17:58] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:17:58] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:17:59] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:17:59] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-21 22:17:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:18:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 1/435 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 22:18:03] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-21 22:18:03] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-05-21 22:18:03] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:18:03] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:18:03] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 22:18:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:18:08] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:18:08] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/435 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (OVERLAPS) 0/435 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 325 constraints, problems are : Problem set: 0 solved, 185 unsolved in 19560 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 247/247 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/244 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 2/246 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 22:18:15] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 188/434 variables, 246/322 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 185/509 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 22:18:23] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 22:18:37] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/435 variables, and 511 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 246/247 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 17/18 constraints]
After SMT, in 49664ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 49667ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50071 ms. Remains : 247/247 places, 188/188 transitions.
RANDOM walk for 40000 steps (547 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (96 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 988872 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 2
Probabilistic random walk after 988872 steps, saw 139955 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
[2024-05-21 22:18:46] [INFO ] Invariant cache hit.
[2024-05-21 22:18:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 86/109 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/169 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/176 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 125/301 variables, 176/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/313 variables, 8/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/314 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/314 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/376 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/435 variables, 59/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/435 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 247/247 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 86/109 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/169 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/176 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 125/301 variables, 176/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/313 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/313 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/314 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/314 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/376 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/376 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/435 variables, 59/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/435 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/435 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 312 constraints, problems are : Problem set: 0 solved, 2 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 247/247 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1190 steps, including 1 resets, run visited all 2 properties in 11 ms. (steps per millisecond=108 )
Parikh walk visited 2 properties in 11 ms.
FORMULA DES-PT-60a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60a-UpperBounds-03 in 124970 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:18:46] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (132 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:18:46] [INFO ] Invariant cache hit.
[2024-05-21 22:18:46] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:18:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:18:47] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-05-21 22:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 22:18:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:18:47] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-21 22:18:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:18:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 22:18:47] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:18:47] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:18:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2024-05-21 22:18:47] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-21 22:18:48] [INFO ] Added : 245 causal constraints over 49 iterations in 1177 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p69) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Applied a total of 8 rules in 17 ms. Remains 343 /351 variables (removed 8) and now considering 284/292 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 343/351 places, 284/292 transitions.
// Phase 1: matrix 284 rows 343 cols
[2024-05-21 22:18:49] [INFO ] Computed 61 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13618 resets) in 1923 ms. (519 steps per ms)
BEST_FIRST walk for 1000001 steps (2238 resets) in 872 ms. (1145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:18:52] [INFO ] Invariant cache hit.
[2024-05-21 22:18:52] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:18:52] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 22:18:52] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-21 22:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 22:18:52] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 22:18:52] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-21 22:18:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:18:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2024-05-21 22:18:52] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-21 22:18:52] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:18:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2024-05-21 22:18:52] [INFO ] Computed and/alt/rep : 275/461/275 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 22:18:53] [INFO ] Added : 245 causal constraints over 50 iterations in 1062 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 284/284 transitions.
Applied a total of 0 rules in 5 ms. Remains 343 /343 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 343/343 places, 284/284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 284/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 343 /343 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-21 22:18:54] [INFO ] Invariant cache hit.
[2024-05-21 22:18:54] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 22:18:54] [INFO ] Invariant cache hit.
[2024-05-21 22:18:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:18:55] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-21 22:18:55] [INFO ] Redundant transitions in 2 ms returned []
Running 281 sub problems to find dead transitions.
[2024-05-21 22:18:55] [INFO ] Invariant cache hit.
[2024-05-21 22:18:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 2/341 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 281 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/342 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 8 (OVERLAPS) 284/626 variables, 342/403 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 2/405 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 0/405 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 11 (OVERLAPS) 1/627 variables, 1/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 0/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 13 (OVERLAPS) 0/627 variables, 0/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 406 constraints, problems are : Problem set: 14 solved, 267 unsolved in 19823 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 343/343 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 35/35 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/52 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-21 22:19:15] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 1/53 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/54 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 15/342 variables, 8/62 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-21 22:19:19] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-21 22:19:21] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:19:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2024-05-21 22:19:21] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:19:21] [INFO ] Deduced a trap composed of 52 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 5/67 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-21 22:19:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:19:22] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/69 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/69 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 284/626 variables, 342/411 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 2/413 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 267/680 constraints. Problems are: Problem set: 14 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/627 variables, and 680 constraints, problems are : Problem set: 14 solved, 267 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 342/343 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/281 constraints, Known Traps: 8/8 constraints]
After SMT, in 50031ms problems are : Problem set: 14 solved, 267 unsolved
Search for dead transitions found 14 dead transitions in 50034ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 343/343 places, 270/284 transitions.
Graph (complete) has 1150 edges and 343 vertex of which 329 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 329 /343 variables (removed 14) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 329 cols
[2024-05-21 22:19:45] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 22:19:45] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 22:19:45] [INFO ] Invariant cache hit.
[2024-05-21 22:19:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:19:45] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 329/343 places, 270/284 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51265 ms. Remains : 329/343 places, 270/284 transitions.
[2024-05-21 22:19:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13744 resets) in 1933 ms. (517 steps per ms)
BEST_FIRST walk for 1000001 steps (2255 resets) in 911 ms. (1096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:19:48] [INFO ] Invariant cache hit.
[2024-05-21 22:19:48] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 22:19:48] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-21 22:19:48] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 22:19:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:19:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-21 22:19:48] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 22:19:48] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-21 22:19:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:19:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2024-05-21 22:19:48] [INFO ] Computed and/alt/rep : 261/423/261 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 22:19:49] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:19:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-21 22:19:49] [INFO ] Added : 197 causal constraints over 40 iterations in 905 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 270/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 329 /329 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 329/329 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 329 /329 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-21 22:19:50] [INFO ] Invariant cache hit.
[2024-05-21 22:19:50] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-21 22:19:50] [INFO ] Invariant cache hit.
[2024-05-21 22:19:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:19:51] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-21 22:19:51] [INFO ] Redundant transitions in 1 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-21 22:19:51] [INFO ] Invariant cache hit.
[2024-05-21 22:19:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 22:19:55] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:19:57] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/328 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 270/598 variables, 328/391 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 22:20:05] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-21 22:20:05] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
[2024-05-21 22:20:05] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-21 22:20:06] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 13 (OVERLAPS) 1/599 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 22:20:14] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:20:14] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:20:14] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:20:15] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 4/402 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 22:20:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:20:18] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 22:20:18] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 3 ms to minimize.
[2024-05-21 22:20:18] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/599 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/599 variables, and 406 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 2/327 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 22:20:23] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:20:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:20:24] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 22:20:25] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:20:26] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 12 (OVERLAPS) 270/598 variables, 328/408 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/598 variables, 267/677 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 22:20:45] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 678 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 328/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 20/20 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60816 ms. Remains : 329/329 places, 270/270 transitions.
RANDOM walk for 40000 steps (550 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (85 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1025115 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :0 out of 2
Probabilistic random walk after 1025115 steps, saw 144805 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
[2024-05-21 22:20:54] [INFO ] Invariant cache hit.
[2024-05-21 22:20:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 139/191 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/226 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/251 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/258 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 207/465 variables, 258/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/477 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/478 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/540 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/540 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/599 variables, 59/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/599 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/599 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/191 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/226 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/251 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/258 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 207/465 variables, 258/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/477 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/477 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/478 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/540 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/540 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/599 variables, 59/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/599 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/599 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/599 variables, and 394 constraints, problems are : Problem set: 0 solved, 2 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 947ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2516 steps, including 1 resets, run visited all 2 properties in 22 ms. (steps per millisecond=114 )
Parikh walk visited 2 properties in 21 ms.
FORMULA DES-PT-60a-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60a-UpperBounds-06 in 128573 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:20:55] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (139 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:20:55] [INFO ] Invariant cache hit.
[2024-05-21 22:20:55] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 22:20:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:20:55] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-21 22:20:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:20:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 22:20:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:20:55] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-05-21 22:20:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:20:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:20:55] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 22:20:56] [INFO ] Added : 197 causal constraints over 40 iterations in 918 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p201) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Applied a total of 20 rules in 23 ms. Remains 331 /351 variables (removed 20) and now considering 272/292 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 331/351 places, 272/292 transitions.
// Phase 1: matrix 272 rows 331 cols
[2024-05-21 22:20:57] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13576 resets) in 1916 ms. (521 steps per ms)
BEST_FIRST walk for 1000001 steps (2294 resets) in 899 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:21:00] [INFO ] Invariant cache hit.
[2024-05-21 22:21:00] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:21:00] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:21:00] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-21 22:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:21:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 22:21:00] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:21:00] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-21 22:21:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:21:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:21:00] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-21 22:21:00] [INFO ] Computed and/alt/rep : 263/441/263 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 22:21:01] [INFO ] Added : 209 causal constraints over 42 iterations in 945 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 331 /331 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 331/331 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 331 /331 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-21 22:21:02] [INFO ] Invariant cache hit.
[2024-05-21 22:21:02] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 22:21:02] [INFO ] Invariant cache hit.
[2024-05-21 22:21:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:21:02] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-21 22:21:02] [INFO ] Redundant transitions in 2 ms returned []
Running 269 sub problems to find dead transitions.
[2024-05-21 22:21:02] [INFO ] Invariant cache hit.
[2024-05-21 22:21:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 2/329 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 1/330 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 269 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 7 (OVERLAPS) 272/602 variables, 330/391 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 2/393 constraints. Problems are: Problem set: 31 solved, 238 unsolved
[2024-05-21 22:21:13] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-21 22:21:13] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:21:14] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:21:15] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 4/397 constraints. Problems are: Problem set: 31 solved, 238 unsolved
[2024-05-21 22:21:16] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:21:16] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-21 22:21:16] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-21 22:21:19] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 4/401 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/401 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/603 variables, 1/402 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 0/402 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/603 variables, 0/402 constraints. Problems are: Problem set: 31 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 402 constraints, problems are : Problem set: 31 solved, 238 unsolved in 27767 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 331/331 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 31 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 6/58 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/58 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 2/298 variables, 1/59 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/60 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/60 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 32/330 variables, 8/68 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/69 constraints. Problems are: Problem set: 31 solved, 238 unsolved
[2024-05-21 22:21:33] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:21:35] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:21:35] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 3/72 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/72 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 272/602 variables, 330/402 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 2/404 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 238/642 constraints. Problems are: Problem set: 31 solved, 238 unsolved
[2024-05-21 22:21:51] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-21 22:21:52] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/603 variables, and 644 constraints, problems are : Problem set: 31 solved, 238 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 330/331 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/269 constraints, Known Traps: 13/13 constraints]
After SMT, in 57975ms problems are : Problem set: 31 solved, 238 unsolved
Search for dead transitions found 31 dead transitions in 57978ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 331/331 places, 241/272 transitions.
Graph (complete) has 1041 edges and 331 vertex of which 300 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 300 /331 variables (removed 31) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 300 cols
[2024-05-21 22:22:00] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 22:22:01] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 22:22:01] [INFO ] Invariant cache hit.
[2024-05-21 22:22:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:22:01] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/331 places, 241/272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59124 ms. Remains : 300/331 places, 241/272 transitions.
[2024-05-21 22:22:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13715 resets) in 1884 ms. (530 steps per ms)
BEST_FIRST walk for 1000001 steps (2274 resets) in 894 ms. (1117 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:22:04] [INFO ] Invariant cache hit.
[2024-05-21 22:22:04] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 22:22:04] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 22:22:04] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-21 22:22:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:22:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 22:22:04] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:22:04] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-21 22:22:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:22:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 22:22:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-21 22:22:04] [INFO ] Computed and/alt/rep : 232/378/232 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 22:22:05] [INFO ] Added : 167 causal constraints over 34 iterations in 652 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 300/300 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-21 22:22:05] [INFO ] Invariant cache hit.
[2024-05-21 22:22:05] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 22:22:05] [INFO ] Invariant cache hit.
[2024-05-21 22:22:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:22:06] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-21 22:22:06] [INFO ] Redundant transitions in 2 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-21 22:22:06] [INFO ] Invariant cache hit.
[2024-05-21 22:22:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/298 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:22:10] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 241/540 variables, 299/361 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-21 22:22:20] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 22:22:20] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-21 22:22:20] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 371 constraints, problems are : Problem set: 0 solved, 238 unsolved in 22713 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 2/298 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:22:32] [INFO ] Deduced a trap composed of 40 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:22:33] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:22:33] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 241/540 variables, 299/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 238/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:22:48] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:22:50] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 613 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 299/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 13/13 constraints]
After SMT, in 52865ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 52870ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53359 ms. Remains : 300/300 places, 241/241 transitions.
RANDOM walk for 40000 steps (558 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (98 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1053450 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 2
Probabilistic random walk after 1053450 steps, saw 148379 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2024-05-21 22:23:02] [INFO ] Invariant cache hit.
[2024-05-21 22:23:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 108/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/186 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/220 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/229 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 178/407 variables, 229/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/419 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/420 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/482 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/541 variables, 59/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/186 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/220 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:23:02] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/229 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 178/407 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/419 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/420 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/482 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/482 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/482 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/541 variables, 59/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/541 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 717ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1283 ms.
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 300/300 places, 241/241 transitions.
RANDOM walk for 40000 steps (566 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (97 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 970973 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 2
Probabilistic random walk after 970973 steps, saw 137764 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2024-05-21 22:23:07] [INFO ] Invariant cache hit.
[2024-05-21 22:23:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 108/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/186 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/220 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/229 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 178/407 variables, 229/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/419 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/420 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/482 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/541 variables, 59/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/186 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/220 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:23:07] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/229 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 178/407 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/419 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/420 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/482 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/482 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/482 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/541 variables, 59/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/541 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 687ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1715 ms.
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 300/300 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-21 22:23:09] [INFO ] Invariant cache hit.
[2024-05-21 22:23:09] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 22:23:09] [INFO ] Invariant cache hit.
[2024-05-21 22:23:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:23:10] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-21 22:23:10] [INFO ] Redundant transitions in 1 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-21 22:23:10] [INFO ] Invariant cache hit.
[2024-05-21 22:23:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/298 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:23:15] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 241/540 variables, 299/361 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:23:23] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:23:23] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:23:23] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-21 22:23:23] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 22:23:24] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:23:24] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-21 22:23:24] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 371 constraints, problems are : Problem set: 0 solved, 238 unsolved in 22826 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 2/298 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:23:36] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:23:37] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:23:37] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 241/540 variables, 299/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 238/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 22:23:52] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-21 22:23:54] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 613 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 299/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 13/13 constraints]
After SMT, in 52985ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 52987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53463 ms. Remains : 300/300 places, 241/241 transitions.
Attempting over-approximation, by ignoring read arcs.
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 300 transition count 241
Applied a total of 1 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 241 rows 300 cols
[2024-05-21 22:24:03] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 22:24:03] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 22:24:03] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:24:03] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 22:24:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 22:24:03] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:24:03] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
TRAPS : Iteration 1
[2024-05-21 22:24:03] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 22:24:03] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 525 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60a-UpperBounds-07 in 188376 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:24:03] [INFO ] Computed 60 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10000 steps (23 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:24:03] [INFO ] Invariant cache hit.
[2024-05-21 22:24:03] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:24:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:24:04] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-21 22:24:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:24:04] [INFO ] [Real]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-05-21 22:24:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:24:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 22:24:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 98 ms returned sat
[2024-05-21 22:24:04] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-21 22:24:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2024-05-21 22:24:04] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-21 22:24:04] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-21 22:24:04] [INFO ] Added : 97 causal constraints over 20 iterations in 547 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p128) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Applied a total of 7 rules in 11 ms. Remains 344 /351 variables (removed 7) and now considering 285/292 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 344/351 places, 285/292 transitions.
// Phase 1: matrix 285 rows 344 cols
[2024-05-21 22:24:05] [INFO ] Computed 61 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13638 resets) in 1953 ms. (511 steps per ms)
BEST_FIRST walk for 1000001 steps (2273 resets) in 913 ms. (1094 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:24:08] [INFO ] Invariant cache hit.
[2024-05-21 22:24:08] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 22:24:08] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:24:08] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-21 22:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:24:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-21 22:24:08] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-21 22:24:08] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-21 22:24:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:24:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 22:24:08] [INFO ] Computed and/alt/rep : 276/460/276 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-21 22:24:09] [INFO ] Added : 102 causal constraints over 21 iterations in 476 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 344/344 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-21 22:24:10] [INFO ] Invariant cache hit.
[2024-05-21 22:24:10] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 22:24:10] [INFO ] Invariant cache hit.
[2024-05-21 22:24:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:24:10] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-21 22:24:10] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-05-21 22:24:10] [INFO ] Invariant cache hit.
[2024-05-21 22:24:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 2/342 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 2/344 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 285/629 variables, 344/405 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 22:24:23] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-21 22:24:23] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:24:25] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 22:24:29] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:24:29] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 22:24:33] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:24:33] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 22:24:33] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 22:24:33] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:24:33] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:24:34] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:24:34] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:24:35] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 22:24:38] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:24:38] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:24:38] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 0.0)
(s66 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/629 variables, and 423 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 2/342 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 2/344 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 285/629 variables, 344/421 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 282/705 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 22:25:08] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 706 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 17/17 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60820 ms. Remains : 344/344 places, 285/285 transitions.
RANDOM walk for 40000 steps (548 resets) in 308 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (92 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 947850 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 2
Probabilistic random walk after 947850 steps, saw 134750 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
[2024-05-21 22:25:14] [INFO ] Invariant cache hit.
[2024-05-21 22:25:14] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/105 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/108 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/113 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/114 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/126 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/128 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/128 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/132 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 197/329 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/363 variables, 19/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/363 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/395 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:25:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/395 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/395 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/404 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/404 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 225/629 variables, 280/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/629 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/629 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/629 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 33 (OVERLAPS) 0/629 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 408 constraints, problems are : Problem set: 0 solved, 2 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/105 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/108 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/113 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/114 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/126 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/126 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/128 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/132 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 197/329 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/363 variables, 19/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/363 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/395 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/395 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/395 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/404 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/404 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 225/629 variables, 280/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/629 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/629 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/629 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/629 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 410 constraints, problems are : Problem set: 0 solved, 2 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 889ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1832 steps, including 1 resets, run visited all 2 properties in 24 ms. (steps per millisecond=76 )
Parikh walk visited 2 properties in 23 ms.
FORMULA DES-PT-60a-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60a-UpperBounds-10 in 71178 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:25:14] [INFO ] Computed 60 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (147 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:25:15] [INFO ] Invariant cache hit.
[2024-05-21 22:25:15] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:25:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:25:15] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-21 22:25:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:25:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:25:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:25:15] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-05-21 22:25:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:25:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 21 ms returned sat
[2024-05-21 22:25:15] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-21 22:25:15] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-21 22:25:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2024-05-21 22:25:15] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 22:25:16] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-21 22:25:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-21 22:25:17] [INFO ] Added : 261 causal constraints over 53 iterations in 1405 ms. Result :sat
Minimization took 180 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p9) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Applied a total of 7 rules in 11 ms. Remains 344 /351 variables (removed 7) and now considering 285/292 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 344/351 places, 285/292 transitions.
// Phase 1: matrix 285 rows 344 cols
[2024-05-21 22:25:17] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13648 resets) in 1884 ms. (530 steps per ms)
BEST_FIRST walk for 1000001 steps (2277 resets) in 886 ms. (1127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:25:20] [INFO ] Invariant cache hit.
[2024-05-21 22:25:20] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:25:20] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 22:25:20] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-21 22:25:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:25:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:25:20] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 22:25:20] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-05-21 22:25:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:25:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-21 22:25:20] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 22:25:21] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-21 22:25:21] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:25:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2024-05-21 22:25:21] [INFO ] Computed and/alt/rep : 276/446/276 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 22:25:22] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:25:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-21 22:25:22] [INFO ] Added : 254 causal constraints over 52 iterations in 1254 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 344/344 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 7 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-21 22:25:23] [INFO ] Invariant cache hit.
[2024-05-21 22:25:23] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 22:25:23] [INFO ] Invariant cache hit.
[2024-05-21 22:25:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:25:23] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-21 22:25:23] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-05-21 22:25:23] [INFO ] Invariant cache hit.
[2024-05-21 22:25:23] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 1/341 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 2/343 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 7 (OVERLAPS) 285/628 variables, 343/404 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 2/406 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/406 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 1/629 variables, 1/407 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-21 22:25:42] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-21 22:25:42] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:25:43] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-21 22:25:43] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 4/411 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-21 22:25:46] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:25:46] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-21 22:25:49] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 3/414 constraints. Problems are: Problem set: 10 solved, 272 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 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 629/629 variables, and 414 constraints, problems are : Problem set: 10 solved, 272 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 10 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 35/35 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 17/52 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 6/58 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/58 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/331 variables, 1/59 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-21 22:25:55] [INFO ] Deduced a trap composed of 61 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 1/60 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/60 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 12/343 variables, 8/68 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/69 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-21 22:26:00] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/70 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/70 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 11 (OVERLAPS) 285/628 variables, 343/413 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 2/415 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 272/687 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-21 22:26:22] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/629 variables, and 688 constraints, problems are : Problem set: 10 solved, 272 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 343/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 272/282 constraints, Known Traps: 10/10 constraints]
After SMT, in 60224ms problems are : Problem set: 10 solved, 272 unsolved
Search for dead transitions found 10 dead transitions in 60227ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 344/344 places, 275/285 transitions.
Graph (complete) has 1168 edges and 344 vertex of which 334 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 334 /344 variables (removed 10) and now considering 275/275 (removed 0) transitions.
// Phase 1: matrix 275 rows 334 cols
[2024-05-21 22:26:24] [INFO ] Computed 61 invariants in 7 ms
[2024-05-21 22:26:24] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 22:26:24] [INFO ] Invariant cache hit.
[2024-05-21 22:26:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:26:24] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 334/344 places, 275/285 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61403 ms. Remains : 334/344 places, 275/285 transitions.
[2024-05-21 22:26:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13622 resets) in 1892 ms. (528 steps per ms)
BEST_FIRST walk for 1000001 steps (2304 resets) in 869 ms. (1149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:26:27] [INFO ] Invariant cache hit.
[2024-05-21 22:26:27] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 22:26:27] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 22:26:27] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-21 22:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:26:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-21 22:26:27] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-21 22:26:27] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-21 22:26:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:26:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 22:26:27] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-21 22:26:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-21 22:26:27] [INFO ] Computed and/alt/rep : 266/428/266 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 22:26:28] [INFO ] Added : 251 causal constraints over 51 iterations in 1069 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 275/275 transitions.
Applied a total of 0 rules in 5 ms. Remains 334 /334 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 334/334 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 275/275 transitions.
Applied a total of 0 rules in 5 ms. Remains 334 /334 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2024-05-21 22:26:29] [INFO ] Invariant cache hit.
[2024-05-21 22:26:29] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 22:26:29] [INFO ] Invariant cache hit.
[2024-05-21 22:26:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:26:29] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-21 22:26:29] [INFO ] Redundant transitions in 1 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-21 22:26:29] [INFO ] Invariant cache hit.
[2024-05-21 22:26:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 1/331 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 2/333 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 275/608 variables, 333/394 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 1/609 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 22:26:47] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:26:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:26:50] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:26:50] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:26:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 22:26:52] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:26:52] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 3 ms to minimize.
[2024-05-21 22:26:52] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:26:53] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/609 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 22:26:58] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/609 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/609 variables, and 407 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/331 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 2/333 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 22:27:03] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:27:03] [INFO ] Deduced a trap composed of 60 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:27:05] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 2 ms to minimize.
[2024-05-21 22:27:05] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 275/608 variables, 333/407 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 272/681 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 681 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 13/14 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60736 ms. Remains : 334/334 places, 275/275 transitions.
RANDOM walk for 40000 steps (548 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (89 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1054971 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 2
Probabilistic random walk after 1054971 steps, saw 148583 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2024-05-21 22:27:33] [INFO ] Invariant cache hit.
[2024-05-21 22:27:33] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/487 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/488 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/550 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/609 variables, 59/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:27:34] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/487 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/488 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/488 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/550 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/550 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/550 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/609 variables, 59/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 983ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1685 ms.
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 275/275 transitions.
Applied a total of 0 rules in 5 ms. Remains 334 /334 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 334/334 places, 275/275 transitions.
RANDOM walk for 40000 steps (531 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (84 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1090453 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 2
Probabilistic random walk after 1090453 steps, saw 152710 distinct states, run finished after 3001 ms. (steps per millisecond=363 ) properties seen :0
[2024-05-21 22:27:39] [INFO ] Invariant cache hit.
[2024-05-21 22:27:39] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/487 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/488 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/550 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/609 variables, 59/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:27:39] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/487 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/488 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/488 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/550 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/550 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/550 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/609 variables, 59/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1108ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 39872 steps, including 119 resets, run visited all 2 properties in 287 ms. (steps per millisecond=138 )
Parikh walk visited 2 properties in 286 ms.
FORMULA DES-PT-60a-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60a-UpperBounds-12 in 145506 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:27:40] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (132 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:27:40] [INFO ] Invariant cache hit.
[2024-05-21 22:27:40] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:27:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 22:27:40] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-21 22:27:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:27:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-21 22:27:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-21 22:27:40] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-21 22:27:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:27:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-21 22:27:40] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 22:27:41] [INFO ] Added : 170 causal constraints over 34 iterations in 781 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p87) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 330 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 329 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 328 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 327 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 326 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 325 transition count 266
Applied a total of 26 rules in 26 ms. Remains 325 /351 variables (removed 26) and now considering 266/292 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 325/351 places, 266/292 transitions.
// Phase 1: matrix 266 rows 325 cols
[2024-05-21 22:27:42] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13614 resets) in 1868 ms. (535 steps per ms)
BEST_FIRST walk for 1000000 steps (2304 resets) in 865 ms. (1154 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:27:45] [INFO ] Invariant cache hit.
[2024-05-21 22:27:45] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:27:45] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 22:27:45] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-21 22:27:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:27:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:27:45] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 22:27:45] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-21 22:27:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:27:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-05-21 22:27:45] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:27:45] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 22:27:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2024-05-21 22:27:45] [INFO ] Computed and/alt/rep : 257/443/257 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 22:27:46] [INFO ] Added : 174 causal constraints over 36 iterations in 719 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 325 /325 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 325/325 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 325 /325 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-21 22:27:46] [INFO ] Invariant cache hit.
[2024-05-21 22:27:47] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 22:27:47] [INFO ] Invariant cache hit.
[2024-05-21 22:27:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:27:47] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2024-05-21 22:27:47] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-21 22:27:47] [INFO ] Invariant cache hit.
[2024-05-21 22:27:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/323 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/324 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 8 (OVERLAPS) 266/590 variables, 324/385 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 2/387 constraints. Problems are: Problem set: 50 solved, 213 unsolved
[2024-05-21 22:27:56] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:27:56] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:27:56] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-21 22:27:56] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:27:56] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:27:57] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:27:57] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:27:57] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/590 variables, 8/395 constraints. Problems are: Problem set: 50 solved, 213 unsolved
[2024-05-21 22:27:59] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-21 22:28:01] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:28:01] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 3/398 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/398 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 13 (OVERLAPS) 1/591 variables, 1/399 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/399 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 15 (OVERLAPS) 0/591 variables, 0/399 constraints. Problems are: Problem set: 50 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 399 constraints, problems are : Problem set: 50 solved, 213 unsolved in 23001 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 325/325 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 50 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 35/35 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 17/52 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 9/61 constraints. Problems are: Problem set: 50 solved, 213 unsolved
[2024-05-21 22:28:10] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 1/62 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/62 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 2/273 variables, 1/63 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/64 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/64 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 51/324 variables, 8/72 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/73 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/73 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 266/590 variables, 324/397 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 2/399 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 213/612 constraints. Problems are: Problem set: 50 solved, 213 unsolved
[2024-05-21 22:28:27] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 1/613 constraints. Problems are: Problem set: 50 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/591 variables, and 613 constraints, problems are : Problem set: 50 solved, 213 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 324/325 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/263 constraints, Known Traps: 13/13 constraints]
After SMT, in 53206ms problems are : Problem set: 50 solved, 213 unsolved
Search for dead transitions found 50 dead transitions in 53209ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 325/325 places, 216/266 transitions.
Graph (complete) has 934 edges and 325 vertex of which 275 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 275 /325 variables (removed 50) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 275 cols
[2024-05-21 22:28:40] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 22:28:40] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 22:28:40] [INFO ] Invariant cache hit.
[2024-05-21 22:28:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:28:41] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 275/325 places, 216/266 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54320 ms. Remains : 275/325 places, 216/266 transitions.
[2024-05-21 22:28:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13634 resets) in 1861 ms. (537 steps per ms)
BEST_FIRST walk for 1000001 steps (2282 resets) in 879 ms. (1136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:28:43] [INFO ] Invariant cache hit.
[2024-05-21 22:28:43] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 22:28:43] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 22:28:44] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-21 22:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:28:44] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 22:28:44] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-21 22:28:44] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-21 22:28:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:28:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 22:28:44] [INFO ] Computed and/alt/rep : 207/333/207 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 22:28:44] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-21 22:28:44] [INFO ] Added : 174 causal constraints over 36 iterations in 669 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 275 /275 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 275/275 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 275 /275 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-21 22:28:45] [INFO ] Invariant cache hit.
[2024-05-21 22:28:45] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 22:28:45] [INFO ] Invariant cache hit.
[2024-05-21 22:28:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:28:45] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-21 22:28:45] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-21 22:28:45] [INFO ] Invariant cache hit.
[2024-05-21 22:28:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/273 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-21 22:28:51] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-21 22:28:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:28:53] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-21 22:28:55] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-21 22:28:56] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-21 22:28:57] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:28:58] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 15 (OVERLAPS) 1/491 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 17 (OVERLAPS) 0/491 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 345 constraints, problems are : Problem set: 0 solved, 213 unsolved in 19727 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/275 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 2/273 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-21 22:29:06] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-21 22:29:06] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 216/490 variables, 274/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 213/559 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-21 22:29:17] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:29:17] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:29:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 3/562 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/491 variables, and 562 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 274/275 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints]
After SMT, in 49845ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 49847ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50303 ms. Remains : 275/275 places, 216/216 transitions.
RANDOM walk for 40000 steps (550 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (89 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1177819 steps, run timeout after 3001 ms. (steps per millisecond=392 ) properties seen :0 out of 2
Probabilistic random walk after 1177819 steps, saw 164935 distinct states, run finished after 3001 ms. (steps per millisecond=392 ) properties seen :0
[2024-05-21 22:29:38] [INFO ] Invariant cache hit.
[2024-05-21 22:29:38] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 103/137 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/172 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/197 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/204 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 153/357 variables, 204/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/369 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/370 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/432 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/491 variables, 59/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/491 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/491 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/275 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/137 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/172 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/197 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/204 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 153/357 variables, 204/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/369 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/369 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/370 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/432 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/491 variables, 59/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 340 constraints, problems are : Problem set: 0 solved, 2 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/275 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 650ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21487 steps, including 31 resets, run visited all 2 properties in 146 ms. (steps per millisecond=147 )
Parikh walk visited 2 properties in 145 ms.
FORMULA DES-PT-60a-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60a-UpperBounds-14 in 119075 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-21 22:29:39] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (133 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (23 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:29:39] [INFO ] Invariant cache hit.
[2024-05-21 22:29:39] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 22:29:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:29:39] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 22:29:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:29:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:29:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 22:29:39] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-21 22:29:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:29:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-21 22:29:39] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 22:29:40] [INFO ] Added : 72 causal constraints over 15 iterations in 372 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p232) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 330 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 329 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 328 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 327 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 326 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 325 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 324 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 323 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 322 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 321 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 320 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 319 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 318 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 317 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 316 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 315 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 37 place count 314 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 38 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 38 with 1 rules applied. Total rules applied 39 place count 312 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 39 with 1 rules applied. Total rules applied 40 place count 311 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 40 with 1 rules applied. Total rules applied 41 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 41 with 1 rules applied. Total rules applied 42 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 42 with 1 rules applied. Total rules applied 43 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 43 with 1 rules applied. Total rules applied 44 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 44 with 1 rules applied. Total rules applied 45 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 45 with 1 rules applied. Total rules applied 46 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 46 with 1 rules applied. Total rules applied 47 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 47 with 1 rules applied. Total rules applied 48 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 49 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 49 with 1 rules applied. Total rules applied 50 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 50 with 1 rules applied. Total rules applied 51 place count 300 transition count 241
Applied a total of 51 rules in 46 ms. Remains 300 /351 variables (removed 51) and now considering 241/292 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 300/351 places, 241/292 transitions.
// Phase 1: matrix 241 rows 300 cols
[2024-05-21 22:29:40] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13726 resets) in 1839 ms. (543 steps per ms)
BEST_FIRST walk for 1000001 steps (2297 resets) in 875 ms. (1141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:29:43] [INFO ] Invariant cache hit.
[2024-05-21 22:29:43] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:29:43] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 22:29:43] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-21 22:29:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:29:43] [INFO ] [Real]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 22:29:43] [INFO ] Computed and/alt/rep : 233/419/233 causal constraints (skipped 5 transitions) in 12 ms.
[2024-05-21 22:29:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:29:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 22:29:43] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 22:29:43] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 22:29:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-21 22:29:43] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:29:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:29:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2024-05-21 22:29:44] [INFO ] Computed and/alt/rep : 233/419/233 causal constraints (skipped 5 transitions) in 11 ms.
[2024-05-21 22:29:44] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:29:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:29:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2024-05-21 22:29:44] [INFO ] Added : 85 causal constraints over 18 iterations in 532 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 300/300 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-21 22:29:44] [INFO ] Invariant cache hit.
[2024-05-21 22:29:44] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 22:29:44] [INFO ] Invariant cache hit.
[2024-05-21 22:29:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:29:45] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-21 22:29:45] [INFO ] Redundant transitions in 1 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-21 22:29:45] [INFO ] Invariant cache hit.
[2024-05-21 22:29:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/298 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 1/299 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 7 (OVERLAPS) 241/540 variables, 299/360 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 2/362 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-05-21 22:29:53] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:29:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:29:53] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:29:54] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 4/366 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/366 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/367 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-05-21 22:29:57] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:29:57] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-21 22:29:58] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:29:59] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 4/371 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/371 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/371 constraints. Problems are: Problem set: 93 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 371 constraints, problems are : Problem set: 93 solved, 145 unsolved in 17791 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 93 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 4/56 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 2/205 variables, 1/57 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 4/61 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/61 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 94/299 variables, 8/69 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-05-21 22:30:04] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:30:04] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-21 22:30:04] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 22:30:04] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:30:05] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-21 22:30:05] [INFO ] Deduced a trap composed of 60 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 6/75 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-05-21 22:30:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/76 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-05-21 22:30:07] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:30:08] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 2/78 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/78 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 241/540 variables, 299/377 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 2/379 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 145/524 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-05-21 22:30:14] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 1/525 constraints. Problems are: Problem set: 93 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 525 constraints, problems are : Problem set: 93 solved, 145 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 299/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/238 constraints, Known Traps: 18/18 constraints]
After SMT, in 47986ms problems are : Problem set: 93 solved, 145 unsolved
Search for dead transitions found 93 dead transitions in 47989ms
Found 93 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 93 transitions
Dead transitions reduction (with SMT) removed 93 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 300/300 places, 148/241 transitions.
Graph (complete) has 669 edges and 300 vertex of which 207 are kept as prefixes of interest. Removing 93 places using SCC suffix rule.1 ms
Discarding 93 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 207 /300 variables (removed 93) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 207 cols
[2024-05-21 22:30:33] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 22:30:33] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 22:30:33] [INFO ] Invariant cache hit.
[2024-05-21 22:30:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:30:33] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/300 places, 148/241 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48899 ms. Remains : 207/300 places, 148/241 transitions.
[2024-05-21 22:30:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13705 resets) in 1783 ms. (560 steps per ms)
BEST_FIRST walk for 1000001 steps (2304 resets) in 853 ms. (1170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 22:30:36] [INFO ] Invariant cache hit.
[2024-05-21 22:30:36] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:30:36] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 22:30:36] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 22:30:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:30:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 22:30:36] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-21 22:30:36] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 22:30:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:30:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 22:30:36] [INFO ] Computed and/alt/rep : 140/232/140 causal constraints (skipped 5 transitions) in 10 ms.
[2024-05-21 22:30:36] [INFO ] Added : 71 causal constraints over 15 iterations in 182 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 207/207 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-21 22:30:36] [INFO ] Invariant cache hit.
[2024-05-21 22:30:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 22:30:37] [INFO ] Invariant cache hit.
[2024-05-21 22:30:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:30:37] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-21 22:30:37] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-21 22:30:37] [INFO ] Invariant cache hit.
[2024-05-21 22:30:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 1/206 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/354 variables, 206/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:30:40] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:30:40] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:30:40] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:30:40] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:30:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:30:40] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:30:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:30:41] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:30:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:30:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:30:42] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:30:42] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:30:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:30:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:30:44] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 1/355 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (OVERLAPS) 0/355 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 285 constraints, problems are : Problem set: 0 solved, 145 unsolved in 11222 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 2/205 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:30:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:30:50] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:30:50] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:30:50] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:30:51] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:30:51] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:30:51] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:30:51] [INFO ] Deduced a trap composed of 60 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:30:52] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:30:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 148/354 variables, 206/292 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 145/439 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 1/355 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/355 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 440 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 25/25 constraints]
After SMT, in 41289ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 41291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41614 ms. Remains : 207/207 places, 148/148 transitions.
RANDOM walk for 40000 steps (533 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1115530 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :0 out of 2
Probabilistic random walk after 1115530 steps, saw 156103 distinct states, run finished after 3001 ms. (steps per millisecond=371 ) properties seen :0
[2024-05-21 22:31:21] [INFO ] Invariant cache hit.
[2024-05-21 22:31:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 46/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/93 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/127 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/136 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 85/221 variables, 136/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/233 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/234 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/296 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/296 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/296 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/355 variables, 59/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/355 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/355 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/93 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:31:21] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/127 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/136 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 85/221 variables, 136/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/233 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/234 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/234 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/234 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/296 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/296 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/296 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/355 variables, 59/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/355 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/355 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 273 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 136 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 148/148 transitions.
RANDOM walk for 40000 steps (536 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (96 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1190078 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :0 out of 2
Probabilistic random walk after 1190078 steps, saw 166581 distinct states, run finished after 3001 ms. (steps per millisecond=396 ) properties seen :0
[2024-05-21 22:31:25] [INFO ] Invariant cache hit.
[2024-05-21 22:31:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 46/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/93 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/127 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/136 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 85/221 variables, 136/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/233 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/234 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/296 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/296 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/296 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/355 variables, 59/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/355 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/355 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/93 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:31:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/127 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/136 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 85/221 variables, 136/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/233 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/234 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/234 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/234 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/296 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/296 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/296 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/355 variables, 59/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/355 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/355 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 273 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-21 22:31:25] [INFO ] Invariant cache hit.
[2024-05-21 22:31:25] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 22:31:25] [INFO ] Invariant cache hit.
[2024-05-21 22:31:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:31:26] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-21 22:31:26] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-21 22:31:26] [INFO ] Invariant cache hit.
[2024-05-21 22:31:26] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 1/206 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/354 variables, 206/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:31:29] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:31:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:31:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:31:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:31:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:31:29] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:31:29] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:31:30] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:31:31] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:31:31] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:31:31] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:31:31] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:31:31] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:31:32] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:31:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 1/355 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (OVERLAPS) 0/355 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 285 constraints, problems are : Problem set: 0 solved, 145 unsolved in 11226 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 2/205 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:31:38] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:31:39] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:31:39] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:31:39] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:31:40] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:31:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:31:40] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:31:40] [INFO ] Deduced a trap composed of 60 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 22:31:41] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:31:41] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 148/354 variables, 206/292 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 145/439 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 1/355 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/355 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 440 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 25/25 constraints]
After SMT, in 41311ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 41312ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41654 ms. Remains : 207/207 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
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 207 transition count 148
Applied a total of 1 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 148 rows 207 cols
[2024-05-21 22:32:07] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 22:32:07] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 22:32:07] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 22:32:07] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 22:32:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 22:32:07] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 22:32:07] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 22:32:07] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 22:32:07] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 245 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60a-UpperBounds-15 in 148132 ms.
[2024-05-21 22:32:07] [INFO ] Flatten gal took : 62 ms
[2024-05-21 22:32:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 22:32:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 351 places, 293 transitions and 1409 arcs took 6 ms.
Total runtime 1261579 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-60a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 351
TRANSITIONS: 293
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.015s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2462
MODEL NAME: /home/mcc/execution/412/model
351 places, 293 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-60a-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-60a-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716330822632
--------------------
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 UpperBounds -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="DES-PT-60a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-60a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188300749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;