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.r480-tall-171624189800677.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 DES-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800677
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717193329763

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:08:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:08:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:08:51] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-31 22:08:51] [INFO ] Transformed 320 places.
[2024-05-31 22:08:51] [INFO ] Transformed 271 transitions.
[2024-05-31 22:08:51] [INFO ] Found NUPN structural information;
[2024-05-31 22:08:51] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
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]
// Phase 1: matrix 271 rows 320 cols
[2024-05-31 22:08:51] [INFO ] Computed 65 invariants in 28 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 (84 resets) in 66 ms. (149 steps per ms)
FORMULA DES-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (26 resets) in 28 ms. (689 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-31 22:08:51] [INFO ] Invariant cache hit.
[2024-05-31 22:08:51] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2024-05-31 22:08:51] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2024-05-31 22:08:51] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-31 22:08:52] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 10 ms to minimize.
[2024-05-31 22:08:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:08:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 19 ms returned sat
[2024-05-31 22:08:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2024-05-31 22:08:52] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-31 22:08:52] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:08:52] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:08:52] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:08:52] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:08:52] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:08:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 418 ms
[2024-05-31 22:08:52] [INFO ] Computed and/alt/rep : 265/485/265 causal constraints (skipped 5 transitions) in 24 ms.
[2024-05-31 22:08:54] [INFO ] Added : 242 causal constraints over 49 iterations in 1410 ms. Result :sat
Minimization took 189 ms.
[2024-05-31 22:08:54] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2024-05-31 22:08:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned sat
[2024-05-31 22:08:54] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-31 22:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:08:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2024-05-31 22:08:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2024-05-31 22:08:55] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-31 22:08:55] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:08:55] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 3 ms to minimize.
[2024-05-31 22:08:55] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:08:55] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:08:55] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:08:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:08:55] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:08:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 580 ms
[2024-05-31 22:08:55] [INFO ] Computed and/alt/rep : 265/485/265 causal constraints (skipped 5 transitions) in 18 ms.
[2024-05-31 22:08:56] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:08:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-31 22:08:56] [INFO ] Added : 242 causal constraints over 49 iterations in 1256 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 309 transition count 243
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 288 transition count 243
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 288 transition count 234
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 279 transition count 234
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 260 transition count 215
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 260 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 260 transition count 214
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 259 transition count 214
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 244 transition count 199
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 244 transition count 199
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 244 transition count 184
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 242 transition count 183
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 242 transition count 180
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 239 transition count 180
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 162 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 160 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 160 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 159 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 159 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 158 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 157 transition count 103
Applied a total of 320 rules in 127 ms. Remains 157 /320 variables (removed 163) and now considering 103/271 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 157/320 places, 103/271 transitions.
// Phase 1: matrix 103 rows 157 cols
[2024-05-31 22:08:58] [INFO ] Computed 60 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (47982 resets) in 2866 ms. (348 steps per ms)
BEST_FIRST walk for 2000001 steps (18403 resets) in 2069 ms. (966 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-31 22:09:03] [INFO ] Invariant cache hit.
[2024-05-31 22:09:03] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 22:09:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 22:09:03] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-31 22:09:03] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 7 ms.
[2024-05-31 22:09:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:09:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-31 22:09:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-31 22:09:03] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-31 22:09:03] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 9 ms.
[2024-05-31 22:09:03] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:09:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-31 22:09:03] [INFO ] Added : 76 causal constraints over 16 iterations in 191 ms. Result :sat
Minimization took 40 ms.
[2024-05-31 22:09:03] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 22:09:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 22:09:03] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-31 22:09:03] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 8 ms.
[2024-05-31 22:09:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:09:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 22:09:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 22:09:03] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 22:09:03] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-31 22:09:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:09:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-31 22:09:03] [INFO ] Added : 82 causal constraints over 17 iterations in 179 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-31 22:09:04] [INFO ] Invariant cache hit.
[2024-05-31 22:09:04] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-31 22:09:04] [INFO ] Invariant cache hit.
[2024-05-31 22:09:04] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-31 22:09:04] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-31 22:09:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 103/259 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:09:06] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/260 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-31 22:09:06] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-31 22:09:07] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:09:07] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2024-05-31 22:09:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 223 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4429 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 103/259 variables, 156/222 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 100/322 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/260 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 323 constraints, problems are : Problem set: 0 solved, 100 unsolved in 14938 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints]
After SMT, in 19432ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 19443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19795 ms. Remains : 157/157 places, 103/103 transitions.
RANDOM walk for 40000 steps (1891 resets) in 948 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (367 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (353 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (351 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (354 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 996297 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 4
Probabilistic random walk after 996297 steps, saw 139796 distinct states, run finished after 3004 ms. (steps per millisecond=331 ) properties seen :0
[2024-05-31 22:09:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 89/224 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/237 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/239 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 12/251 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 9/260 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/260 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/260 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 217 constraints, problems are : Problem set: 0 solved, 4 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:09:27] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/135 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 89/224 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/237 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/239 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/239 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 12/251 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/251 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/251 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 9/260 variables, 9/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/260 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/260 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 222 constraints, problems are : Problem set: 0 solved, 4 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 368 ms.
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/157 places, 103/103 transitions.
RANDOM walk for 40000 steps (1888 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (379 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (364 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (355 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (391 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 915422 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :0 out of 4
Probabilistic random walk after 915422 steps, saw 128507 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
[2024-05-31 22:09:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 89/224 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/237 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/239 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 12/251 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 9/260 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/260 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/260 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 217 constraints, problems are : Problem set: 0 solved, 4 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:09:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/135 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 89/224 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/237 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/239 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/239 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 12/251 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/251 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/251 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 9/260 variables, 9/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/260 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/260 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 222 constraints, problems are : Problem set: 0 solved, 4 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 378 ms.
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-31 22:09:32] [INFO ] Invariant cache hit.
[2024-05-31 22:09:32] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-31 22:09:32] [INFO ] Invariant cache hit.
[2024-05-31 22:09:32] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-31 22:09:33] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-31 22:09:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 103/259 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-31 22:09:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:09:34] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/260 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-31 22:09:35] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-31 22:09:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:09:35] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:09:35] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 223 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4260 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 103/259 variables, 156/222 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 100/322 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/260 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 323 constraints, problems are : Problem set: 0 solved, 100 unsolved in 15375 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints]
After SMT, in 19664ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 19666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19952 ms. Remains : 157/157 places, 103/103 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 103
Applied a total of 1 rules in 11 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 103 rows 157 cols
[2024-05-31 22:09:52] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 22:09:52] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-31 22:09:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 22:09:52] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 22:09:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-31 22:09:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 22:09:52] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 22:09:52] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 22:09:52] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 305 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for DES-PT-10b-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 103 rows 157 cols
[2024-05-31 22:09:52] [INFO ] Computed 60 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (501 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10000 steps (89 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:09:53] [INFO ] Invariant cache hit.
[2024-05-31 22:09:53] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 22:09:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 22:09:53] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 22:09:53] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-31 22:09:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:09:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 22:09:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 22:09:53] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 22:09:53] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 7 ms.
[2024-05-31 22:09:53] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-31 22:09:53] [INFO ] Added : 76 causal constraints over 16 iterations in 196 ms. Result :sat
Minimization took 41 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 157 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p20) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 155 transition count 100
Applied a total of 2 rules in 6 ms. Remains 155 /157 variables (removed 2) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/157 places, 100/102 transitions.
// Phase 1: matrix 100 rows 155 cols
[2024-05-31 22:09:53] [INFO ] Computed 61 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47837 resets) in 2712 ms. (368 steps per ms)
BEST_FIRST walk for 1000001 steps (9080 resets) in 1024 ms. (975 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:09:57] [INFO ] Invariant cache hit.
[2024-05-31 22:09:57] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 22:09:57] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-31 22:09:57] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-31 22:09:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:09:57] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 22:09:57] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 22:09:57] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 22:09:57] [INFO ] Computed and/alt/rep : 88/216/88 causal constraints (skipped 9 transitions) in 6 ms.
[2024-05-31 22:09:57] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-31 22:09:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-31 22:09:57] [INFO ] Added : 78 causal constraints over 16 iterations in 197 ms. Result :sat
Minimization took 50 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 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 155/155 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-31 22:09:57] [INFO ] Invariant cache hit.
[2024-05-31 22:09:58] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 22:09:58] [INFO ] Invariant cache hit.
[2024-05-31 22:09:58] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-31 22:09:58] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-31 22:09:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 2/153 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/154 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 8 (OVERLAPS) 100/254 variables, 154/215 constraints. Problems are: Problem set: 3 solved, 94 unsolved
[2024-05-31 22:09:59] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:09:59] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
[2024-05-31 22:09:59] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
[2024-05-31 22:10:00] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 4/219 constraints. Problems are: Problem set: 3 solved, 94 unsolved
[2024-05-31 22:10:00] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:10:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 2/221 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/221 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 1/255 variables, 1/222 constraints. Problems are: Problem set: 3 solved, 94 unsolved
[2024-05-31 22:10:02] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 1/223 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/223 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 15 (OVERLAPS) 0/255 variables, 0/223 constraints. Problems are: Problem set: 3 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 223 constraints, problems are : Problem set: 3 solved, 94 unsolved in 5677 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 3 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 36/36 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 17/53 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 5/58 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/150 variables, 1/59 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 2/61 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 4/154 variables, 7/68 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 100/254 variables, 154/222 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 94/316 constraints. Problems are: Problem set: 3 solved, 94 unsolved
[2024-05-31 22:10:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 1/317 constraints. Problems are: Problem set: 3 solved, 94 unsolved
[2024-05-31 22:10:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/318 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/318 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 1/255 variables, 1/319 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 0/319 constraints. Problems are: Problem set: 3 solved, 94 unsolved
[2024-05-31 22:10:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/255 variables, 1/320 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/255 variables, 0/320 constraints. Problems are: Problem set: 3 solved, 94 unsolved
At refinement iteration 18 (OVERLAPS) 0/255 variables, 0/320 constraints. Problems are: Problem set: 3 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 320 constraints, problems are : Problem set: 3 solved, 94 unsolved in 21495 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 94/97 constraints, Known Traps: 10/10 constraints]
After SMT, in 27200ms problems are : Problem set: 3 solved, 94 unsolved
Search for dead transitions found 3 dead transitions in 27203ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 155/155 places, 97/100 transitions.
Graph (complete) has 478 edges and 155 vertex of which 152 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 152 /155 variables (removed 3) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 152 cols
[2024-05-31 22:10:25] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 22:10:25] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 22:10:25] [INFO ] Invariant cache hit.
[2024-05-31 22:10:25] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 152/155 places, 97/100 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27788 ms. Remains : 152/155 places, 97/100 transitions.
[2024-05-31 22:10:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47748 resets) in 2722 ms. (367 steps per ms)
BEST_FIRST walk for 1000001 steps (8905 resets) in 1012 ms. (987 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:10:29] [INFO ] Invariant cache hit.
[2024-05-31 22:10:29] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-31 22:10:29] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-31 22:10:29] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-31 22:10:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:10:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-31 22:10:29] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-31 22:10:29] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-31 22:10:29] [INFO ] Computed and/alt/rep : 85/207/85 causal constraints (skipped 9 transitions) in 6 ms.
[2024-05-31 22:10:29] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-31 22:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-31 22:10:29] [INFO ] Added : 79 causal constraints over 16 iterations in 169 ms. Result :sat
Minimization took 42 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, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-31 22:10:29] [INFO ] Invariant cache hit.
[2024-05-31 22:10:30] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 22:10:30] [INFO ] Invariant cache hit.
[2024-05-31 22:10:30] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-31 22:10:30] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-31 22:10:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 2/150 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:31] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/248 variables, 151/214 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:32] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:33] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:10:34] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (OVERLAPS) 1/249 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:35] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/249 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 19 (OVERLAPS) 0/249 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 220 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6998 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/150 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:37] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/248 variables, 151/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 94/314 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 1/249 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (OVERLAPS) 0/249 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 315 constraints, problems are : Problem set: 0 solved, 94 unsolved in 10015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 8/8 constraints]
After SMT, in 17038ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 17039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17310 ms. Remains : 152/152 places, 97/97 transitions.
RANDOM walk for 40000 steps (1919 resets) in 314 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (361 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (357 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1098733 steps, run timeout after 3012 ms. (steps per millisecond=364 ) properties seen :0 out of 2
Probabilistic random walk after 1098733 steps, saw 153517 distinct states, run finished after 3013 ms. (steps per millisecond=364 ) properties seen :0
[2024-05-31 22:10:50] [INFO ] Invariant cache hit.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 53/61 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/98 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/130 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/213 variables, 130/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/226 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/228 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 12/240 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/240 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 9/249 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/249 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/249 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/61 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/98 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/130 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/213 variables, 130/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/226 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/228 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 12/240 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/240 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/249 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/249 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/249 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 347ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 188 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 97/97 transitions.
RANDOM walk for 40000 steps (1875 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (352 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (372 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1139258 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :0 out of 2
Probabilistic random walk after 1139258 steps, saw 158728 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
[2024-05-31 22:10:54] [INFO ] Invariant cache hit.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 53/61 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/98 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/130 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/213 variables, 130/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/226 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/228 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 12/240 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/240 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 9/249 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/249 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/249 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/61 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/98 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/130 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/213 variables, 130/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/226 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/228 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 12/240 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/240 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/249 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/249 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/249 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-31 22:10:54] [INFO ] Invariant cache hit.
[2024-05-31 22:10:54] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-31 22:10:54] [INFO ] Invariant cache hit.
[2024-05-31 22:10:54] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-31 22:10:54] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-31 22:10:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 2/150 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:55] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/248 variables, 151/214 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:57] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (OVERLAPS) 1/249 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/249 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 19 (OVERLAPS) 0/249 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 220 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6996 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/150 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:11:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/248 variables, 151/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 94/314 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 1/249 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (OVERLAPS) 0/249 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 315 constraints, problems are : Problem set: 0 solved, 94 unsolved in 10164 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 8/8 constraints]
After SMT, in 17178ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 17179ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17453 ms. Remains : 152/152 places, 97/97 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 97
Applied a total of 1 rules in 11 ms. Remains 152 /152 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 97 rows 152 cols
[2024-05-31 22:11:12] [INFO ] Computed 61 invariants in 6 ms
[2024-05-31 22:11:12] [INFO ] [Real]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-31 22:11:12] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 22:11:12] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:11:12] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 22:11:12] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 22:11:12] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:11:12] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-31 22:11:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
TRAPS : Iteration 1
[2024-05-31 22:11:12] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:11:12] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 249 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-10b-UpperBounds-05 in 79328 ms.
Starting property specific reduction for DES-PT-10b-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 103 rows 157 cols
[2024-05-31 22:11:12] [INFO ] Computed 60 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (448 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 10001 steps (88 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:11:12] [INFO ] Invariant cache hit.
[2024-05-31 22:11:12] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 22:11:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-31 22:11:12] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-31 22:11:12] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 7 ms.
[2024-05-31 22:11:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:11:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 22:11:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-31 22:11:12] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 22:11:12] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-31 22:11:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:11:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-31 22:11:12] [INFO ] Added : 82 causal constraints over 17 iterations in 195 ms. Result :sat
Minimization took 43 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 157 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p40) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 102/102 transitions.
// Phase 1: matrix 102 rows 157 cols
[2024-05-31 22:11:12] [INFO ] Computed 61 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47857 resets) in 2722 ms. (367 steps per ms)
BEST_FIRST walk for 1000000 steps (9192 resets) in 1032 ms. (968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:11:16] [INFO ] Invariant cache hit.
[2024-05-31 22:11:16] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 22:11:16] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-31 22:11:16] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 22:11:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:11:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 22:11:16] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-31 22:11:16] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 22:11:16] [INFO ] Computed and/alt/rep : 88/202/88 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-31 22:11:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 22:11:17] [INFO ] Added : 83 causal constraints over 17 iterations in 189 ms. Result :sat
Minimization took 39 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/157 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-31 22:11:17] [INFO ] Invariant cache hit.
[2024-05-31 22:11:17] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 22:11:17] [INFO ] Invariant cache hit.
[2024-05-31 22:11:17] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-31 22:11:17] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-31 22:11:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 2/155 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/156 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 102/258 variables, 156/217 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:19] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:19] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:11:20] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 1/259 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:22] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/259 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 0/259 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 223 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6886 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 2/155 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:25] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-31 22:11:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 102/258 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 99/323 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:28] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 1/259 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:34] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/259 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 17 (OVERLAPS) 0/259 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 326 constraints, problems are : Problem set: 0 solved, 99 unsolved in 18850 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 9/9 constraints]
After SMT, in 25761ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 25763ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26027 ms. Remains : 157/157 places, 102/102 transitions.
RANDOM walk for 40000 steps (1912 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (369 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (389 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1347068 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 2
Probabilistic random walk after 1347068 steps, saw 185737 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2024-05-31 22:11:46] [INFO ] Invariant cache hit.
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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/92 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/126 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/135 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 88/223 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/236 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/238 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 12/250 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/250 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 9/259 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/259 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/259 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 157/157 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/92 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/126 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/135 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 88/223 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/236 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/238 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/238 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 12/250 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/250 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/259 variables, 9/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/259 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/259 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 360ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 102/102 transitions.
RANDOM walk for 40000 steps (1912 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (363 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (344 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1360117 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 2
Probabilistic random walk after 1360117 steps, saw 187792 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2024-05-31 22:11:49] [INFO ] Invariant cache hit.
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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/92 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/126 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/135 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 88/223 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/236 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/238 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 12/250 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/250 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 9/259 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/259 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/259 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 157/157 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/92 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/126 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/135 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 88/223 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/236 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/238 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/238 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 12/250 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/250 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/259 variables, 9/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/259 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/259 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-31 22:11:50] [INFO ] Invariant cache hit.
[2024-05-31 22:11:50] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 22:11:50] [INFO ] Invariant cache hit.
[2024-05-31 22:11:50] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-31 22:11:50] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-31 22:11:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 2/155 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/156 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 102/258 variables, 156/217 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:11:53] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 1/259 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:54] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/259 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 0/259 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 223 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6585 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 2/155 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:11:58] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-31 22:11:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 102/258 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 99/323 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:12:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 1/259 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-31 22:12:07] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/259 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 17 (OVERLAPS) 0/259 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 326 constraints, problems are : Problem set: 0 solved, 99 unsolved in 18829 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 9/9 constraints]
After SMT, in 25437ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 25438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25729 ms. Remains : 157/157 places, 102/102 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 102
Applied a total of 1 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 157 cols
[2024-05-31 22:12:16] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 22:12:16] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 22:12:16] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-31 22:12:16] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:12:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-31 22:12:16] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-31 22:12:16] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:12:16] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-31 22:12:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 1
[2024-05-31 22:12:16] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:12:16] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 244 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-10b-UpperBounds-07 in 64075 ms.
[2024-05-31 22:12:16] [INFO ] Flatten gal took : 53 ms
[2024-05-31 22:12:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 6 ms.
[2024-05-31 22:12:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 103 transitions and 521 arcs took 4 ms.
Total runtime 205503 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-10b-UpperBounds-05
Could not compute solution for formula : DES-PT-10b-UpperBounds-07

BK_STOP 1717193536886

--------------------
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 DES-PT-10b-UpperBounds-05
ub formula formula --maxsum=/tmp/1019/ub_0_
ub formula name DES-PT-10b-UpperBounds-07
ub formula formula --maxsum=/tmp/1019/ub_1_
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="DES-PT-10b"
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 DES-PT-10b, 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 r480-tall-171624189800677"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;