About the Execution of LTSMin+red for FireWire-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1270.264 | 838069.00 | 969441.00 | 2170.50 | ? 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.r553-tall-171734901300269.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300269
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 FireWire-PT-13-UpperBounds-00
FORMULA_NAME FireWire-PT-13-UpperBounds-01
FORMULA_NAME FireWire-PT-13-UpperBounds-02
FORMULA_NAME FireWire-PT-13-UpperBounds-03
FORMULA_NAME FireWire-PT-13-UpperBounds-04
FORMULA_NAME FireWire-PT-13-UpperBounds-05
FORMULA_NAME FireWire-PT-13-UpperBounds-06
FORMULA_NAME FireWire-PT-13-UpperBounds-07
FORMULA_NAME FireWire-PT-13-UpperBounds-08
FORMULA_NAME FireWire-PT-13-UpperBounds-09
FORMULA_NAME FireWire-PT-13-UpperBounds-10
FORMULA_NAME FireWire-PT-13-UpperBounds-11
FORMULA_NAME FireWire-PT-13-UpperBounds-12
FORMULA_NAME FireWire-PT-13-UpperBounds-13
FORMULA_NAME FireWire-PT-13-UpperBounds-14
FORMULA_NAME FireWire-PT-13-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717355897220
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:18:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:18:18] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 19:18:18] [INFO ] Transformed 205 places.
[2024-06-02 19:18:18] [INFO ] Transformed 610 transitions.
[2024-06-02 19:18:18] [INFO ] Found NUPN structural information;
[2024-06-02 19:18:18] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 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, 1]
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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:18:18] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
// Phase 1: matrix 504 rows 205 cols
[2024-06-02 19:18:18] [INFO ] Computed 10 invariants in 17 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (298 resets) in 50 ms. (196 steps per ms)
FORMULA FireWire-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (591 resets) in 156 ms. (637 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:18:18] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
[2024-06-02 19:18:18] [INFO ] Invariant cache hit.
[2024-06-02 19:18:19] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-02 19:18:19] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-06-02 19:18:19] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 19:18:19] [INFO ] [Real]Added 73 Read/Feed constraints in 45 ms returned sat
[2024-06-02 19:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:19] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-02 19:18:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 41 ms returned sat
[2024-06-02 19:18:19] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 107 ms.
[2024-06-02 19:18:19] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 15 ms to minimize.
[2024-06-02 19:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-06-02 19:18:20] [INFO ] Added : 34 causal constraints over 9 iterations in 576 ms. Result :sat
Minimization took 172 ms.
[2024-06-02 19:18:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:20] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-02 19:18:20] [INFO ] [Real]Added 73 Read/Feed constraints in 30 ms returned sat
[2024-06-02 19:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:20] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-02 19:18:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 59 ms returned sat
[2024-06-02 19:18:20] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 62 ms.
[2024-06-02 19:18:21] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:18:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-06-02 19:18:21] [INFO ] Added : 28 causal constraints over 7 iterations in 472 ms. Result :sat
Minimization took 129 ms.
[2024-06-02 19:18:21] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:21] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-02 19:18:21] [INFO ] [Real]Added 73 Read/Feed constraints in 40 ms returned sat
[2024-06-02 19:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:21] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-02 19:18:21] [INFO ] [Nat]Added 73 Read/Feed constraints in 47 ms returned sat
[2024-06-02 19:18:21] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 42 ms.
[2024-06-02 19:18:21] [INFO ] Added : 10 causal constraints over 2 iterations in 142 ms. Result :sat
Minimization took 112 ms.
[2024-06-02 19:18:22] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:22] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-02 19:18:22] [INFO ] [Real]Added 73 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:18:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:22] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-02 19:18:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:18:22] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 32 ms.
[2024-06-02 19:18:22] [INFO ] Added : 34 causal constraints over 7 iterations in 300 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 19:18:22] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:22] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-02 19:18:23] [INFO ] [Real]Added 73 Read/Feed constraints in 53 ms returned sat
[2024-06-02 19:18:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:23] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 19:18:23] [INFO ] [Nat]Added 73 Read/Feed constraints in 41 ms returned sat
[2024-06-02 19:18:23] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 31 ms.
[2024-06-02 19:18:23] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:18:23] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:18:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2024-06-02 19:18:23] [INFO ] Added : 31 causal constraints over 8 iterations in 582 ms. Result :sat
Minimization took 130 ms.
[2024-06-02 19:18:24] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:24] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-02 19:18:24] [INFO ] [Real]Added 73 Read/Feed constraints in 34 ms returned sat
[2024-06-02 19:18:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:24] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-02 19:18:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 71 ms returned sat
[2024-06-02 19:18:24] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 32 ms.
[2024-06-02 19:18:24] [INFO ] Added : 12 causal constraints over 3 iterations in 165 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 19:18:24] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-02 19:18:24] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-02 19:18:24] [INFO ] [Real]Added 73 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:18:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:25] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-02 19:18:25] [INFO ] [Nat]Added 73 Read/Feed constraints in 48 ms returned sat
[2024-06-02 19:18:25] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 34 ms.
[2024-06-02 19:18:25] [INFO ] Added : 16 causal constraints over 4 iterations in 183 ms. Result :sat
Minimization took 121 ms.
[2024-06-02 19:18:25] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:25] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-02 19:18:25] [INFO ] [Real]Added 73 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:18:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:25] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-02 19:18:25] [INFO ] [Nat]Added 73 Read/Feed constraints in 55 ms returned sat
[2024-06-02 19:18:25] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 32 ms.
[2024-06-02 19:18:25] [INFO ] Added : 12 causal constraints over 3 iterations in 142 ms. Result :sat
Minimization took 124 ms.
[2024-06-02 19:18:26] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:26] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-02 19:18:26] [INFO ] [Real]Added 73 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:18:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:26] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-02 19:18:26] [INFO ] [Nat]Added 73 Read/Feed constraints in 76 ms returned sat
[2024-06-02 19:18:26] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 27 ms.
[2024-06-02 19:18:26] [INFO ] Added : 12 causal constraints over 3 iterations in 148 ms. Result :sat
Minimization took 115 ms.
[2024-06-02 19:18:26] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:26] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-02 19:18:26] [INFO ] [Real]Added 73 Read/Feed constraints in 38 ms returned sat
[2024-06-02 19:18:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:18:27] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-02 19:18:27] [INFO ] [Nat]Added 73 Read/Feed constraints in 73 ms returned sat
[2024-06-02 19:18:27] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 29 ms.
[2024-06-02 19:18:27] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-06-02 19:18:27] [INFO ] Added : 24 causal constraints over 5 iterations in 325 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 542/542 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 539
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 536
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 536
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 197 transition count 526
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 197 transition count 526
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 197 transition count 524
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 194 transition count 515
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 194 transition count 515
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 191 transition count 509
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 191 transition count 509
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 188 transition count 500
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 188 transition count 500
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 186 transition count 496
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 186 transition count 496
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 184 transition count 490
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 184 transition count 490
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 183 transition count 488
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 183 transition count 488
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 182 transition count 485
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 182 transition count 485
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 181 transition count 483
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 181 transition count 483
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 180 transition count 480
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 180 transition count 480
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 177 transition count 477
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 174 transition count 483
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 73 place count 174 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 82 place count 174 transition count 468
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 174 transition count 474
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 94 place count 171 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 100 place count 171 transition count 462
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 170 transition count 461
Applied a total of 101 rules in 171 ms. Remains 170 /205 variables (removed 35) and now considering 461/542 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 170/205 places, 461/542 transitions.
[2024-06-02 19:18:28] [INFO ] Flow matrix only has 424 transitions (discarded 37 similar events)
// Phase 1: matrix 424 rows 170 cols
[2024-06-02 19:18:28] [INFO ] Computed 10 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32039 resets) in 1631 ms. (612 steps per ms)
FORMULA FireWire-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000007 steps (47888 resets) in 3424 ms. (2043 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:18:33] [INFO ] Flow matrix only has 424 transitions (discarded 37 similar events)
[2024-06-02 19:18:33] [INFO ] Invariant cache hit.
[2024-06-02 19:18:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:33] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:18:33] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:18:33] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:33] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-06-02 19:18:33] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:18:33] [INFO ] Computed and/alt/rep : 172/643/172 causal constraints (skipped 246 transitions) in 26 ms.
[2024-06-02 19:18:33] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 19:18:33] [INFO ] Added : 21 causal constraints over 6 iterations in 240 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 19:18:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:33] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-02 19:18:33] [INFO ] [Real]Added 61 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:34] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-02 19:18:34] [INFO ] [Nat]Added 61 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:18:34] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:18:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 19:18:34] [INFO ] Computed and/alt/rep : 172/643/172 causal constraints (skipped 246 transitions) in 24 ms.
[2024-06-02 19:18:34] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 5 ms to minimize.
[2024-06-02 19:18:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-06-02 19:18:34] [INFO ] Added : 34 causal constraints over 9 iterations in 362 ms. Result :sat
Minimization took 112 ms.
[2024-06-02 19:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:34] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-02 19:18:34] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:18:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:34] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 19:18:34] [INFO ] [Nat]Added 61 Read/Feed constraints in 24 ms returned sat
[2024-06-02 19:18:35] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:18:35] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:18:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2024-06-02 19:18:35] [INFO ] Computed and/alt/rep : 172/643/172 causal constraints (skipped 246 transitions) in 26 ms.
[2024-06-02 19:18:35] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:18:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-02 19:18:35] [INFO ] Added : 39 causal constraints over 8 iterations in 310 ms. Result :sat
Minimization took 110 ms.
[2024-06-02 19:18:35] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:35] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:18:35] [INFO ] [Real]Added 61 Read/Feed constraints in 10 ms returned sat
[2024-06-02 19:18:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:35] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 19:18:35] [INFO ] [Nat]Added 61 Read/Feed constraints in 28 ms returned sat
[2024-06-02 19:18:35] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:18:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-02 19:18:35] [INFO ] Computed and/alt/rep : 172/643/172 causal constraints (skipped 246 transitions) in 26 ms.
[2024-06-02 19:18:36] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:18:36] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:18:36] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:18:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2024-06-02 19:18:36] [INFO ] Added : 33 causal constraints over 9 iterations in 465 ms. Result :sat
Minimization took 111 ms.
[2024-06-02 19:18:36] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:36] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 19:18:36] [INFO ] [Real]Added 61 Read/Feed constraints in 19 ms returned sat
[2024-06-02 19:18:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:36] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 19:18:36] [INFO ] [Nat]Added 61 Read/Feed constraints in 37 ms returned sat
[2024-06-02 19:18:36] [INFO ] Computed and/alt/rep : 172/643/172 causal constraints (skipped 246 transitions) in 30 ms.
[2024-06-02 19:18:37] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:18:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 19:18:37] [INFO ] Added : 22 causal constraints over 6 iterations in 253 ms. Result :sat
Minimization took 111 ms.
[2024-06-02 19:18:37] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:37] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:18:37] [INFO ] [Real]Added 61 Read/Feed constraints in 19 ms returned sat
[2024-06-02 19:18:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:37] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-02 19:18:37] [INFO ] [Nat]Added 61 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:18:37] [INFO ] Computed and/alt/rep : 172/643/172 causal constraints (skipped 246 transitions) in 27 ms.
[2024-06-02 19:18:37] [INFO ] Added : 36 causal constraints over 9 iterations in 230 ms. Result :sat
Minimization took 118 ms.
[2024-06-02 19:18:37] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:38] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-02 19:18:38] [INFO ] [Real]Added 61 Read/Feed constraints in 26 ms returned sat
[2024-06-02 19:18:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:38] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 19:18:38] [INFO ] [Nat]Added 61 Read/Feed constraints in 58 ms returned sat
[2024-06-02 19:18:38] [INFO ] Computed and/alt/rep : 172/643/172 causal constraints (skipped 246 transitions) in 28 ms.
[2024-06-02 19:18:38] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:18:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-02 19:18:38] [INFO ] Added : 20 causal constraints over 5 iterations in 245 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 461/461 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 169 transition count 458
Applied a total of 3 rules in 14 ms. Remains 169 /170 variables (removed 1) and now considering 458/461 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 169/170 places, 458/461 transitions.
[2024-06-02 19:18:38] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 169 cols
[2024-06-02 19:18:38] [INFO ] Computed 10 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32216 resets) in 1555 ms. (642 steps per ms)
FORMULA FireWire-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000006 steps (40847 resets) in 2925 ms. (2050 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 19:18:43] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:18:43] [INFO ] Invariant cache hit.
[2024-06-02 19:18:43] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:43] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 19:18:43] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:18:43] [INFO ] [Real]Added 61 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:18:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:43] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:18:43] [INFO ] [Nat]Added 61 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:18:43] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:18:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-06-02 19:18:43] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 23 ms.
[2024-06-02 19:18:43] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:18:43] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:18:43] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:18:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2024-06-02 19:18:44] [INFO ] Added : 40 causal constraints over 12 iterations in 536 ms. Result :sat
Minimization took 134 ms.
[2024-06-02 19:18:44] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:44] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:18:44] [INFO ] [Real]Added 61 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:18:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:44] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:18:44] [INFO ] [Nat]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:18:44] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:18:44] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:18:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2024-06-02 19:18:44] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 19:18:44] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:18:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-06-02 19:18:44] [INFO ] Added : 34 causal constraints over 8 iterations in 271 ms. Result :sat
Minimization took 121 ms.
[2024-06-02 19:18:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:45] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 19:18:45] [INFO ] [Real]Added 61 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:45] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-02 19:18:45] [INFO ] [Nat]Added 61 Read/Feed constraints in 26 ms returned sat
[2024-06-02 19:18:45] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 26 ms.
[2024-06-02 19:18:45] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 5 ms to minimize.
[2024-06-02 19:18:45] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:18:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2024-06-02 19:18:45] [INFO ] Added : 31 causal constraints over 8 iterations in 403 ms. Result :sat
Minimization took 123 ms.
[2024-06-02 19:18:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:46] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 19:18:46] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:46] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-02 19:18:46] [INFO ] [Nat]Added 61 Read/Feed constraints in 28 ms returned sat
[2024-06-02 19:18:46] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:18:46] [INFO ] Deduced a trap composed of 107 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:18:46] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:18:46] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:18:46] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:18:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 479 ms
[2024-06-02 19:18:46] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 30 ms.
[2024-06-02 19:18:46] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-06-02 19:18:47] [INFO ] Added : 27 causal constraints over 7 iterations in 324 ms. Result :sat
Minimization took 113 ms.
[2024-06-02 19:18:47] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:47] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 19:18:47] [INFO ] [Real]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:47] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-02 19:18:47] [INFO ] [Nat]Added 61 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:18:47] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:18:47] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:18:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2024-06-02 19:18:47] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 19:18:47] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 5 ms to minimize.
[2024-06-02 19:18:47] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-06-02 19:18:48] [INFO ] Added : 34 causal constraints over 9 iterations in 419 ms. Result :sat
Minimization took 118 ms.
[2024-06-02 19:18:48] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:48] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 19:18:48] [INFO ] [Real]Added 61 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:18:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:48] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-02 19:18:48] [INFO ] [Nat]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2024-06-02 19:18:48] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 19:18:49] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-06-02 19:18:49] [INFO ] Added : 58 causal constraints over 13 iterations in 453 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 458/458 transitions.
Applied a total of 0 rules in 9 ms. Remains 169 /169 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 169/169 places, 458/458 transitions.
[2024-06-02 19:18:49] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:18:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32046 resets) in 1559 ms. (641 steps per ms)
BEST_FIRST walk for 6000003 steps (40844 resets) in 2943 ms. (2038 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 19:18:53] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:18:53] [INFO ] Invariant cache hit.
[2024-06-02 19:18:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:54] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:18:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:18:54] [INFO ] [Real]Added 61 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:18:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:54] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-02 19:18:54] [INFO ] [Nat]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:18:54] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:18:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 19:18:54] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 19:18:54] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:18:54] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:18:54] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:18:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2024-06-02 19:18:54] [INFO ] Added : 40 causal constraints over 12 iterations in 511 ms. Result :sat
Minimization took 130 ms.
[2024-06-02 19:18:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:55] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:18:55] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:18:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:55] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:18:55] [INFO ] [Nat]Added 61 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:18:55] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:18:55] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:18:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-06-02 19:18:55] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 19:18:55] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 19:18:55] [INFO ] Added : 34 causal constraints over 8 iterations in 271 ms. Result :sat
Minimization took 134 ms.
[2024-06-02 19:18:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:55] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:18:55] [INFO ] [Real]Added 61 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:18:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:55] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-06-02 19:18:56] [INFO ] [Nat]Added 61 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:18:56] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 19:18:56] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:18:56] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:18:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-06-02 19:18:56] [INFO ] Added : 31 causal constraints over 8 iterations in 344 ms. Result :sat
Minimization took 121 ms.
[2024-06-02 19:18:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:56] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:18:56] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:18:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:56] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:18:56] [INFO ] [Nat]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:18:56] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:18:56] [INFO ] Deduced a trap composed of 107 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:18:57] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:18:57] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:18:57] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:18:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 431 ms
[2024-06-02 19:18:57] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 22 ms.
[2024-06-02 19:18:57] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:18:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-06-02 19:18:57] [INFO ] Added : 27 causal constraints over 7 iterations in 306 ms. Result :sat
Minimization took 114 ms.
[2024-06-02 19:18:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:57] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-02 19:18:57] [INFO ] [Real]Added 61 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:18:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:57] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:18:57] [INFO ] [Nat]Added 61 Read/Feed constraints in 26 ms returned sat
[2024-06-02 19:18:57] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 8 ms to minimize.
[2024-06-02 19:18:58] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:18:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2024-06-02 19:18:58] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 19:18:58] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:18:58] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:18:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2024-06-02 19:18:58] [INFO ] Added : 34 causal constraints over 9 iterations in 407 ms. Result :sat
Minimization took 111 ms.
[2024-06-02 19:18:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:18:58] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:18:58] [INFO ] [Real]Added 61 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:18:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:18:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:18:58] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-02 19:18:58] [INFO ] [Nat]Added 61 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:18:58] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:18:59] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:18:59] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:18:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2024-06-02 19:18:59] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 21 ms.
[2024-06-02 19:18:59] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-06-02 19:18:59] [INFO ] Added : 58 causal constraints over 13 iterations in 427 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 458/458 transitions.
Applied a total of 0 rules in 28 ms. Remains 169 /169 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 169/169 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 169 /169 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2024-06-02 19:18:59] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:18:59] [INFO ] Invariant cache hit.
[2024-06-02 19:19:00] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-02 19:19:00] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:19:00] [INFO ] Invariant cache hit.
[2024-06-02 19:19:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:19:00] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [18, 71, 126]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 565 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/169 places, 458/458 transitions.
Applied a total of 0 rules in 7 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 584 ms. Remains : 166/169 places, 458/458 transitions.
[2024-06-02 19:19:00] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 19:19:00] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32026 resets) in 1609 ms. (621 steps per ms)
BEST_FIRST walk for 6000004 steps (41135 resets) in 2898 ms. (2069 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 19:19:04] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:19:04] [INFO ] Invariant cache hit.
[2024-06-02 19:19:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:19:04] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:19:04] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:19:04] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:19:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:19:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:19:05] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-02 19:19:05] [INFO ] [Nat]Added 61 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:19:05] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 22 ms.
[2024-06-02 19:19:05] [INFO ] Added : 14 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 136 ms.
[2024-06-02 19:19:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:19:05] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:19:05] [INFO ] [Real]Added 61 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:19:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:19:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:19:05] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:19:05] [INFO ] [Nat]Added 61 Read/Feed constraints in 28 ms returned sat
[2024-06-02 19:19:05] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 19:19:05] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 19:19:05] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:19:05] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:19:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2024-06-02 19:19:06] [INFO ] Added : 36 causal constraints over 9 iterations in 359 ms. Result :sat
Minimization took 138 ms.
[2024-06-02 19:19:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:19:06] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:19:06] [INFO ] [Real]Added 61 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:19:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:19:06] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:19:06] [INFO ] [Nat]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:19:06] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 19:19:06] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 19:19:06] [INFO ] Added : 17 causal constraints over 5 iterations in 216 ms. Result :sat
Minimization took 142 ms.
[2024-06-02 19:19:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:19:06] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 19:19:06] [INFO ] [Real]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:19:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:19:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:19:07] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-02 19:19:07] [INFO ] [Nat]Added 61 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:19:07] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 23 ms.
[2024-06-02 19:19:07] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-06-02 19:19:07] [INFO ] Added : 39 causal constraints over 10 iterations in 360 ms. Result :sat
Minimization took 159 ms.
[2024-06-02 19:19:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:19:07] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:19:07] [INFO ] [Real]Added 61 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:19:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:19:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:19:07] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:19:07] [INFO ] [Nat]Added 61 Read/Feed constraints in 28 ms returned sat
[2024-06-02 19:19:07] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 19:19:08] [INFO ] Added : 33 causal constraints over 8 iterations in 215 ms. Result :sat
Minimization took 150 ms.
[2024-06-02 19:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:19:08] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:19:08] [INFO ] [Real]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:19:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:19:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:19:08] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:19:08] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:19:08] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-02 19:19:08] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 21 ms.
[2024-06-02 19:19:08] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-06-02 19:19:08] [INFO ] Added : 22 causal constraints over 6 iterations in 240 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 166/166 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2024-06-02 19:19:09] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:19:09] [INFO ] Invariant cache hit.
[2024-06-02 19:19:09] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 19:19:09] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:19:09] [INFO ] Invariant cache hit.
[2024-06-02 19:19:09] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:19:09] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-02 19:19:09] [INFO ] Redundant transitions in 24 ms returned []
Running 452 sub problems to find dead transitions.
[2024-06-02 19:19:09] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:19:09] [INFO ] Invariant cache hit.
[2024-06-02 19:19:09] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:19:11] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:19:11] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:19:12] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:19:12] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:19:12] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:19:12] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:19:12] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:19:12] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:19:14] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:19:15] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 421/587 variables, 166/183 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:19:20] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:19:21] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:19:22] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:19:26] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:19:27] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:19:29] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:19:29] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/587 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 251 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 421/587 variables, 166/190 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 61/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 452/703 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:20:03] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/587 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/587 variables, and 704 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 18/18 constraints]
After SMT, in 60556ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60570ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60984 ms. Remains : 166/166 places, 458/458 transitions.
RANDOM walk for 40000 steps (1277 resets) in 1502 ms. (26 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (273 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (275 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (252 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (273 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (284 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (271 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (280 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (271 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (279 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (277 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (287 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (271 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 382909 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :2 out of 12
Probabilistic random walk after 382909 steps, saw 102913 distinct states, run finished after 3004 ms. (steps per millisecond=127 ) properties seen :2
[2024-06-02 19:20:14] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:20:14] [INFO ] Invariant cache hit.
[2024-06-02 19:20:14] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/536 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/583 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 61/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/584 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:20:14] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 3/587 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/587 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 235 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/536 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/583 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 61/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 10/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 3/587 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/587 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 245 constraints, problems are : Problem set: 0 solved, 10 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 2296ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1010 ms.
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 16 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 166/166 places, 458/458 transitions.
RANDOM walk for 40000 steps (1218 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (282 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (261 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (266 resets) in 44 ms. (888 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (287 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (281 resets) in 44 ms. (888 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (271 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (259 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (259 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (270 resets) in 36 ms. (1081 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (287 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 488413 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 10
Probabilistic random walk after 488413 steps, saw 122665 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-06-02 19:20:20] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:20:20] [INFO ] Invariant cache hit.
[2024-06-02 19:20:20] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/536 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/583 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 61/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/584 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:20:21] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 3/587 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/587 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 235 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/536 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/583 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 61/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 10/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 3/587 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/587 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 245 constraints, problems are : Problem set: 0 solved, 10 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 2030ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 877 ms.
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 166/166 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2024-06-02 19:20:23] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:20:23] [INFO ] Invariant cache hit.
[2024-06-02 19:20:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 19:20:23] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:20:23] [INFO ] Invariant cache hit.
[2024-06-02 19:20:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:20:24] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-02 19:20:24] [INFO ] Redundant transitions in 7 ms returned []
Running 452 sub problems to find dead transitions.
[2024-06-02 19:20:24] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:20:24] [INFO ] Invariant cache hit.
[2024-06-02 19:20:24] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:20:25] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:20:26] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:20:26] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:20:26] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:20:26] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:20:27] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:20:27] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:20:27] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:20:28] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:20:29] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 421/587 variables, 166/183 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:20:35] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:20:35] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-02 19:20:36] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:20:41] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:20:41] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:20:44] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:20:44] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 9 (OVERLAPS) 0/587 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 251 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 421/587 variables, 166/190 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 61/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 452/703 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:21:16] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/587 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/587 variables, and 704 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 18/18 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60768 ms. Remains : 166/166 places, 458/458 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 166 vertex of which 29 / 166 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 140 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 140 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 139 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 139 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 138 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 137 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 137 transition count 254
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 137 transition count 239
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 128 transition count 236
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 46 place count 128 transition count 236
Applied a total of 46 rules in 45 ms. Remains 128 /166 variables (removed 38) and now considering 236/458 (removed 222) transitions.
Running SMT prover for 10 properties.
[2024-06-02 19:21:24] [INFO ] Flow matrix only has 234 transitions (discarded 2 similar events)
// Phase 1: matrix 234 rows 128 cols
[2024-06-02 19:21:24] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:21:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:21:24] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:4
TRAPS : Iteration 0
[2024-06-02 19:21:24] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 19:21:24] [INFO ] After 232ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 19:21:24] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 19:21:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:21:25] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-02 19:21:25] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 19:21:25] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
TRAPS : Iteration 1
[2024-06-02 19:21:25] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-02 19:21:25] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 958 ms.
FORMULA FireWire-PT-13-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Starting property specific reduction for FireWire-PT-13-UpperBounds-00
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]
[2024-06-02 19:21:25] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 19:21:25] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (297 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (69 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:21:25] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:21:25] [INFO ] Invariant cache hit.
[2024-06-02 19:21:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:21:25] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 19:21:25] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:21:25] [INFO ] [Real]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:21:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:21:25] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-06-02 19:21:25] [INFO ] [Nat]Added 61 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:21:25] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 19:21:25] [INFO ] Added : 14 causal constraints over 3 iterations in 103 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 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p97) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 455/455 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 453
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 450
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 163 transition count 448
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 162 transition count 445
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 161 transition count 443
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 7 place count 159 transition count 439
Iterating global reduction 5 with 2 rules applied. Total rules applied 9 place count 159 transition count 439
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 11 place count 157 transition count 434
Iterating global reduction 5 with 2 rules applied. Total rules applied 13 place count 157 transition count 434
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 15 place count 155 transition count 430
Iterating global reduction 5 with 2 rules applied. Total rules applied 17 place count 155 transition count 430
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 18 place count 154 transition count 427
Iterating global reduction 5 with 1 rules applied. Total rules applied 19 place count 154 transition count 427
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 20 place count 153 transition count 425
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 153 transition count 425
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 22 place count 152 transition count 423
Iterating global reduction 5 with 1 rules applied. Total rules applied 23 place count 152 transition count 423
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 24 place count 151 transition count 421
Iterating global reduction 5 with 1 rules applied. Total rules applied 25 place count 151 transition count 421
Applied a total of 25 rules in 29 ms. Remains 151 /166 variables (removed 15) and now considering 421/455 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 151/166 places, 421/455 transitions.
[2024-06-02 19:21:26] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 151 cols
[2024-06-02 19:21:26] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (31985 resets) in 1423 ms. (702 steps per ms)
BEST_FIRST walk for 1000001 steps (6714 resets) in 447 ms. (2232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:21:27] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:21:27] [INFO ] Invariant cache hit.
[2024-06-02 19:21:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:21:28] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 19:21:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:21:28] [INFO ] [Real]Added 56 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:21:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:21:28] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-02 19:21:28] [INFO ] [Nat]Added 56 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:21:28] [INFO ] Computed and/alt/rep : 158/578/158 causal constraints (skipped 220 transitions) in 22 ms.
[2024-06-02 19:21:28] [INFO ] Added : 29 causal constraints over 7 iterations in 158 ms. Result :sat
Minimization took 100 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 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 151/151 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 19:21:28] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:21:28] [INFO ] Invariant cache hit.
[2024-06-02 19:21:28] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:21:28] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:21:28] [INFO ] Invariant cache hit.
[2024-06-02 19:21:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:21:28] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-02 19:21:28] [INFO ] Redundant transitions in 4 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 19:21:28] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:21:28] [INFO ] Invariant cache hit.
[2024-06-02 19:21:28] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:21:30] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:21:30] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:21:34] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:21:34] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:21:34] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:21:34] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:21:34] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:21:35] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:21:36] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-06-02 19:21:36] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:21:36] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (OVERLAPS) 384/535 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:21:43] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:21:43] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:21:43] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/535 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 415 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 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.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 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.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 1.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 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 229 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 384/535 variables, 151/173 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 415/644 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:22:11] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 645 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60696 ms. Remains : 151/151 places, 421/421 transitions.
RANDOM walk for 40000 steps (1292 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (276 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (277 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 865004 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :0 out of 2
Probabilistic random walk after 865004 steps, saw 211853 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
[2024-06-02 19:22:32] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:22:32] [INFO ] Invariant cache hit.
[2024-06-02 19:22:32] [INFO ] State equation strengthened by 56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/356 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/515 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/533 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/535 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/356 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/515 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/533 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/535 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 151/151 places, 421/421 transitions.
RANDOM walk for 40000 steps (1306 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (283 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (270 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 822402 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 2
Probabilistic random walk after 822402 steps, saw 200890 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-06-02 19:22:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:22:36] [INFO ] Invariant cache hit.
[2024-06-02 19:22:36] [INFO ] State equation strengthened by 56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/356 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/515 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/533 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/535 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/356 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/515 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/533 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/535 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 151/151 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 19:22:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:22:36] [INFO ] Invariant cache hit.
[2024-06-02 19:22:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 19:22:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:22:36] [INFO ] Invariant cache hit.
[2024-06-02 19:22:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:22:36] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 19:22:36] [INFO ] Redundant transitions in 4 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 19:22:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 19:22:36] [INFO ] Invariant cache hit.
[2024-06-02 19:22:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:22:38] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:22:38] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:22:42] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:22:42] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:22:42] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:22:42] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:22:42] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:22:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:22:43] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:22:44] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:22:44] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (OVERLAPS) 384/535 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:22:51] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:22:51] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:22:51] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:22:59] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/535 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 229 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 384/535 variables, 151/173 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 415/644 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 19:23:19] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 645 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60659 ms. Remains : 151/151 places, 421/421 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 151 vertex of which 29 / 151 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 125 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 124 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 124 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 123 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 122 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 122 transition count 224
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 122 transition count 209
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 113 transition count 206
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 46 place count 113 transition count 206
Applied a total of 46 rules in 33 ms. Remains 113 /151 variables (removed 38) and now considering 206/421 (removed 215) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:23:37] [INFO ] Flow matrix only has 204 transitions (discarded 2 similar events)
// Phase 1: matrix 204 rows 113 cols
[2024-06-02 19:23:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:23:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:23:37] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:23:37] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 19:23:37] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 165 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-00 in 131825 ms.
Starting property specific reduction for FireWire-PT-13-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]
[2024-06-02 19:23:37] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 19:23:37] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (332 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (81 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:23:37] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:23:37] [INFO ] Invariant cache hit.
[2024-06-02 19:23:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:23:37] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-02 19:23:37] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:23:37] [INFO ] [Real]Added 61 Read/Feed constraints in 24 ms returned sat
[2024-06-02 19:23:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:23:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:23:37] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:23:37] [INFO ] [Nat]Added 61 Read/Feed constraints in 28 ms returned sat
[2024-06-02 19:23:37] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:23:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-06-02 19:23:37] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 19:23:37] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:23:37] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:23:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2024-06-02 19:23:38] [INFO ] Added : 36 causal constraints over 9 iterations in 359 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 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p30) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 456/456 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 160 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 160 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 159 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 159 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 157 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 157 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 156 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 156 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 155 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 155 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 154 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 154 transition count 429
Applied a total of 24 rules in 26 ms. Remains 154 /166 variables (removed 12) and now considering 429/456 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 154/166 places, 429/456 transitions.
[2024-06-02 19:23:38] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
// Phase 1: matrix 392 rows 154 cols
[2024-06-02 19:23:38] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32043 resets) in 1410 ms. (708 steps per ms)
BEST_FIRST walk for 1000001 steps (6930 resets) in 438 ms. (2277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:23:40] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:23:40] [INFO ] Invariant cache hit.
[2024-06-02 19:23:40] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:23:40] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-02 19:23:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:23:40] [INFO ] [Real]Added 58 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:23:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:23:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:23:40] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 19:23:40] [INFO ] [Nat]Added 58 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:23:40] [INFO ] Computed and/alt/rep : 162/590/162 causal constraints (skipped 224 transitions) in 22 ms.
[2024-06-02 19:23:40] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:23:40] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:23:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2024-06-02 19:23:40] [INFO ] Added : 40 causal constraints over 10 iterations in 347 ms. Result :sat
Minimization took 115 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 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 154/154 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 19:23:40] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:23:40] [INFO ] Invariant cache hit.
[2024-06-02 19:23:40] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 19:23:40] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:23:40] [INFO ] Invariant cache hit.
[2024-06-02 19:23:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:23:41] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-02 19:23:41] [INFO ] Redundant transitions in 2 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 19:23:41] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:23:41] [INFO ] Invariant cache hit.
[2024-06-02 19:23:41] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:23:42] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:23:43] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:23:46] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:23:46] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:23:47] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:23:47] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:23:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:23:47] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:23:48] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:23:50] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:23:50] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 392/546 variables, 154/172 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 58/230 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:23:54] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:24:06] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/546 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 235 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 423/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 658 constraints, problems are : Problem set: 0 solved, 423 unsolved in 26251 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 16/16 constraints]
After SMT, in 56579ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 56583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56918 ms. Remains : 154/154 places, 429/429 transitions.
RANDOM walk for 40000 steps (1274 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (269 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (273 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 914606 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 2
Probabilistic random walk after 914606 steps, saw 224511 distinct states, run finished after 3002 ms. (steps per millisecond=304 ) properties seen :0
[2024-06-02 19:24:40] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:24:40] [INFO ] Invariant cache hit.
[2024-06-02 19:24:40] [INFO ] State equation strengthened by 58 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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/367 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/526 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:24:41] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/544 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/546 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/526 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/544 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/544 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/546 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 429/429 transitions.
RANDOM walk for 40000 steps (1284 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (255 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (255 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 830868 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 2
Probabilistic random walk after 830868 steps, saw 203434 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2024-06-02 19:24:44] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:24:44] [INFO ] Invariant cache hit.
[2024-06-02 19:24:44] [INFO ] State equation strengthened by 58 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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/367 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/526 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:24:44] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/544 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/546 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/526 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/544 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/544 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/546 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 526ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 19:24:45] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:24:45] [INFO ] Invariant cache hit.
[2024-06-02 19:24:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 19:24:45] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:24:45] [INFO ] Invariant cache hit.
[2024-06-02 19:24:45] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:24:45] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-02 19:24:45] [INFO ] Redundant transitions in 3 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 19:24:45] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:24:45] [INFO ] Invariant cache hit.
[2024-06-02 19:24:45] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:24:47] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-06-02 19:24:47] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:24:50] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:24:52] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:24:54] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:24:54] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 392/546 variables, 154/172 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 58/230 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:24:57] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:24:59] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:25:06] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:25:06] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:25:10] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/546 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 235 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 423/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 658 constraints, problems are : Problem set: 0 solved, 423 unsolved in 25999 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 16/16 constraints]
After SMT, in 56331ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 56336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56668 ms. Remains : 154/154 places, 429/429 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 154 vertex of which 29 / 154 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 128 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 127 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 127 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 126 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 125 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 125 transition count 230
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 125 transition count 215
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 116 transition count 212
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 46 place count 116 transition count 212
Applied a total of 46 rules in 18 ms. Remains 116 /154 variables (removed 38) and now considering 212/429 (removed 217) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:25:41] [INFO ] Flow matrix only has 210 transitions (discarded 2 similar events)
// Phase 1: matrix 210 rows 116 cols
[2024-06-02 19:25:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:25:41] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:25:41] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:25:41] [INFO ] After 71ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 19:25:41] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 136 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-02 in 124697 ms.
Starting property specific reduction for FireWire-PT-13-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]
[2024-06-02 19:25:41] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 19:25:41] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (321 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10000 steps (67 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:25:42] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:25:42] [INFO ] Invariant cache hit.
[2024-06-02 19:25:42] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:25:42] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-02 19:25:42] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:25:42] [INFO ] [Real]Added 61 Read/Feed constraints in 27 ms returned sat
[2024-06-02 19:25:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:25:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:25:42] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-02 19:25:42] [INFO ] [Nat]Added 61 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:25:42] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 19:25:42] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 19:25:42] [INFO ] Added : 17 causal constraints over 5 iterations in 231 ms. Result :sat
Minimization took 142 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 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p92) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 456/456 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 160 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 160 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 159 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 159 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 157 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 157 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 156 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 156 transition count 434
Applied a total of 20 rules in 14 ms. Remains 156 /166 variables (removed 10) and now considering 434/456 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 156/166 places, 434/456 transitions.
[2024-06-02 19:25:42] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
// Phase 1: matrix 397 rows 156 cols
[2024-06-02 19:25:42] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32031 resets) in 1425 ms. (701 steps per ms)
BEST_FIRST walk for 1000001 steps (6780 resets) in 457 ms. (2183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:25:44] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:25:44] [INFO ] Invariant cache hit.
[2024-06-02 19:25:44] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:25:44] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-02 19:25:44] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 19:25:44] [INFO ] [Real]Added 59 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:25:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:25:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:25:44] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-02 19:25:44] [INFO ] [Nat]Added 59 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:25:44] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:25:45] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:25:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2024-06-02 19:25:45] [INFO ] Computed and/alt/rep : 164/596/164 causal constraints (skipped 227 transitions) in 23 ms.
[2024-06-02 19:25:45] [INFO ] Added : 17 causal constraints over 4 iterations in 117 ms. Result :sat
Minimization took 134 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 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 19:25:45] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:25:45] [INFO ] Invariant cache hit.
[2024-06-02 19:25:45] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 19:25:45] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:25:45] [INFO ] Invariant cache hit.
[2024-06-02 19:25:45] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 19:25:45] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 19:25:45] [INFO ] Redundant transitions in 4 ms returned []
Running 428 sub problems to find dead transitions.
[2024-06-02 19:25:45] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:25:45] [INFO ] Invariant cache hit.
[2024-06-02 19:25:45] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 19:25:47] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:25:47] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 19:25:51] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:25:51] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:25:51] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:25:52] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:25:52] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:25:53] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:25:53] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 19:26:00] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:26:00] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:26:01] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 19:26:02] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:26:02] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 11 (OVERLAPS) 0/553 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 236 constraints, problems are : Problem set: 0 solved, 428 unsolved in 29762 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/177 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/236 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 428/664 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 664 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 14/14 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60501 ms. Remains : 156/156 places, 434/434 transitions.
RANDOM walk for 40000 steps (1252 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (273 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (282 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 825561 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 2
Probabilistic random walk after 825561 steps, saw 201822 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
[2024-06-02 19:26:48] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:26:48] [INFO ] Invariant cache hit.
[2024-06-02 19:26:48] [INFO ] State equation strengthened by 59 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/533 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/551 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/553 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/533 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/551 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/553 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 527ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 434/434 transitions.
RANDOM walk for 40000 steps (1274 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (266 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (266 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 702188 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 2
Probabilistic random walk after 702188 steps, saw 174441 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2024-06-02 19:26:52] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:26:52] [INFO ] Invariant cache hit.
[2024-06-02 19:26:52] [INFO ] State equation strengthened by 59 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/533 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/551 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/553 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/533 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/551 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/553 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 602ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 19:26:53] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:26:53] [INFO ] Invariant cache hit.
[2024-06-02 19:26:53] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 19:26:53] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:26:53] [INFO ] Invariant cache hit.
[2024-06-02 19:26:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 19:26:53] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-02 19:26:53] [INFO ] Redundant transitions in 3 ms returned []
Running 428 sub problems to find dead transitions.
[2024-06-02 19:26:53] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 19:26:53] [INFO ] Invariant cache hit.
[2024-06-02 19:26:53] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 19:26:55] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:26:55] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 19:26:59] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:26:59] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:26:59] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 19:27:00] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:27:00] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:27:01] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:27:01] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 19:27:08] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:27:08] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:27:08] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 19:27:09] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 1 ms to minimize.
[2024-06-02 19:27:09] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 11 (OVERLAPS) 0/553 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 236 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/177 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/236 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 428/664 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 664 constraints, problems are : Problem set: 0 solved, 428 unsolved in 29536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 14/14 constraints]
After SMT, in 59851ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 59855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60218 ms. Remains : 156/156 places, 434/434 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 156 vertex of which 29 / 156 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 130 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 128 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 127 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 127 transition count 234
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 127 transition count 219
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 118 transition count 216
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 46 place count 118 transition count 216
Applied a total of 46 rules in 19 ms. Remains 118 /156 variables (removed 38) and now considering 216/434 (removed 218) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:27:53] [INFO ] Flow matrix only has 214 transitions (discarded 2 similar events)
// Phase 1: matrix 214 rows 118 cols
[2024-06-02 19:27:53] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 19:27:53] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:27:53] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:27:53] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 19:27:53] [INFO ] After 161ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:27:53] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:27:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:27:53] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:27:53] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 1
[2024-06-02 19:27:53] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:27:53] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 420 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-03 in 131871 ms.
Starting property specific reduction for FireWire-PT-13-UpperBounds-08
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]
[2024-06-02 19:27:53] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 19:27:53] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (324 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (62 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:27:53] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:27:53] [INFO ] Invariant cache hit.
[2024-06-02 19:27:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:27:53] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:27:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:27:54] [INFO ] [Real]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:27:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:27:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:27:54] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:27:54] [INFO ] [Nat]Added 61 Read/Feed constraints in 19 ms returned sat
[2024-06-02 19:27:54] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 22 ms.
[2024-06-02 19:27:54] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-02 19:27:54] [INFO ] Added : 39 causal constraints over 10 iterations in 332 ms. Result :sat
Minimization took 154 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 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p32) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 456/456 transitions.
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 453
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 451
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 162 transition count 447
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 160 transition count 442
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 160 transition count 442
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 158 transition count 438
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 158 transition count 438
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 157 transition count 435
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 157 transition count 435
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 156 transition count 433
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 156 transition count 433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 155 transition count 430
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 155 transition count 430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 154 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 154 transition count 428
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 153 transition count 426
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 153 transition count 426
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 152 transition count 424
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 152 transition count 424
Applied a total of 26 rules in 21 ms. Remains 152 /166 variables (removed 14) and now considering 424/456 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 152/166 places, 424/456 transitions.
[2024-06-02 19:27:54] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
// Phase 1: matrix 387 rows 152 cols
[2024-06-02 19:27:54] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32086 resets) in 1391 ms. (718 steps per ms)
BEST_FIRST walk for 1000001 steps (6845 resets) in 449 ms. (2222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:27:56] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:27:56] [INFO ] Invariant cache hit.
[2024-06-02 19:27:56] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:27:56] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-02 19:27:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 19:27:56] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:27:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:27:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:27:56] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-02 19:27:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 9 ms returned sat
[2024-06-02 19:27:56] [INFO ] Computed and/alt/rep : 160/584/160 causal constraints (skipped 221 transitions) in 21 ms.
[2024-06-02 19:27:56] [INFO ] Added : 9 causal constraints over 2 iterations in 74 ms. Result :sat
Minimization took 92 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 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 424/424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 19:27:56] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:27:56] [INFO ] Invariant cache hit.
[2024-06-02 19:27:57] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 19:27:57] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:27:57] [INFO ] Invariant cache hit.
[2024-06-02 19:27:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 19:27:57] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-06-02 19:27:57] [INFO ] Redundant transitions in 4 ms returned []
Running 418 sub problems to find dead transitions.
[2024-06-02 19:27:57] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:27:57] [INFO ] Invariant cache hit.
[2024-06-02 19:27:57] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:27:58] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:27:59] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:28:02] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:28:02] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:28:02] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:28:02] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:28:03] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:28:03] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:28:03] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:28:04] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:28:04] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 387/539 variables, 152/170 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 57/227 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:28:09] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:28:10] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:28:10] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:28:12] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:28:20] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/539 variables, and 232 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 387/539 variables, 152/175 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 418/650 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:28:39] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/539 variables, and 651 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 17/17 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60645 ms. Remains : 152/152 places, 424/424 transitions.
RANDOM walk for 40000 steps (1297 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (294 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (286 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 914640 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 2
Probabilistic random walk after 914640 steps, saw 224517 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
[2024-06-02 19:29:00] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:29:00] [INFO ] Invariant cache hit.
[2024-06-02 19:29:00] [INFO ] State equation strengthened by 57 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/359 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/360 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/519 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/537 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/539 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/539 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/359 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/519 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/537 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/539 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 152/152 places, 424/424 transitions.
RANDOM walk for 40000 steps (1270 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (282 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (277 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 892370 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :0 out of 2
Probabilistic random walk after 892370 steps, saw 218875 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
[2024-06-02 19:29:04] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:29:04] [INFO ] Invariant cache hit.
[2024-06-02 19:29:04] [INFO ] State equation strengthened by 57 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/359 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/360 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/519 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/537 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/539 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/539 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/359 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/519 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/537 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/539 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 424/424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 19:29:04] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:29:04] [INFO ] Invariant cache hit.
[2024-06-02 19:29:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:29:04] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:29:04] [INFO ] Invariant cache hit.
[2024-06-02 19:29:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 19:29:04] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 19:29:05] [INFO ] Redundant transitions in 3 ms returned []
Running 418 sub problems to find dead transitions.
[2024-06-02 19:29:05] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 19:29:05] [INFO ] Invariant cache hit.
[2024-06-02 19:29:05] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:29:06] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:29:07] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:29:10] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:29:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:29:10] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:29:10] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:29:11] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 3 ms to minimize.
[2024-06-02 19:29:11] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2024-06-02 19:29:11] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 19:29:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:29:12] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 387/539 variables, 152/170 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 57/227 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:29:17] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:29:18] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:29:18] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:29:20] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:29:27] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 12 (OVERLAPS) 0/539 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 232 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 387/539 variables, 152/175 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 418/650 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 19:29:46] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/539 variables, and 651 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 17/17 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60660 ms. Remains : 152/152 places, 424/424 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 152 vertex of which 29 / 152 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 126 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 125 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 125 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 124 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 123 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 123 transition count 226
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 123 transition count 211
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 114 transition count 208
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 46 place count 114 transition count 208
Applied a total of 46 rules in 20 ms. Remains 114 /152 variables (removed 38) and now considering 208/424 (removed 216) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:30:05] [INFO ] Flow matrix only has 206 transitions (discarded 2 similar events)
// Phase 1: matrix 206 rows 114 cols
[2024-06-02 19:30:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:30:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:30:05] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:30:05] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 19:30:05] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 152 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-08 in 131668 ms.
Starting property specific reduction for FireWire-PT-13-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]
[2024-06-02 19:30:05] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 19:30:05] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (334 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (63 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:30:05] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 19:30:05] [INFO ] Invariant cache hit.
[2024-06-02 19:30:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:30:05] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 19:30:05] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:30:05] [INFO ] [Real]Added 61 Read/Feed constraints in 30 ms returned sat
[2024-06-02 19:30:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:30:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 19:30:05] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-02 19:30:05] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:30:05] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:30:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2024-06-02 19:30:05] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 22 ms.
[2024-06-02 19:30:06] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:30:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 19:30:06] [INFO ] Added : 22 causal constraints over 6 iterations in 238 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 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p162) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 456/456 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 162 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 162 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 160 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 160 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 158 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 158 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 156 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 156 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 154 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 154 transition count 427
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 152 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 152 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 151 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 151 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 150 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 150 transition count 419
Applied a total of 32 rules in 19 ms. Remains 150 /166 variables (removed 16) and now considering 419/456 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 150/166 places, 419/456 transitions.
[2024-06-02 19:30:06] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
// Phase 1: matrix 382 rows 150 cols
[2024-06-02 19:30:06] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (31949 resets) in 1415 ms. (706 steps per ms)
BEST_FIRST walk for 1000000 steps (6672 resets) in 456 ms. (2188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:30:08] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:30:08] [INFO ] Invariant cache hit.
[2024-06-02 19:30:08] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:30:08] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-02 19:30:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:30:08] [INFO ] [Real]Added 56 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:30:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:30:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:30:08] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 19:30:08] [INFO ] [Nat]Added 56 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:30:08] [INFO ] Computed and/alt/rep : 158/578/158 causal constraints (skipped 218 transitions) in 21 ms.
[2024-06-02 19:30:08] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:30:08] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:30:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2024-06-02 19:30:08] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-06-02 19:30:09] [INFO ] Added : 39 causal constraints over 14 iterations in 496 ms. Result :sat
Minimization took 106 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 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 150/150 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 19:30:09] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:30:09] [INFO ] Invariant cache hit.
[2024-06-02 19:30:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 19:30:09] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:30:09] [INFO ] Invariant cache hit.
[2024-06-02 19:30:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:30:09] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 19:30:09] [INFO ] Redundant transitions in 4 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-02 19:30:09] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:30:09] [INFO ] Invariant cache hit.
[2024-06-02 19:30:09] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:30:11] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
[2024-06-02 19:30:11] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:30:15] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:30:15] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:30:15] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:30:15] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:30:15] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:30:16] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:30:18] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:30:18] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:30:19] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:30:22] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (OVERLAPS) 382/532 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:30:27] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:30:32] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:30:32] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 228 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 382/532 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 413/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 641 constraints, problems are : Problem set: 0 solved, 413 unsolved in 28355 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 15/15 constraints]
After SMT, in 58654ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 58658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58979 ms. Remains : 150/150 places, 419/419 transitions.
RANDOM walk for 40000 steps (1289 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (269 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (252 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 856127 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 2
Probabilistic random walk after 856127 steps, saw 209884 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
[2024-06-02 19:31:11] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:31:11] [INFO ] Invariant cache hit.
[2024-06-02 19:31:11] [INFO ] State equation strengthened by 56 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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/512 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/530 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/512 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/530 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/532 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 150/150 places, 419/419 transitions.
RANDOM walk for 40000 steps (1271 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (271 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (277 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 817398 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 2
Probabilistic random walk after 817398 steps, saw 199584 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2024-06-02 19:31:14] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:31:14] [INFO ] Invariant cache hit.
[2024-06-02 19:31:14] [INFO ] State equation strengthened by 56 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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/512 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/530 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/512 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/530 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/532 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 150/150 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 19:31:15] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:31:15] [INFO ] Invariant cache hit.
[2024-06-02 19:31:15] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:31:15] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:31:15] [INFO ] Invariant cache hit.
[2024-06-02 19:31:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:31:15] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 19:31:15] [INFO ] Redundant transitions in 3 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-02 19:31:15] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 19:31:15] [INFO ] Invariant cache hit.
[2024-06-02 19:31:15] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:31:17] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:31:18] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:31:21] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:31:21] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:31:21] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:31:21] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:31:21] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:31:22] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:31:24] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:31:24] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:31:25] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:31:28] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (OVERLAPS) 382/532 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:31:33] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:31:38] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:31:38] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 228 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 382/532 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 413/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 641 constraints, problems are : Problem set: 0 solved, 413 unsolved in 28536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 15/15 constraints]
After SMT, in 58833ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 58837ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59150 ms. Remains : 150/150 places, 419/419 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 150 vertex of which 29 / 150 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 124 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 123 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 122 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 121 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 121 transition count 222
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 121 transition count 207
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 112 transition count 204
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 46 place count 112 transition count 204
Applied a total of 46 rules in 21 ms. Remains 112 /150 variables (removed 38) and now considering 204/419 (removed 215) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:32:14] [INFO ] Flow matrix only has 202 transitions (discarded 2 similar events)
// Phase 1: matrix 202 rows 112 cols
[2024-06-02 19:32:14] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:32:14] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:32:14] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:32:14] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 19:32:14] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:32:14] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:32:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:32:14] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:32:14] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
TRAPS : Iteration 1
[2024-06-02 19:32:14] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:32:14] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 330 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-15 in 129319 ms.
[2024-06-02 19:32:15] [INFO ] Flatten gal took : 68 ms
[2024-06-02 19:32:15] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2024-06-02 19:32:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 166 places, 458 transitions and 1725 arcs took 6 ms.
Total runtime 836737 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FireWire-PT-13-UpperBounds-00
Could not compute solution for formula : FireWire-PT-13-UpperBounds-02
Could not compute solution for formula : FireWire-PT-13-UpperBounds-03
Could not compute solution for formula : FireWire-PT-13-UpperBounds-08
Could not compute solution for formula : FireWire-PT-13-UpperBounds-15
BK_STOP 1717356735289
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name FireWire-PT-13-UpperBounds-00
ub formula formula --maxsum=/tmp/2076/ub_0_
ub formula name FireWire-PT-13-UpperBounds-02
ub formula formula --maxsum=/tmp/2076/ub_1_
ub formula name FireWire-PT-13-UpperBounds-03
ub formula formula --maxsum=/tmp/2076/ub_2_
ub formula name FireWire-PT-13-UpperBounds-08
ub formula formula --maxsum=/tmp/2076/ub_3_
ub formula name FireWire-PT-13-UpperBounds-15
ub formula formula --maxsum=/tmp/2076/ub_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="FireWire-PT-13"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-13, 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 r553-tall-171734901300269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 ;