About the Execution of GreatSPN+red for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3608.476 | 1178889.00 | 1512348.00 | 2802.30 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r091-tall-171624188300733.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300733
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K 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-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716325699080
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 21:08:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 21:08:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:08:20] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-21 21:08:20] [INFO ] Transformed 314 places.
[2024-05-21 21:08:20] [INFO ] Transformed 271 transitions.
[2024-05-21 21:08:20] [INFO ] Found NUPN structural information;
[2024-05-21 21:08:20] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 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 257 rows 314 cols
[2024-05-21 21:08:20] [INFO ] Computed 59 invariants in 38 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 (221 resets) in 61 ms. (161 steps per ms)
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (369 resets) in 115 ms. (689 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-21 21:08:20] [INFO ] Invariant cache hit.
[2024-05-21 21:08:20] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2024-05-21 21:08:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:08:21] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-21 21:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-21 21:08:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:21] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-21 21:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:08:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 50 ms returned sat
[2024-05-21 21:08:21] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 22 ms.
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 15 ms to minimize.
[2024-05-21 21:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-05-21 21:08:22] [INFO ] Added : 130 causal constraints over 27 iterations in 1113 ms. Result :sat
Minimization took 276 ms.
[2024-05-21 21:08:22] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-21 21:08:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:08:23] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-21 21:08:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-21 21:08:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:23] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-21 21:08:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2024-05-21 21:08:23] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 21 ms.
[2024-05-21 21:08:23] [INFO ] Added : 67 causal constraints over 14 iterations in 494 ms. Result :sat
Minimization took 193 ms.
[2024-05-21 21:08:24] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-21 21:08:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:08:24] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-21 21:08:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 21:08:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:24] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-21 21:08:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2024-05-21 21:08:24] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 38 ms.
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-21 21:08:25] [INFO ] Added : 112 causal constraints over 23 iterations in 881 ms. Result :sat
Minimization took 255 ms.
[2024-05-21 21:08:25] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 21:08:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:08:25] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 21:08:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 21:08:25] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 21:08:26] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-21 21:08:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 80 ms returned sat
[2024-05-21 21:08:26] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:08:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-21 21:08:26] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 23 ms.
[2024-05-21 21:08:26] [INFO ] Added : 146 causal constraints over 30 iterations in 798 ms. Result :sat
Minimization took 259 ms.
[2024-05-21 21:08:27] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 21:08:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:08:27] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-21 21:08:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 21:08:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:27] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2024-05-21 21:08:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 64 ms returned sat
[2024-05-21 21:08:27] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-21 21:08:28] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:08:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-21 21:08:28] [INFO ] Added : 104 causal constraints over 21 iterations in 640 ms. Result :sat
Minimization took 276 ms.
[2024-05-21 21:08:28] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 21:08:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:29] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-21 21:08:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-21 21:08:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-21 21:08:29] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-21 21:08:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 133 ms returned sat
[2024-05-21 21:08:29] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 25 ms.
[2024-05-21 21:08:30] [INFO ] Added : 86 causal constraints over 18 iterations in 556 ms. Result :sat
Minimization took 311 ms.
[2024-05-21 21:08:30] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 21:08:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:08:30] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-21 21:08:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 21:08:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:08:30] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-21 21:08:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 64 ms returned sat
[2024-05-21 21:08:30] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 15 ms.
[2024-05-21 21:08:31] [INFO ] Added : 73 causal constraints over 15 iterations in 518 ms. Result :sat
Minimization took 249 ms.
[2024-05-21 21:08:31] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 21:08:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:31] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-21 21:08:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 21:08:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:32] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-21 21:08:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:08:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-21 21:08:32] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 13 ms.
[2024-05-21 21:08:32] [INFO ] Added : 153 causal constraints over 31 iterations in 759 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 125 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:08:35] [INFO ] Computed 60 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13654 resets) in 1962 ms. (509 steps per ms)
BEST_FIRST walk for 7000006 steps (15810 resets) in 5990 ms. (1168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-21 21:08:43] [INFO ] Invariant cache hit.
[2024-05-21 21:08:43] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:43] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-21 21:08:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:08:43] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-21 21:08:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:08:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:08:43] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 21:08:44] [INFO ] Added : 119 causal constraints over 24 iterations in 494 ms. Result :sat
Minimization took 118 ms.
[2024-05-21 21:08:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:44] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-21 21:08:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:08:44] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-21 21:08:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:08:44] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:08:45] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:08:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2024-05-21 21:08:45] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
[2024-05-21 21:08:45] [INFO ] Added : 125 causal constraints over 26 iterations in 519 ms. Result :sat
Minimization took 112 ms.
[2024-05-21 21:08:45] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:08:45] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 21:08:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:08:46] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 21:08:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:08:46] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 21:08:46] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 4 ms to minimize.
[2024-05-21 21:08:47] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:08:47] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:08:47] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:08:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:08:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 463 ms
[2024-05-21 21:08:47] [INFO ] Added : 195 causal constraints over 39 iterations in 1247 ms. Result :sat
Minimization took 130 ms.
[2024-05-21 21:08:47] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:47] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 21:08:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:08:47] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-21 21:08:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-21 21:08:47] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-21 21:08:48] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:08:48] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:08:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2024-05-21 21:08:48] [INFO ] Added : 151 causal constraints over 31 iterations in 763 ms. Result :sat
Minimization took 120 ms.
[2024-05-21 21:08:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:48] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-21 21:08:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 21:08:49] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-21 21:08:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-21 21:08:49] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 21:08:49] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:08:49] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:08:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2024-05-21 21:08:49] [INFO ] Added : 95 causal constraints over 20 iterations in 546 ms. Result :sat
Minimization took 102 ms.
[2024-05-21 21:08:49] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 21:08:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:08:49] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 21:08:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 21:08:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:08:50] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-21 21:08:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-21 21:08:50] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 21:08:50] [INFO ] Added : 77 causal constraints over 16 iterations in 334 ms. Result :sat
Minimization took 109 ms.
[2024-05-21 21:08:50] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:08:50] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-21 21:08:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:08:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:08:51] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-21 21:08:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 21:08:51] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 21:08:51] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:08:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-21 21:08:51] [INFO ] Added : 172 causal constraints over 36 iterations in 834 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-21 21:08:54] [INFO ] Invariant cache hit.
[2024-05-21 21:08:54] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 21:08:54] [INFO ] Invariant cache hit.
[2024-05-21 21:08:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:08:54] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-21 21:08:54] [INFO ] Redundant transitions in 12 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-21 21:08:54] [INFO ] Invariant cache hit.
[2024-05-21 21:08:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:09:00] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:09:04] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:09:04] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:09:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:09:04] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:09:06] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:09:10] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:09:14] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:09:17] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/633 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:09:49] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:09:53] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/14 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60866 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (550 resets) in 1742 ms. (22 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (94 resets) in 471 ms. (84 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (84 resets) in 420 ms. (95 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (84 resets) in 228 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (82 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (87 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (94 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (85 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (86 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (90 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (92 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (96 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (87 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (89 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (89 resets) in 65 ms. (606 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 620381 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 14
Probabilistic random walk after 620381 steps, saw 89096 distinct states, run finished after 3011 ms. (steps per millisecond=206 ) properties seen :0
[2024-05-21 21:09:59] [INFO ] Invariant cache hit.
[2024-05-21 21:09:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/252 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 204/456 variables, 252/307 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 21:10:00] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:10:00] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 63/519 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 1/520 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 21:10:01] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:10:01] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 44/564 variables, 44/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 377 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2535 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/252 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 204/456 variables, 252/310 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 10/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 63/519 variables, 14/336 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 1/520 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/520 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 44/564 variables, 44/391 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 21:10:04] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:10:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/564 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 21:10:05] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/564 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/564 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 0/564 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 394 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4225 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 7/7 constraints]
After SMT, in 6776ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 15738 ms.
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (539 resets) in 274 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (94 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (90 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (88 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (86 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (84 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (86 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (84 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (87 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (80 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (89 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (80 resets) in 72 ms. (548 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (89 resets) in 55 ms. (714 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (87 resets) in 56 ms. (701 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (91 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 630545 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 14
Probabilistic random walk after 630545 steps, saw 90777 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2024-05-21 21:10:25] [INFO ] Invariant cache hit.
[2024-05-21 21:10:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/252 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 204/456 variables, 252/307 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 21:10:26] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:10:26] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 63/519 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 1/520 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 21:10:27] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:10:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 44/564 variables, 44/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 377 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2419 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/252 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 204/456 variables, 252/310 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 10/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 63/519 variables, 14/336 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 1/520 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/520 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 44/564 variables, 44/391 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 21:10:30] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:10:30] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/564 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 21:10:31] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/564 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/564 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 0/564 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 394 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4048 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 7/7 constraints]
After SMT, in 6475ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 16090 ms.
Support contains 6 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (538 resets) in 255 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (92 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (91 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (94 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (91 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (95 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (95 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (94 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (93 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (81 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (88 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 631213 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 12
Probabilistic random walk after 631213 steps, saw 90870 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2024-05-21 21:10:51] [INFO ] Invariant cache hit.
[2024-05-21 21:10:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 180/186 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/219 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 25/244 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 7/251 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-21 21:10:52] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:10:52] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 63/516 variables, 12/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 1/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 47/564 variables, 47/375 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 375 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 180/186 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 33/219 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-21 21:10:53] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 25/244 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 7/251 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/309 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-21 21:10:54] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 63/516 variables, 12/334 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-21 21:10:55] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/516 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/516 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 1/517 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/517 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-21 21:10:56] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/517 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/517 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 47/564 variables, 47/391 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/564 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 0/564 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 391 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3684 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 6/6 constraints]
After SMT, in 5707ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 14974 ms.
Support contains 6 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-21 21:11:12] [INFO ] Invariant cache hit.
[2024-05-21 21:11:12] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 21:11:12] [INFO ] Invariant cache hit.
[2024-05-21 21:11:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:11:12] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-21 21:11:12] [INFO ] Redundant transitions in 7 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-21 21:11:12] [INFO ] Invariant cache hit.
[2024-05-21 21:11:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:11:18] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 6 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 timeout
0.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/633 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/14 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60742 ms. Remains : 311/311 places, 253/253 transitions.
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Starting property specific reduction for DES-PT-50a-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:12:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (132 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (22 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:12:13] [INFO ] Invariant cache hit.
[2024-05-21 21:12:13] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:12:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:12:13] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-21 21:12:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:12:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:12:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-21 21:12:13] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-21 21:12:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:12:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 21:12:13] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 21:12:13] [INFO ] Added : 119 causal constraints over 24 iterations in 495 ms. Result :sat
Minimization took 114 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 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p179) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 294 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 293 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 292 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 291 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 290 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 289 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 288 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 287 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 286 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 285 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 284 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 283 transition count 224
Applied a total of 28 rules in 51 ms. Remains 283 /311 variables (removed 28) and now considering 224/252 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 283/311 places, 224/252 transitions.
// Phase 1: matrix 224 rows 283 cols
[2024-05-21 21:12:14] [INFO ] Computed 61 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13679 resets) in 2014 ms. (496 steps per ms)
BEST_FIRST walk for 1000001 steps (2299 resets) in 917 ms. (1089 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:12:17] [INFO ] Invariant cache hit.
[2024-05-21 21:12:17] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 21:12:17] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:12:17] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-21 21:12:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:12:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 21:12:17] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:12:17] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 21:12:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:12:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-21 21:12:17] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:12:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-21 21:12:17] [INFO ] Computed and/alt/rep : 215/373/215 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 21:12:18] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-21 21:12:18] [INFO ] Added : 111 causal constraints over 23 iterations in 483 ms. Result :sat
Minimization took 111 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 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 283 /283 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 283/283 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 224/224 transitions.
Applied a total of 0 rules in 7 ms. Remains 283 /283 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-21 21:12:18] [INFO ] Invariant cache hit.
[2024-05-21 21:12:18] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 21:12:18] [INFO ] Invariant cache hit.
[2024-05-21 21:12:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:12:19] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-21 21:12:19] [INFO ] Redundant transitions in 5 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-21 21:12:19] [INFO ] Invariant cache hit.
[2024-05-21 21:12:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 2/281 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 7 (OVERLAPS) 224/506 variables, 282/343 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 2/345 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-21 21:12:26] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:12:26] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:12:26] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:12:26] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:12:27] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 5/350 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/350 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/507 variables, 1/351 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 1/352 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 1/353 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 2/355 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 0/355 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/507 variables, 0/355 constraints. Problems are: Problem set: 47 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 355 constraints, problems are : Problem set: 47 solved, 174 unsolved in 25035 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 283/283 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 47 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/57 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/234 variables, 1/58 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 2/60 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/60 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 48/282 variables, 8/68 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 2/70 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/71 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-21 21:12:47] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/72 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/72 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 224/506 variables, 282/354 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 2/356 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/506 variables, 174/530 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/530 constraints. Problems are: Problem set: 47 solved, 174 unsolved
SMT process timed out in 55178ms, After SMT, problems are : Problem set: 47 solved, 174 unsolved
Search for dead transitions found 47 dead transitions in 55180ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 283/283 places, 177/224 transitions.
Graph (complete) has 795 edges and 283 vertex of which 236 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 236 /283 variables (removed 47) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 236 cols
[2024-05-21 21:13:14] [INFO ] Computed 61 invariants in 8 ms
[2024-05-21 21:13:14] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 21:13:14] [INFO ] Invariant cache hit.
[2024-05-21 21:13:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:13:14] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 236/283 places, 177/224 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56100 ms. Remains : 236/283 places, 177/224 transitions.
[2024-05-21 21:13:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13657 resets) in 1791 ms. (558 steps per ms)
BEST_FIRST walk for 1000001 steps (2250 resets) in 840 ms. (1189 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:13:17] [INFO ] Invariant cache hit.
[2024-05-21 21:13:17] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:13:17] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 21:13:17] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 21:13:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:13:17] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-21 21:13:17] [INFO ] Computed and/alt/rep : 168/278/168 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-21 21:13:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:13:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:13:17] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 21:13:17] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-21 21:13:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-21 21:13:17] [INFO ] Computed and/alt/rep : 168/278/168 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-21 21:13:18] [INFO ] Added : 113 causal constraints over 23 iterations in 302 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 236/236 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-21 21:13:18] [INFO ] Invariant cache hit.
[2024-05-21 21:13:18] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 21:13:18] [INFO ] Invariant cache hit.
[2024-05-21 21:13:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:13:18] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-21 21:13:18] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 21:13:18] [INFO ] Invariant cache hit.
[2024-05-21 21:13:18] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 2/234 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 1/235 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:13:21] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 177/412 variables, 235/297 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/413 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:13:29] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/413 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 306 constraints, problems are : Problem set: 0 solved, 174 unsolved in 15668 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (OVERLAPS) 177/412 variables, 235/313 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 174/489 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:13:46] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:13:47] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:13:47] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/413 variables, and 492 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 235/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 20/20 constraints]
After SMT, in 45764ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 45766ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46137 ms. Remains : 236/236 places, 177/177 transitions.
RANDOM walk for 40000 steps (561 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1248825 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 2
Probabilistic random walk after 1248825 steps, saw 174599 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
[2024-05-21 21:14:07] [INFO ] Invariant cache hit.
[2024-05-21 21:14:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 72/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/132 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/166 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/175 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/299 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/311 variables, 8/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/312 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/312 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/312 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/364 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/364 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/413 variables, 49/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 299 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 72/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/132 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/166 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/175 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/299 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/311 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/311 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/312 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/312 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/364 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/413 variables, 49/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 468ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 575 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 236/236 places, 177/177 transitions.
RANDOM walk for 40000 steps (534 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (89 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (89 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1345798 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 2
Probabilistic random walk after 1345798 steps, saw 188032 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2024-05-21 21:14:11] [INFO ] Invariant cache hit.
[2024-05-21 21:14:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 72/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/132 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/166 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/175 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/299 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/311 variables, 8/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/312 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/312 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/312 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/364 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/364 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/413 variables, 49/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 299 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 72/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/132 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/166 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/175 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/299 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/311 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/311 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/312 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/312 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/364 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/413 variables, 49/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 512 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-21 21:14:12] [INFO ] Invariant cache hit.
[2024-05-21 21:14:12] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 21:14:12] [INFO ] Invariant cache hit.
[2024-05-21 21:14:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:14:13] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-21 21:14:13] [INFO ] Redundant transitions in 0 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 21:14:13] [INFO ] Invariant cache hit.
[2024-05-21 21:14:13] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 2/234 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 1/235 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:14:16] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 177/412 variables, 235/297 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/413 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:14:19] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:14:19] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:14:20] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:14:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:14:20] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:14:23] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/413 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 306 constraints, problems are : Problem set: 0 solved, 174 unsolved in 15541 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:14:30] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:14:30] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:14:30] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:14:30] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:14:32] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:14:32] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:14:32] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:14:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:14:33] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:14:33] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (OVERLAPS) 177/412 variables, 235/313 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 174/489 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:14:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:14:41] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:14:42] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/413 variables, and 492 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 235/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 20/20 constraints]
After SMT, in 45615ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 45617ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45981 ms. Remains : 236/236 places, 177/177 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 236 transition count 177
Applied a total of 1 rules in 14 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 177 rows 236 cols
[2024-05-21 21:14:58] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 21:14:58] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 21:14:58] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 21:14:58] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:14:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 21:14:58] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 21:14:58] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:14:59] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:14:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:14:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
TRAPS : Iteration 1
[2024-05-21 21:14:59] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:14:59] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 386 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50a-UpperBounds-02 in 166148 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:14:59] [INFO ] Computed 60 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (139 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:14:59] [INFO ] Invariant cache hit.
[2024-05-21 21:14:59] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:14:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:14:59] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-21 21:14:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:14:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:14:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:14:59] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-21 21:14:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:14:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:14:59] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:14:59] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:14:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2024-05-21 21:14:59] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 21:15:00] [INFO ] Added : 125 causal constraints over 26 iterations in 496 ms. Result :sat
Minimization took 109 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 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p31) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 294 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 293 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 292 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 291 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 290 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 289 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 288 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 287 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 286 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 285 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 284 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 283 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 282 transition count 223
Applied a total of 29 rules in 42 ms. Remains 282 /311 variables (removed 29) and now considering 223/252 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 282/311 places, 223/252 transitions.
// Phase 1: matrix 223 rows 282 cols
[2024-05-21 21:15:00] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13640 resets) in 1861 ms. (537 steps per ms)
BEST_FIRST walk for 1000001 steps (2249 resets) in 855 ms. (1168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:15:03] [INFO ] Invariant cache hit.
[2024-05-21 21:15:03] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-21 21:15:03] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 21:15:03] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-21 21:15:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:15:03] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 21:15:03] [INFO ] Computed and/alt/rep : 214/320/214 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 21:15:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:15:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:15:03] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 21:15:03] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-21 21:15:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 21:15:03] [INFO ] Computed and/alt/rep : 214/320/214 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 21:15:04] [INFO ] Added : 124 causal constraints over 25 iterations in 415 ms. Result :sat
Minimization took 98 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 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 282/282 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-21 21:15:04] [INFO ] Invariant cache hit.
[2024-05-21 21:15:04] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 21:15:04] [INFO ] Invariant cache hit.
[2024-05-21 21:15:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:15:05] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-21 21:15:05] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-21 21:15:05] [INFO ] Invariant cache hit.
[2024-05-21 21:15:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 2/281 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD222 is UNSAT
At refinement iteration 7 (OVERLAPS) 223/504 variables, 281/342 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 2/344 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:12] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:15:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:15:13] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 3/347 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:16] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:15:16] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:15:16] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:15:16] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:15:16] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:15:16] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:15:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:15:16] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 8/355 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:19] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 1/356 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:19] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 1/357 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/357 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 14 (OVERLAPS) 1/505 variables, 1/358 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:27] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 1/359 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:30] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:15:30] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:15:30] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:15:30] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:15:30] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 5/364 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/364 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:33] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/505 variables, 1/365 constraints. Problems are: Problem set: 54 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 365 constraints, problems are : Problem set: 54 solved, 166 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 54 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 35/35 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 17/52 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 10/62 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/62 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 1/225 variables, 1/63 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 3/66 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/67 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/67 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 56/281 variables, 8/75 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 5/80 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-21 21:15:38] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:15:38] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 2/82 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/82 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 223/504 variables, 281/363 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 2/365 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 166/531 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/531 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 16 (OVERLAPS) 1/505 variables, 1/532 constraints. Problems are: Problem set: 54 solved, 166 unsolved
SMT process timed out in 60147ms, After SMT, problems are : Problem set: 54 solved, 166 unsolved
Search for dead transitions found 54 dead transitions in 60150ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 282/282 places, 169/223 transitions.
Graph (complete) has 754 edges and 282 vertex of which 228 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.0 ms
Discarding 54 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 228 /282 variables (removed 54) and now considering 169/169 (removed 0) transitions.
// Phase 1: matrix 169 rows 228 cols
[2024-05-21 21:16:05] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 21:16:05] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 21:16:05] [INFO ] Invariant cache hit.
[2024-05-21 21:16:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:16:05] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 228/282 places, 169/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60926 ms. Remains : 228/282 places, 169/223 transitions.
[2024-05-21 21:16:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13616 resets) in 1771 ms. (564 steps per ms)
BEST_FIRST walk for 1000001 steps (2299 resets) in 837 ms. (1193 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:16:08] [INFO ] Invariant cache hit.
[2024-05-21 21:16:08] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 21:16:08] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 21:16:08] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-21 21:16:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:08] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 21:16:08] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 21:16:08] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-21 21:16:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:16:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:16:08] [INFO ] Computed and/alt/rep : 160/258/160 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-21 21:16:08] [INFO ] Added : 128 causal constraints over 26 iterations in 346 ms. Result :sat
Minimization took 71 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 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 169/169 transitions.
Applied a total of 0 rules in 14 ms. Remains 228 /228 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 228/228 places, 169/169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 169/169 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2024-05-21 21:16:09] [INFO ] Invariant cache hit.
[2024-05-21 21:16:09] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 21:16:09] [INFO ] Invariant cache hit.
[2024-05-21 21:16:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:16:09] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-21 21:16:09] [INFO ] Redundant transitions in 0 ms returned []
Running 166 sub problems to find dead transitions.
[2024-05-21 21:16:09] [INFO ] Invariant cache hit.
[2024-05-21 21:16:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 1/225 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 2/227 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 169/396 variables, 227/288 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 21:16:14] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:16:14] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 1/397 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 21:16:17] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 21:16:19] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/397 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 21:16:23] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:16:23] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:16:23] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:16:23] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/397 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 21:16:24] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 19 (OVERLAPS) 0/397 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 303 constraints, problems are : Problem set: 0 solved, 166 unsolved in 19265 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/228 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 1/225 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 2/227 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 169/396 variables, 227/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 166/467 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 21:16:35] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 21:16:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/397 variables, and 469 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 227/228 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 13/14 constraints]
After SMT, in 49336ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 49338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49711 ms. Remains : 228/228 places, 169/169 transitions.
RANDOM walk for 40000 steps (546 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (88 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (95 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1244903 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :0 out of 2
Probabilistic random walk after 1244903 steps, saw 174026 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
[2024-05-21 21:17:02] [INFO ] Invariant cache hit.
[2024-05-21 21:17:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 80/100 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/135 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/160 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/167 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 116/283 variables, 167/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/295 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/295 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/296 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/296 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/296 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/348 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/348 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/348 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/397 variables, 49/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/397 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/397 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/228 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 80/100 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/135 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/160 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/167 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 116/283 variables, 167/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:17:02] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/295 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/295 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/295 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/296 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/296 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/296 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 52/348 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/348 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/348 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 49/397 variables, 49/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/397 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/397 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 294 constraints, problems are : Problem set: 0 solved, 2 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/228 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 536ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1010 steps, including 1 resets, run visited all 2 properties in 8 ms. (steps per millisecond=126 )
Parikh walk visited 2 properties in 11 ms.
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-50a-UpperBounds-06 in 123535 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:17:02] [INFO ] Computed 60 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10000 steps (21 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:17:02] [INFO ] Invariant cache hit.
[2024-05-21 21:17:02] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:17:02] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-21 21:17:02] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-21 21:17:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:17:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:17:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:17:03] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-21 21:17:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:17:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:17:03] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-21 21:17:03] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:17:04] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:17:04] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:17:04] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:17:04] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:17:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 433 ms
[2024-05-21 21:17:04] [INFO ] Added : 195 causal constraints over 39 iterations in 1224 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p170) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 294 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 293 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 292 transition count 233
Applied a total of 19 rules in 29 ms. Remains 292 /311 variables (removed 19) and now considering 233/252 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 292/311 places, 233/252 transitions.
// Phase 1: matrix 233 rows 292 cols
[2024-05-21 21:17:04] [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 (13686 resets) in 1855 ms. (538 steps per ms)
BEST_FIRST walk for 1000001 steps (2284 resets) in 852 ms. (1172 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:17:07] [INFO ] Invariant cache hit.
[2024-05-21 21:17:07] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 21:17:07] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:17:07] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-21 21:17:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:17:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:17:07] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:17:07] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-21 21:17:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:17:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-21 21:17:07] [INFO ] Computed and/alt/rep : 224/382/224 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 21:17:08] [INFO ] Added : 149 causal constraints over 30 iterations in 543 ms. Result :sat
Minimization took 132 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 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 292 /292 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 292/292 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 292 /292 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-21 21:17:08] [INFO ] Invariant cache hit.
[2024-05-21 21:17:08] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 21:17:08] [INFO ] Invariant cache hit.
[2024-05-21 21:17:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:17:09] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-21 21:17:09] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-21 21:17:09] [INFO ] Invariant cache hit.
[2024-05-21 21:17:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 2/290 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:17:14] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 8 (OVERLAPS) 233/524 variables, 291/353 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 2/355 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 0/355 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 1/525 variables, 1/356 constraints. Problems are: Problem set: 29 solved, 201 unsolved
[2024-05-21 21:17:19] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:17:19] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 5/361 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/361 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 14 (OVERLAPS) 0/525 variables, 0/361 constraints. Problems are: Problem set: 29 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 361 constraints, problems are : Problem set: 29 solved, 201 unsolved in 17481 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 292/292 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 29 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 5/57 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/57 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 1/58 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 1/59 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/59 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 30/291 variables, 8/67 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/67 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 233/524 variables, 291/358 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 2/360 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 201/561 constraints. Problems are: Problem set: 29 solved, 201 unsolved
[2024-05-21 21:17:35] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:17:36] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:17:38] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:17:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:17:38] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:17:46] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 6/567 constraints. Problems are: Problem set: 29 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/525 variables, and 567 constraints, problems are : Problem set: 29 solved, 201 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/292 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/230 constraints, Known Traps: 12/12 constraints]
After SMT, in 47633ms problems are : Problem set: 29 solved, 201 unsolved
Search for dead transitions found 29 dead transitions in 47636ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 292/292 places, 204/233 transitions.
Graph (complete) has 903 edges and 292 vertex of which 263 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 263 /292 variables (removed 29) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 263 cols
[2024-05-21 21:17:56] [INFO ] Computed 61 invariants in 16 ms
[2024-05-21 21:17:57] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 21:17:57] [INFO ] Invariant cache hit.
[2024-05-21 21:17:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:17:57] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 263/292 places, 204/233 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48575 ms. Remains : 263/292 places, 204/233 transitions.
[2024-05-21 21:17:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13638 resets) in 1847 ms. (541 steps per ms)
BEST_FIRST walk for 1000001 steps (2295 resets) in 861 ms. (1160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:18:00] [INFO ] Invariant cache hit.
[2024-05-21 21:18:00] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:18:00] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 21:18:00] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-21 21:18:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:18:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-21 21:18:00] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:18:00] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-21 21:18:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:18:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 21:18:00] [INFO ] Computed and/alt/rep : 195/323/195 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 21:18:00] [INFO ] Added : 193 causal constraints over 39 iterations in 629 ms. Result :sat
Minimization took 132 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 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 263/263 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:18:01] [INFO ] Invariant cache hit.
[2024-05-21 21:18:01] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 21:18:01] [INFO ] Invariant cache hit.
[2024-05-21 21:18:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:18:01] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-21 21:18:01] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-21 21:18:01] [INFO ] Invariant cache hit.
[2024-05-21 21:18:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 2/261 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 1/262 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 204/466 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:18:07] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:18:08] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:18:08] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:18:08] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 1/467 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:18:14] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:14] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/467 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/467 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 16 (OVERLAPS) 0/467 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 336 constraints, problems are : Problem set: 0 solved, 201 unsolved in 22996 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 1/262 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:18:27] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:18:29] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 204/466 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 201/538 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:18:37] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:18:42] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/467 variables, and 541 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 262/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 15/15 constraints]
After SMT, in 53120ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 53123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53545 ms. Remains : 263/263 places, 204/204 transitions.
RANDOM walk for 40000 steps (552 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (80 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1236352 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :0 out of 2
Probabilistic random walk after 1236352 steps, saw 172982 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
[2024-05-21 21:18:58] [INFO ] Invariant cache hit.
[2024-05-21 21:18:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/159 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/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/193 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/365 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/366 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/418 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/467 variables, 49/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/467 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/467 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 326 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/159 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/193 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/365 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/366 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/418 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/467 variables, 49/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/467 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/467 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1084 ms.
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 263/263 places, 204/204 transitions.
RANDOM walk for 40000 steps (552 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (96 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1096256 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :0 out of 2
Probabilistic random walk after 1096256 steps, saw 153393 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :0
[2024-05-21 21:19:02] [INFO ] Invariant cache hit.
[2024-05-21 21:19:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/159 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/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/193 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/365 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/366 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/418 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/467 variables, 49/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/467 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/467 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 326 constraints, problems are : Problem set: 0 solved, 2 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/159 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/193 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/365 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/366 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/418 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/467 variables, 49/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/467 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/467 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1320 ms.
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 263/263 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:19:04] [INFO ] Invariant cache hit.
[2024-05-21 21:19:05] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 21:19:05] [INFO ] Invariant cache hit.
[2024-05-21 21:19:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:19:05] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-05-21 21:19:05] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-21 21:19:05] [INFO ] Invariant cache hit.
[2024-05-21 21:19:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 2/261 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 1/262 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 204/466 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:19:11] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:19:11] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:19:11] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:19:11] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 1/467 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:19:18] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:19:18] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:19:21] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:19:21] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:19:21] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:19:22] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/467 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/467 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 16 (OVERLAPS) 0/467 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 336 constraints, problems are : Problem set: 0 solved, 201 unsolved in 22944 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 1/262 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:19:30] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:19:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 204/466 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 201/538 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 21:19:40] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:19:46] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:19:49] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/467 variables, and 541 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 262/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 15/15 constraints]
After SMT, in 53053ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 53057ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53492 ms. Remains : 263/263 places, 204/204 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 263 transition count 204
Applied a total of 1 rules in 7 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 204 rows 263 cols
[2024-05-21 21:19:58] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 21:19:58] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 21:19:58] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:19:58] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:19:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 21:19:58] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:19:58] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:19:58] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:19:58] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 303 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50a-UpperBounds-08 in 176019 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-09
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 253 rows 311 cols
[2024-05-21 21:19:58] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (23 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:19:58] [INFO ] Invariant cache hit.
[2024-05-21 21:19:58] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:19:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-21 21:19:58] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-21 21:19:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:19:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:19:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:19:59] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-21 21:19:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:19:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2024-05-21 21:19:59] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 21:19:59] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:19:59] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:19:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2024-05-21 21:19:59] [INFO ] Added : 151 causal constraints over 31 iterations in 755 ms. Result :sat
Minimization took 118 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 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p34) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 294 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 293 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 292 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 291 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 290 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 289 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 288 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 287 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 286 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 285 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 284 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 283 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 282 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 281 transition count 222
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 280 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 279 transition count 220
Applied a total of 32 rules in 29 ms. Remains 279 /311 variables (removed 32) and now considering 220/252 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 279/311 places, 220/252 transitions.
// Phase 1: matrix 220 rows 279 cols
[2024-05-21 21:20:00] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13599 resets) in 1849 ms. (540 steps per ms)
BEST_FIRST walk for 1000001 steps (2271 resets) in 827 ms. (1207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:20:03] [INFO ] Invariant cache hit.
[2024-05-21 21:20:03] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:20:03] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-21 21:20:03] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-21 21:20:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:20:03] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-21 21:20:03] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:20:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:20:03] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:03] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-21 21:20:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2024-05-21 21:20:03] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 21:20:03] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:20:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2024-05-21 21:20:03] [INFO ] Computed and/alt/rep : 211/311/211 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 21:20:04] [INFO ] Added : 101 causal constraints over 21 iterations in 385 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 279/279 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-21 21:20:04] [INFO ] Invariant cache hit.
[2024-05-21 21:20:04] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 21:20:04] [INFO ] Invariant cache hit.
[2024-05-21 21:20:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:20:05] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-05-21 21:20:05] [INFO ] Redundant transitions in 1 ms returned []
Running 217 sub problems to find dead transitions.
[2024-05-21 21:20:05] [INFO ] Invariant cache hit.
[2024-05-21 21:20:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/276 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 2/278 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 7 (OVERLAPS) 220/498 variables, 278/339 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 2/341 constraints. Problems are: Problem set: 60 solved, 157 unsolved
[2024-05-21 21:20:12] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:20:13] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:20:13] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 3/344 constraints. Problems are: Problem set: 60 solved, 157 unsolved
[2024-05-21 21:20:15] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:20:15] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:20:15] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 3/347 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/347 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 1/499 variables, 1/348 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 0/348 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 14 (OVERLAPS) 0/499 variables, 0/348 constraints. Problems are: Problem set: 60 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 348 constraints, problems are : Problem set: 60 solved, 157 unsolved in 17910 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 60 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 35/35 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 17/52 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 6/58 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/58 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 1/216 variables, 1/59 constraints. Problems are: Problem set: 60 solved, 157 unsolved
[2024-05-21 21:20:23] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 1/60 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/60 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 62/278 variables, 8/68 constraints. Problems are: Problem set: 60 solved, 157 unsolved
[2024-05-21 21:20:25] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 1/69 constraints. Problems are: Problem set: 60 solved, 157 unsolved
[2024-05-21 21:20:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:20:26] [INFO ] Deduced a trap composed of 50 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:20:26] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 3/72 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/72 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 220/498 variables, 278/350 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 2/352 constraints. Problems are: Problem set: 60 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 157/509 constraints. Problems are: Problem set: 60 solved, 157 unsolved
[2024-05-21 21:20:34] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:20:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 2/511 constraints. Problems are: Problem set: 60 solved, 157 unsolved
[2024-05-21 21:20:49] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:20:49] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/499 variables, and 513 constraints, problems are : Problem set: 60 solved, 157 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/279 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 157/217 constraints, Known Traps: 15/15 constraints]
After SMT, in 48034ms problems are : Problem set: 60 solved, 157 unsolved
Search for dead transitions found 60 dead transitions in 48037ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 279/279 places, 160/220 transitions.
Graph (complete) has 718 edges and 279 vertex of which 219 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 219 /279 variables (removed 60) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 219 cols
[2024-05-21 21:20:53] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 21:20:53] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 21:20:53] [INFO ] Invariant cache hit.
[2024-05-21 21:20:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:20:53] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 219/279 places, 160/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48854 ms. Remains : 219/279 places, 160/220 transitions.
[2024-05-21 21:20:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13612 resets) in 1744 ms. (573 steps per ms)
BEST_FIRST walk for 1000001 steps (2244 resets) in 821 ms. (1216 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:20:56] [INFO ] Invariant cache hit.
[2024-05-21 21:20:56] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-21 21:20:56] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 21:20:56] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-21 21:20:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-21 21:20:56] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 21:20:56] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-21 21:20:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:20:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 21:20:56] [INFO ] Computed and/alt/rep : 151/243/151 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-21 21:20:56] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-21 21:20:56] [INFO ] Added : 143 causal constraints over 29 iterations in 426 ms. Result :sat
Minimization took 68 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 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 219/219 places, 160/160 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-21 21:20:56] [INFO ] Invariant cache hit.
[2024-05-21 21:20:57] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 21:20:57] [INFO ] Invariant cache hit.
[2024-05-21 21:20:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:20:57] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-21 21:20:57] [INFO ] Redundant transitions in 1 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-21 21:20:57] [INFO ] Invariant cache hit.
[2024-05-21 21:20:57] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 1/216 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 2/218 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 160/378 variables, 218/279 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 21:21:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:21:01] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:21:01] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 1/379 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 21:21:04] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:21:04] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 21:21:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/379 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 16 (OVERLAPS) 0/379 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 288 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13698 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 219/219 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 1/216 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 21:21:12] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 160/378 variables, 218/286 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 157/445 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 21:21:16] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:21:17] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 21:21:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 21:21:37] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/379 variables, and 449 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 218/219 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 11/11 constraints]
After SMT, in 43771ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 43773ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44110 ms. Remains : 219/219 places, 160/160 transitions.
RANDOM walk for 40000 steps (541 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (97 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1232313 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 2
Probabilistic random walk after 1232313 steps, saw 172433 distinct states, run finished after 3001 ms. (steps per millisecond=410 ) properties seen :0
[2024-05-21 21:21:44] [INFO ] Invariant cache hit.
[2024-05-21 21:21:44] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 74/91 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/126 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/151 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/158 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 107/265 variables, 158/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/277 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/277 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/278 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:21:44] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:21:44] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:21:44] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/278 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/278 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/330 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/330 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/330 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/379 variables, 49/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/379 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/379 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 219/219 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 74/91 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/126 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/151 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/158 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 107/265 variables, 158/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/277 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/277 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/277 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/277 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/278 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/278 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/278 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/278 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 52/330 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/330 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/330 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 49/379 variables, 49/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/379 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/379 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 219/219 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1577 steps, including 4 resets, run visited all 2 properties in 20 ms. (steps per millisecond=78 )
Parikh walk visited 2 properties in 19 ms.
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-50a-UpperBounds-09 in 106048 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:21:44] [INFO ] Computed 60 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (147 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10000 steps (17 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:21:44] [INFO ] Invariant cache hit.
[2024-05-21 21:21:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:21:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 21:21:44] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 21:21:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:21:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:21:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:21:45] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-21 21:21:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:21:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-05-21 21:21:45] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 21:21:45] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:21:45] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:21:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-21 21:21:45] [INFO ] Added : 95 causal constraints over 20 iterations in 557 ms. Result :sat
Minimization took 99 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 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p111) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Applied a total of 10 rules in 12 ms. Remains 301 /311 variables (removed 10) and now considering 242/252 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 301/311 places, 242/252 transitions.
// Phase 1: matrix 242 rows 301 cols
[2024-05-21 21:21:46] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13691 resets) in 1900 ms. (526 steps per ms)
BEST_FIRST walk for 1000001 steps (2300 resets) in 876 ms. (1140 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:21:49] [INFO ] Invariant cache hit.
[2024-05-21 21:21:49] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 21:21:49] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:21:49] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-21 21:21:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:21:49] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 21:21:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:21:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-05-21 21:21:49] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:21:49] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-21 21:21:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 21:21:49] [INFO ] Computed and/alt/rep : 233/397/233 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 21:21:49] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-21 21:21:49] [INFO ] Added : 87 causal constraints over 18 iterations in 436 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 301/301 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-21 21:21:50] [INFO ] Invariant cache hit.
[2024-05-21 21:21:50] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 21:21:50] [INFO ] Invariant cache hit.
[2024-05-21 21:21:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:21:50] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-21 21:21:50] [INFO ] Redundant transitions in 1 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-21 21:21:50] [INFO ] Invariant cache hit.
[2024-05-21 21:21:50] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 2/299 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 2/301 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 239 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 242/543 variables, 301/362 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:22:00] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:22:00] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:22:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:22:02] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
[2024-05-21 21:22:04] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:22:10] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/543 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:22:13] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/543 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 15 (OVERLAPS) 0/543 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 371 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 2/299 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 2/301 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 242/543 variables, 301/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 239/610 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:22:39] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 611 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 8/8 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60676 ms. Remains : 301/301 places, 242/242 transitions.
RANDOM walk for 40000 steps (542 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1200987 steps, run timeout after 3001 ms. (steps per millisecond=400 ) properties seen :0 out of 2
Probabilistic random walk after 1200987 steps, saw 168187 distinct states, run finished after 3001 ms. (steps per millisecond=400 ) properties seen :0
[2024-05-21 21:22:54] [INFO ] Invariant cache hit.
[2024-05-21 21:22:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/79 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/87 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/100 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/102 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/106 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/106 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 167/273 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/307 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/307 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/339 variables, 22/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/339 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/348 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/348 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 195/543 variables, 250/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/543 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/543 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/543 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/543 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 364 constraints, problems are : Problem set: 0 solved, 2 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/79 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/87 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/100 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/102 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/106 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/106 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 167/273 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/273 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/307 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/307 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/339 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:22:54] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/339 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/339 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/348 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/348 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 195/543 variables, 250/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/543 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/543 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 757ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 965 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 301/301 places, 242/242 transitions.
RANDOM walk for 40000 steps (533 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1021453 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 2
Probabilistic random walk after 1021453 steps, saw 144366 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2024-05-21 21:22:58] [INFO ] Invariant cache hit.
[2024-05-21 21:22:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/79 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/87 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/100 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/102 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/106 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/106 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 167/273 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/307 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/307 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/339 variables, 22/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/339 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/348 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/348 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 195/543 variables, 250/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/543 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/543 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/543 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/543 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 364 constraints, problems are : Problem set: 0 solved, 2 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/79 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/87 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/100 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/102 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/106 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/106 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 167/273 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/273 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/307 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/307 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/339 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:22:59] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/339 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/339 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/348 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/348 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 195/543 variables, 250/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/543 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/543 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 786ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1311 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 301/301 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-21 21:23:01] [INFO ] Invariant cache hit.
[2024-05-21 21:23:01] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 21:23:01] [INFO ] Invariant cache hit.
[2024-05-21 21:23:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:23:01] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-21 21:23:01] [INFO ] Redundant transitions in 1 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-21 21:23:01] [INFO ] Invariant cache hit.
[2024-05-21 21:23:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 2/299 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 2/301 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 239 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 242/543 variables, 301/362 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 3 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:23:21] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/543 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:23:24] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/543 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 15 (OVERLAPS) 0/543 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 371 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 2/299 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 2/301 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 242/543 variables, 301/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 239/610 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 21:23:50] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 611 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 8/8 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60685 ms. Remains : 301/301 places, 242/242 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 21:24:01] [INFO ] Invariant cache hit.
[2024-05-21 21:24:01] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 21:24:01] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 23 ms returned sat
[2024-05-21 21:24:01] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:24:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:24:01] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:24:02] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:24:02] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:24:02] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 350 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50a-UpperBounds-10 in 137319 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 21:24:02] [INFO ] Computed 60 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (139 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:24:02] [INFO ] Invariant cache hit.
[2024-05-21 21:24:02] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-21 21:24:02] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 21:24:02] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 21:24:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:24:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 21:24:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-21 21:24:02] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-21 21:24:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:24:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-21 21:24:02] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 21:24:03] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-21 21:24:03] [INFO ] Added : 172 causal constraints over 36 iterations in 840 ms. Result :sat
Minimization took 117 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 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p167) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Applied a total of 16 rules in 17 ms. Remains 295 /311 variables (removed 16) and now considering 236/252 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 295/311 places, 236/252 transitions.
// Phase 1: matrix 236 rows 295 cols
[2024-05-21 21:24:03] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13678 resets) in 1834 ms. (544 steps per ms)
BEST_FIRST walk for 1000001 steps (2263 resets) in 835 ms. (1196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:24:06] [INFO ] Invariant cache hit.
[2024-05-21 21:24:06] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 21:24:06] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:24:06] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-21 21:24:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:24:06] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 21:24:06] [INFO ] Computed and/alt/rep : 227/385/227 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 21:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:24:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 21:24:07] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 21:24:07] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 21:24:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2024-05-21 21:24:07] [INFO ] Computed and/alt/rep : 227/385/227 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 21:24:08] [INFO ] Added : 202 causal constraints over 41 iterations in 870 ms. Result :sat
Minimization took 160 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 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 236/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 295 /295 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 295/295 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 236/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 295 /295 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2024-05-21 21:24:08] [INFO ] Invariant cache hit.
[2024-05-21 21:24:08] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 21:24:08] [INFO ] Invariant cache hit.
[2024-05-21 21:24:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:24:09] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-21 21:24:09] [INFO ] Redundant transitions in 1 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-21 21:24:09] [INFO ] Invariant cache hit.
[2024-05-21 21:24:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 2/293 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 1/294 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 21:24:14] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 8 (OVERLAPS) 236/530 variables, 294/356 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 2/358 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/358 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/359 constraints. Problems are: Problem set: 23 solved, 210 unsolved
[2024-05-21 21:24:20] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:24:20] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:24:21] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:24:21] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 4/363 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 0/363 constraints. Problems are: Problem set: 23 solved, 210 unsolved
[2024-05-21 21:24:26] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:24:27] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/531 variables, 2/365 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/365 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 16 (OVERLAPS) 0/531 variables, 0/365 constraints. Problems are: Problem set: 23 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 365 constraints, problems are : Problem set: 23 solved, 210 unsolved in 25056 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 295/295 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 23 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 6/58 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/58 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 1/59 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/60 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/60 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 24/294 variables, 8/68 constraints. Problems are: Problem set: 23 solved, 210 unsolved
[2024-05-21 21:24:37] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 1/69 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/69 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 236/530 variables, 294/363 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 2/365 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 210/575 constraints. Problems are: Problem set: 23 solved, 210 unsolved
[2024-05-21 21:24:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:24:47] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 4 ms to minimize.
[2024-05-21 21:24:47] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:24:47] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:24:47] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:24:50] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:24:50] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:54] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 8/583 constraints. Problems are: Problem set: 23 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/531 variables, and 583 constraints, problems are : Problem set: 23 solved, 210 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 294/295 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/233 constraints, Known Traps: 16/16 constraints]
After SMT, in 55196ms problems are : Problem set: 23 solved, 210 unsolved
Search for dead transitions found 23 dead transitions in 55200ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 295/295 places, 213/236 transitions.
Graph (complete) has 939 edges and 295 vertex of which 272 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 272 /295 variables (removed 23) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 272 cols
[2024-05-21 21:25:04] [INFO ] Computed 61 invariants in 7 ms
[2024-05-21 21:25:04] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 21:25:04] [INFO ] Invariant cache hit.
[2024-05-21 21:25:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:25:04] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 272/295 places, 213/236 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56201 ms. Remains : 272/295 places, 213/236 transitions.
[2024-05-21 21:25:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13622 resets) in 1823 ms. (548 steps per ms)
BEST_FIRST walk for 1000001 steps (2274 resets) in 835 ms. (1196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:25:07] [INFO ] Invariant cache hit.
[2024-05-21 21:25:07] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 21:25:07] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 21:25:07] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-21 21:25:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:25:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:25:07] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 21:25:07] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-21 21:25:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:25:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-21 21:25:07] [INFO ] Computed and/alt/rep : 204/338/204 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 21:25:08] [INFO ] Added : 168 causal constraints over 34 iterations in 553 ms. Result :sat
Minimization took 107 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 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 272/272 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-21 21:25:08] [INFO ] Invariant cache hit.
[2024-05-21 21:25:09] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 21:25:09] [INFO ] Invariant cache hit.
[2024-05-21 21:25:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:25:09] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-05-21 21:25:09] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-21 21:25:09] [INFO ] Invariant cache hit.
[2024-05-21 21:25:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 1/271 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 213/484 variables, 271/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:25:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:25:16] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:25:20] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:25:20] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:25:22] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-21 21:25:22] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2024-05-21 21:25:23] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 1/485 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:25:29] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 16 (OVERLAPS) 0/485 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 343 constraints, problems are : Problem set: 0 solved, 210 unsolved in 26691 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:25:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:25:38] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:25:39] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:25:39] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:25:39] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:25:39] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:25:40] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:25:41] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:25:41] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 213/484 variables, 271/349 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 210/561 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:25:55] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/485 variables, and 562 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints]
After SMT, in 56802ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 56805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57289 ms. Remains : 272/272 places, 213/213 transitions.
RANDOM walk for 40000 steps (558 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (86 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1165601 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :0 out of 2
Probabilistic random walk after 1165601 steps, saw 163412 distinct states, run finished after 3001 ms. (steps per millisecond=388 ) properties seen :0
[2024-05-21 21:26:09] [INFO ] Invariant cache hit.
[2024-05-21 21:26:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/168 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/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/202 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/211 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/371 variables, 211/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/383 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/384 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/436 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/485 variables, 49/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/168 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/202 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/211 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/371 variables, 211/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/383 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/384 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/436 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/485 variables, 49/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 337 constraints, problems are : Problem set: 0 solved, 2 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1234 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 272/272 places, 213/213 transitions.
RANDOM walk for 40000 steps (542 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (96 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1143578 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :0 out of 2
Probabilistic random walk after 1143578 steps, saw 160129 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
[2024-05-21 21:26:14] [INFO ] Invariant cache hit.
[2024-05-21 21:26:14] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/168 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/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/202 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/211 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/371 variables, 211/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/383 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/384 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/436 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/485 variables, 49/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/168 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/202 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/211 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/371 variables, 211/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/383 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/384 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/436 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/485 variables, 49/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 337 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 572ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1032 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 272/272 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-21 21:26:15] [INFO ] Invariant cache hit.
[2024-05-21 21:26:16] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 21:26:16] [INFO ] Invariant cache hit.
[2024-05-21 21:26:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:26:16] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-21 21:26:16] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-21 21:26:16] [INFO ] Invariant cache hit.
[2024-05-21 21:26:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 1/271 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 213/484 variables, 271/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 1/485 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 16 (OVERLAPS) 0/485 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 343 constraints, problems are : Problem set: 0 solved, 210 unsolved in 27117 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:26:45] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:26:45] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:26:46] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-21 21:26:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:26:46] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 213/484 variables, 271/349 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 210/561 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:27:02] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/485 variables, and 562 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints]
After SMT, in 57226ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 57229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57687 ms. Remains : 272/272 places, 213/213 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 272 transition count 213
Applied a total of 1 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 213 rows 272 cols
[2024-05-21 21:27:13] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 21:27:13] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:27:13] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-21 21:27:13] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:27:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 21:27:13] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 21:27:13] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:27:13] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:27:13] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 360 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50a-UpperBounds-14 in 191815 ms.
[2024-05-21 21:27:14] [INFO ] Flatten gal took : 60 ms
[2024-05-21 21:27:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 21:27:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 311 places, 253 transitions and 1219 arcs took 5 ms.
Total runtime 1133966 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-50a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 311
TRANSITIONS: 253
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2201
MODEL NAME: /home/mcc/execution/413/model
311 places, 253 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-50a-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716326877969
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-50a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188300733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;