About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d1m36
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 807.252 | 173297.00 | 239396.00 | 580.90 | 0 0 ? 1 0 0 0 ? 0 1 ? 0 0 ? 0 0 | 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.r532-smll-171683810700077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d1m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700077
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K 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.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 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 SieveSingleMsgMbox-PT-d1m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717244268072
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 12:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:17:50] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2024-06-01 12:17:50] [INFO ] Transformed 1295 places.
[2024-06-01 12:17:50] [INFO ] Transformed 749 transitions.
[2024-06-01 12:17:50] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 1036 places in 13 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 12:17:50] [INFO ] Computed 6 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 63, 1, 10, 1]
RANDOM walk for 10000 steps (2189 resets) in 194 ms. (51 steps per ms)
BEST_FIRST walk for 60005 steps (5942 resets) in 390 ms. (153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 63, 1, 10, 1]
[2024-06-01 12:17:51] [INFO ] Invariant cache hit.
[2024-06-01 12:17:51] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-06-01 12:17:51] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 9 ms returned sat
[2024-06-01 12:17:52] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2024-06-01 12:17:52] [INFO ] State equation strengthened by 587 read => feed constraints.
[2024-06-01 12:17:52] [INFO ] [Real]Added 587 Read/Feed constraints in 261 ms returned sat
[2024-06-01 12:17:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:17:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-06-01 12:17:53] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:17:53] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-06-01 12:17:53] [INFO ] [Nat]Added 587 Read/Feed constraints in 208 ms returned sat
[2024-06-01 12:17:54] [INFO ] Deduced a trap composed of 77 places in 347 ms of which 50 ms to minimize.
[2024-06-01 12:17:54] [INFO ] Deduced a trap composed of 95 places in 308 ms of which 5 ms to minimize.
[2024-06-01 12:17:54] [INFO ] Deduced a trap composed of 121 places in 291 ms of which 5 ms to minimize.
[2024-06-01 12:17:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1246 ms
[2024-06-01 12:17:55] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 262 ms.
[2024-06-01 12:17:56] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 4 ms to minimize.
[2024-06-01 12:17:56] [INFO ] Deduced a trap composed of 63 places in 227 ms of which 5 ms to minimize.
[2024-06-01 12:17:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 753 ms
[2024-06-01 12:17:56] [INFO ] Added : 24 causal constraints over 6 iterations in 1699 ms. Result :sat
Minimization took 581 ms.
[2024-06-01 12:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 12:17:57] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:17:57] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2024-06-01 12:17:57] [INFO ] [Real]Added 587 Read/Feed constraints in 170 ms returned sat
[2024-06-01 12:17:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:17:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-06-01 12:17:58] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:17:58] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2024-06-01 12:17:58] [INFO ] [Nat]Added 587 Read/Feed constraints in 166 ms returned sat
[2024-06-01 12:17:58] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 5 ms to minimize.
[2024-06-01 12:17:59] [INFO ] Deduced a trap composed of 68 places in 291 ms of which 5 ms to minimize.
[2024-06-01 12:17:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 790 ms
[2024-06-01 12:17:59] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 148 ms.
[2024-06-01 12:17:59] [INFO ] Added : 7 causal constraints over 2 iterations in 433 ms. Result :sat
Minimization took 672 ms.
[2024-06-01 12:18:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 12:18:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:00] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-06-01 12:18:00] [INFO ] [Real]Added 587 Read/Feed constraints in 123 ms returned sat
[2024-06-01 12:18:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:01] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:01] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-06-01 12:18:01] [INFO ] [Nat]Added 587 Read/Feed constraints in 255 ms returned sat
[2024-06-01 12:18:01] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 123 ms.
[2024-06-01 12:18:02] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 5 ms to minimize.
[2024-06-01 12:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2024-06-01 12:18:02] [INFO ] Added : 24 causal constraints over 6 iterations in 1049 ms. Result :sat
Minimization took 676 ms.
[2024-06-01 12:18:03] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 12:18:03] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:18:03] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2024-06-01 12:18:03] [INFO ] [Real]Added 587 Read/Feed constraints in 174 ms returned sat
[2024-06-01 12:18:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 12:18:03] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:18:04] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-06-01 12:18:04] [INFO ] [Nat]Added 587 Read/Feed constraints in 155 ms returned sat
[2024-06-01 12:18:04] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 4 ms to minimize.
[2024-06-01 12:18:05] [INFO ] Deduced a trap composed of 168 places in 312 ms of which 6 ms to minimize.
[2024-06-01 12:18:05] [INFO ] Deduced a trap composed of 168 places in 307 ms of which 5 ms to minimize.
[2024-06-01 12:18:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1294 ms
[2024-06-01 12:18:05] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 120 ms.
[2024-06-01 12:18:06] [INFO ] Added : 25 causal constraints over 5 iterations in 471 ms. Result :sat
Minimization took 639 ms.
[2024-06-01 12:18:06] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 12:18:06] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 12:18:07] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-06-01 12:18:07] [INFO ] [Real]Added 587 Read/Feed constraints in 181 ms returned sat
[2024-06-01 12:18:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 12:18:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:18:07] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2024-06-01 12:18:08] [INFO ] [Nat]Added 587 Read/Feed constraints in 253 ms returned sat
[2024-06-01 12:18:08] [INFO ] Deduced a trap composed of 29 places in 359 ms of which 5 ms to minimize.
[2024-06-01 12:18:08] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 4 ms to minimize.
[2024-06-01 12:18:09] [INFO ] Deduced a trap composed of 109 places in 255 ms of which 5 ms to minimize.
[2024-06-01 12:18:09] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 3 ms to minimize.
[2024-06-01 12:18:09] [INFO ] Deduced a trap composed of 116 places in 274 ms of which 4 ms to minimize.
[2024-06-01 12:18:09] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 3 ms to minimize.
[2024-06-01 12:18:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1929 ms
[2024-06-01 12:18:10] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 119 ms.
[2024-06-01 12:18:10] [INFO ] Added : 25 causal constraints over 5 iterations in 665 ms. Result :sat
Minimization took 692 ms.
[2024-06-01 12:18:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:11] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-06-01 12:18:11] [INFO ] [Real]Added 587 Read/Feed constraints in 119 ms returned sat
[2024-06-01 12:18:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-06-01 12:18:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:18:12] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2024-06-01 12:18:12] [INFO ] [Nat]Added 587 Read/Feed constraints in 214 ms returned sat
[2024-06-01 12:18:12] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:18:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-01 12:18:12] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 85 ms.
[2024-06-01 12:18:12] [INFO ] Added : 17 causal constraints over 4 iterations in 403 ms. Result :sat
Minimization took 580 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 63, 1, 10, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 63, 1, 10, 1]
Support contains 6 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 242 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.6 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 242 transition count 509
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 299 place count 184 transition count 250
Iterating global reduction 1 with 58 rules applied. Total rules applied 357 place count 184 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 363 place count 184 transition count 244
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 405 place count 142 transition count 202
Iterating global reduction 2 with 42 rules applied. Total rules applied 447 place count 142 transition count 202
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 463 place count 142 transition count 186
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 487 place count 118 transition count 160
Iterating global reduction 3 with 24 rules applied. Total rules applied 511 place count 118 transition count 160
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 528 place count 118 transition count 143
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 533 place count 113 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 538 place count 113 transition count 136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 543 place count 108 transition count 131
Iterating global reduction 4 with 5 rules applied. Total rules applied 548 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 550 place count 106 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 552 place count 106 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 554 place count 104 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 556 place count 104 transition count 126
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 558 place count 102 transition count 124
Iterating global reduction 4 with 2 rules applied. Total rules applied 560 place count 102 transition count 124
Applied a total of 560 rules in 204 ms. Remains 102 /259 variables (removed 157) and now considering 124/749 (removed 625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 102/259 places, 124/749 transitions.
// Phase 1: matrix 124 rows 102 cols
[2024-06-01 12:18:13] [INFO ] Computed 5 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 36, 1, 10, 1]
RANDOM walk for 1000000 steps (224438 resets) in 1547 ms. (645 steps per ms)
BEST_FIRST walk for 6000004 steps (620862 resets) in 3787 ms. (1583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 36, 1, 10, 1]
[2024-06-01 12:18:19] [INFO ] Invariant cache hit.
[2024-06-01 12:18:19] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 12:18:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 12:18:19] [INFO ] [Real]Added 57 Read/Feed constraints in 24 ms returned sat
[2024-06-01 12:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Nat]Added 57 Read/Feed constraints in 20 ms returned sat
[2024-06-01 12:18:19] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-01 12:18:19] [INFO ] Computed and/alt/rep : 30/70/30 causal constraints (skipped 93 transitions) in 17 ms.
[2024-06-01 12:18:19] [INFO ] Added : 11 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 103 ms.
[2024-06-01 12:18:19] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-06-01 12:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 12:18:19] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-06-01 12:18:20] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-01 12:18:20] [INFO ] Computed and/alt/rep : 30/70/30 causal constraints (skipped 93 transitions) in 8 ms.
[2024-06-01 12:18:20] [INFO ] Added : 7 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 57 ms.
[2024-06-01 12:18:20] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:18:20] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-01 12:18:20] [INFO ] [Real]Added 57 Read/Feed constraints in 14 ms returned sat
[2024-06-01 12:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:20] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-01 12:18:20] [INFO ] [Nat]Added 57 Read/Feed constraints in 27 ms returned sat
[2024-06-01 12:18:20] [INFO ] Computed and/alt/rep : 30/70/30 causal constraints (skipped 93 transitions) in 17 ms.
[2024-06-01 12:18:20] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 3 ms to minimize.
[2024-06-01 12:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-06-01 12:18:20] [INFO ] Added : 14 causal constraints over 4 iterations in 234 ms. Result :sat
Minimization took 140 ms.
[2024-06-01 12:18:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Real]Added 57 Read/Feed constraints in 20 ms returned sat
[2024-06-01 12:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Nat]Added 57 Read/Feed constraints in 15 ms returned sat
[2024-06-01 12:18:21] [INFO ] Computed and/alt/rep : 30/70/30 causal constraints (skipped 93 transitions) in 16 ms.
[2024-06-01 12:18:21] [INFO ] Added : 15 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 62 ms.
[2024-06-01 12:18:21] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Real]Added 57 Read/Feed constraints in 33 ms returned sat
[2024-06-01 12:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-01 12:18:21] [INFO ] [Nat]Added 57 Read/Feed constraints in 32 ms returned sat
[2024-06-01 12:18:21] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:18:21] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:18:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2024-06-01 12:18:21] [INFO ] Computed and/alt/rep : 30/70/30 causal constraints (skipped 93 transitions) in 16 ms.
[2024-06-01 12:18:21] [INFO ] Added : 19 causal constraints over 4 iterations in 115 ms. Result :sat
Minimization took 112 ms.
[2024-06-01 12:18:22] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:22] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 12:18:22] [INFO ] [Real]Added 57 Read/Feed constraints in 23 ms returned sat
[2024-06-01 12:18:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:22] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 12:18:22] [INFO ] [Nat]Added 57 Read/Feed constraints in 22 ms returned sat
[2024-06-01 12:18:22] [INFO ] Computed and/alt/rep : 30/70/30 causal constraints (skipped 93 transitions) in 15 ms.
[2024-06-01 12:18:22] [INFO ] Added : 18 causal constraints over 4 iterations in 107 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 36, 1, 10, 1]
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, 36, 1, 10, 1]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 124/124 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 100 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 100 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 99 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 99 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 99 transition count 119
Applied a total of 7 rules in 34 ms. Remains 99 /102 variables (removed 3) and now considering 119/124 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 99/102 places, 119/124 transitions.
// Phase 1: matrix 119 rows 99 cols
[2024-06-01 12:18:22] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, 36, 1, 10, 1]
RANDOM walk for 1000000 steps (224640 resets) in 1436 ms. (695 steps per ms)
BEST_FIRST walk for 5000002 steps (517797 resets) in 2982 ms. (1676 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, 36, 1, 10, 1]
[2024-06-01 12:18:27] [INFO ] Invariant cache hit.
[2024-06-01 12:18:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:27] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:18:27] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 12:18:27] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:18:27] [INFO ] [Real]Added 54 Read/Feed constraints in 20 ms returned sat
[2024-06-01 12:18:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 12:18:27] [INFO ] [Nat]Added 54 Read/Feed constraints in 13 ms returned sat
[2024-06-01 12:18:27] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:18:27] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:18:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2024-06-01 12:18:27] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 9 ms.
[2024-06-01 12:18:27] [INFO ] Added : 16 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 94 ms.
[2024-06-01 12:18:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:27] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Real]Added 54 Read/Feed constraints in 21 ms returned sat
[2024-06-01 12:18:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Nat]Added 54 Read/Feed constraints in 31 ms returned sat
[2024-06-01 12:18:28] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 16 ms.
[2024-06-01 12:18:28] [INFO ] Added : 14 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 155 ms.
[2024-06-01 12:18:28] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Real]Added 54 Read/Feed constraints in 20 ms returned sat
[2024-06-01 12:18:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-06-01 12:18:28] [INFO ] [Nat]Added 54 Read/Feed constraints in 17 ms returned sat
[2024-06-01 12:18:28] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:18:29] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-06-01 12:18:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2024-06-01 12:18:29] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 15 ms.
[2024-06-01 12:18:29] [INFO ] Added : 9 causal constraints over 2 iterations in 69 ms. Result :sat
Minimization took 85 ms.
[2024-06-01 12:18:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:29] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-01 12:18:29] [INFO ] [Real]Added 54 Read/Feed constraints in 27 ms returned sat
[2024-06-01 12:18:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:29] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-06-01 12:18:29] [INFO ] [Nat]Added 54 Read/Feed constraints in 27 ms returned sat
[2024-06-01 12:18:29] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:18:29] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:18:29] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:18:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2024-06-01 12:18:29] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 15 ms.
[2024-06-01 12:18:29] [INFO ] Added : 19 causal constraints over 4 iterations in 124 ms. Result :sat
Minimization took 105 ms.
[2024-06-01 12:18:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:18:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:18:30] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 12:18:30] [INFO ] [Real]Added 54 Read/Feed constraints in 22 ms returned sat
[2024-06-01 12:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:18:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 12:18:30] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-06-01 12:18:30] [INFO ] [Nat]Added 54 Read/Feed constraints in 25 ms returned sat
[2024-06-01 12:18:30] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 14 ms.
[2024-06-01 12:18:30] [INFO ] Added : 17 causal constraints over 4 iterations in 101 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, 36, 1, 10, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, 36, 1, 10, 1]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 119/119 transitions.
Applied a total of 0 rules in 15 ms. Remains 99 /99 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 99/99 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 119/119 transitions.
Applied a total of 0 rules in 14 ms. Remains 99 /99 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-06-01 12:18:30] [INFO ] Invariant cache hit.
[2024-06-01 12:18:30] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 12:18:30] [INFO ] Invariant cache hit.
[2024-06-01 12:18:31] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:18:31] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-06-01 12:18:31] [INFO ] Redundant transitions in 6 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 12:18:31] [INFO ] Invariant cache hit.
[2024-06-01 12:18:31] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:18:33] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:18:33] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 119/218 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 54/160 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/218 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 160 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7468 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 119/218 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 54/160 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 118/278 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:18:42] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 279 constraints, problems are : Problem set: 0 solved, 118 unsolved in 13689 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 3/3 constraints]
After SMT, in 21612ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 21635ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22188 ms. Remains : 99/99 places, 119/119 transitions.
RANDOM walk for 40000 steps (9017 resets) in 1476 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4124 resets) in 779 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (4138 resets) in 347 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4036 resets) in 317 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (4141 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4105 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4125 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4093 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4156 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4157 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4131 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 389688 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :5 out of 10
Probabilistic random walk after 389688 steps, saw 177244 distinct states, run finished after 3007 ms. (steps per millisecond=129 ) properties seen :5
[2024-06-01 12:18:57] [INFO ] Invariant cache hit.
[2024-06-01 12:18:57] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/81 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:18:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:18:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 7 ms to minimize.
[2024-06-01 12:18:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 105/186 variables, 81/89 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 40/129 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 11 (OVERLAPS) 32/218 variables, 18/147 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 14/161 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/218 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 161 constraints, problems are : Problem set: 3 solved, 2 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/63 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/79 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 95/174 variables, 79/87 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 30/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 2/119 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 44/218 variables, 20/139 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 24/163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/218 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 163 constraints, problems are : Problem set: 3 solved, 2 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 633ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 119/119 transitions.
Graph (complete) has 283 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 96 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 96 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 96 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 94 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 94 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 94 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 92 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 92 transition count 100
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 90 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 25 place count 88 transition count 95
Iterating global reduction 5 with 2 rules applied. Total rules applied 27 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 28 place count 87 transition count 94
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 87 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 30 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 31 place count 86 transition count 92
Iterating global reduction 6 with 1 rules applied. Total rules applied 32 place count 86 transition count 92
Applied a total of 32 rules in 46 ms. Remains 86 /99 variables (removed 13) and now considering 92/119 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 86/99 places, 92/119 transitions.
RANDOM walk for 40000 steps (8964 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4152 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4082 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 653274 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 2
Probabilistic random walk after 653274 steps, saw 307911 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
// Phase 1: matrix 92 rows 86 cols
[2024-06-01 12:19:01] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:19:01] [INFO ] State equation strengthened by 35 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) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:19:01] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:19:01] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/62 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 71/133 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/159 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 26/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/178 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/178 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/178 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:19:01] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/62 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 71/133 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 26/159 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/159 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/178 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 130 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 17 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 86/86 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 12:19:01] [INFO ] Invariant cache hit.
[2024-06-01 12:19:02] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 12:19:02] [INFO ] Invariant cache hit.
[2024-06-01 12:19:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 12:19:02] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-06-01 12:19:02] [INFO ] Redundant transitions in 3 ms returned []
Running 91 sub problems to find dead transitions.
[2024-06-01 12:19:02] [INFO ] Invariant cache hit.
[2024-06-01 12:19:02] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/178 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 91 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 125 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3743 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/178 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 91/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-01 12:19:09] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 217 constraints, problems are : Problem set: 0 solved, 91 unsolved in 9206 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 1/1 constraints]
After SMT, in 13139ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 13142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13675 ms. Remains : 86/86 places, 92/92 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 85
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 81 transition count 85
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 12 place count 81 transition count 69
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 44 place count 65 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 60 transition count 64
Applied a total of 54 rules in 16 ms. Remains 60 /86 variables (removed 26) and now considering 64/92 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 64 rows 60 cols
[2024-06-01 12:19:15] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 12:19:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 12:19:15] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:19:15] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:19:15] [INFO ] After 57ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-01 12:19:15] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 124 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 36, 10, 1]
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 119 rows 99 cols
[2024-06-01 12:19:15] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2242 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (1012 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-06-01 12:19:15] [INFO ] Invariant cache hit.
[2024-06-01 12:19:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:19:15] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:19:15] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 12:19:15] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:19:15] [INFO ] [Real]Added 54 Read/Feed constraints in 21 ms returned sat
[2024-06-01 12:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:19:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:19:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:19:16] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 12:19:16] [INFO ] [Nat]Added 54 Read/Feed constraints in 22 ms returned sat
[2024-06-01 12:19:16] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:19:16] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:19:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2024-06-01 12:19:16] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 15 ms.
[2024-06-01 12:19:16] [INFO ] Added : 16 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 119/119 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 96 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 96 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 93 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 93 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 93 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 90 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 90 transition count 97
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 87 transition count 94
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 87 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 87 transition count 93
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 32 place count 84 transition count 90
Iterating global reduction 4 with 3 rules applied. Total rules applied 35 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 37 place count 82 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 82 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 82 transition count 87
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 42 place count 80 transition count 85
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 45 place count 79 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 47 place count 78 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 49 place count 77 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 50 place count 77 transition count 81
Applied a total of 50 rules in 47 ms. Remains 77 /99 variables (removed 22) and now considering 81/119 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 77/99 places, 81/119 transitions.
// Phase 1: matrix 81 rows 77 cols
[2024-06-01 12:19:16] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (224329 resets) in 1138 ms. (877 steps per ms)
BEST_FIRST walk for 1000001 steps (103555 resets) in 426 ms. (2341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-06-01 12:19:18] [INFO ] Invariant cache hit.
[2024-06-01 12:19:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:19:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:19:18] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-01 12:19:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:19:18] [INFO ] [Real]Added 32 Read/Feed constraints in 9 ms returned sat
[2024-06-01 12:19:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:19:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:19:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:19:18] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 12:19:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-06-01 12:19:18] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:19:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-01 12:19:18] [INFO ] Computed and/alt/rep : 22/48/22 causal constraints (skipped 58 transitions) in 6 ms.
[2024-06-01 12:19:18] [INFO ] Added : 15 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 77/77 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-06-01 12:19:18] [INFO ] Invariant cache hit.
[2024-06-01 12:19:18] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 12:19:18] [INFO ] Invariant cache hit.
[2024-06-01 12:19:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:19:18] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-06-01 12:19:18] [INFO ] Redundant transitions in 3 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 12:19:18] [INFO ] Invariant cache hit.
[2024-06-01 12:19:18] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 12:19:20] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:19:20] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3326 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4414 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 7858ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 7861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8301 ms. Remains : 77/77 places, 81/81 transitions.
RANDOM walk for 40000 steps (8938 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3991 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4125 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2678304 steps, run timeout after 3001 ms. (steps per millisecond=892 ) properties seen :1 out of 2
Probabilistic random walk after 2678304 steps, saw 1239639 distinct states, run finished after 3001 ms. (steps per millisecond=892 ) properties seen :1
[2024-06-01 12:19:29] [INFO ] Invariant cache hit.
[2024-06-01 12:19:29] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/59 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/103 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/117 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 158/158 variables, and 86 constraints, problems are : Problem set: 1 solved, 0 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 4/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[10]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-02 in 14170 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[36]
// Phase 1: matrix 119 rows 99 cols
[2024-06-01 12:19:29] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 10000 steps (2205 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (998 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2024-06-01 12:19:29] [INFO ] Invariant cache hit.
[2024-06-01 12:19:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:19:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:19:30] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-01 12:19:30] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:19:30] [INFO ] [Real]Added 54 Read/Feed constraints in 16 ms returned sat
[2024-06-01 12:19:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:19:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:19:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 12:19:30] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 12:19:30] [INFO ] [Nat]Added 54 Read/Feed constraints in 17 ms returned sat
[2024-06-01 12:19:30] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 11 ms.
[2024-06-01 12:19:30] [INFO ] Added : 14 causal constraints over 3 iterations in 57 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 119/119 transitions.
Graph (complete) has 283 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output 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 3 place count 98 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 96 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 96 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 94 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 94 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 94 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 92 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 92 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 92 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 90 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 88 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 88 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 86 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 86 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 33 place count 84 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 83 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 82 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 81 transition count 86
Applied a total of 41 rules in 23 ms. Remains 81 /99 variables (removed 18) and now considering 86/119 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 81/99 places, 86/119 transitions.
// Phase 1: matrix 86 rows 81 cols
[2024-06-01 12:19:30] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 1000000 steps (224238 resets) in 856 ms. (1166 steps per ms)
BEST_FIRST walk for 1000001 steps (103567 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2024-06-01 12:19:31] [INFO ] Invariant cache hit.
[2024-06-01 12:19:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:19:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:19:31] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-01 12:19:31] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-01 12:19:31] [INFO ] [Real]Added 34 Read/Feed constraints in 14 ms returned sat
[2024-06-01 12:19:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:19:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 12:19:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:19:31] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 12:19:31] [INFO ] [Nat]Added 34 Read/Feed constraints in 17 ms returned sat
[2024-06-01 12:19:31] [INFO ] Computed and/alt/rep : 21/48/21 causal constraints (skipped 64 transitions) in 10 ms.
[2024-06-01 12:19:31] [INFO ] Added : 13 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-01 12:19:32] [INFO ] Invariant cache hit.
[2024-06-01 12:19:32] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 12:19:32] [INFO ] Invariant cache hit.
[2024-06-01 12:19:32] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-01 12:19:32] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-06-01 12:19:32] [INFO ] Redundant transitions in 3 ms returned []
Running 85 sub problems to find dead transitions.
[2024-06-01 12:19:32] [INFO ] Invariant cache hit.
[2024-06-01 12:19:32] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2729 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 8271ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 8274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8732 ms. Remains : 81/81 places, 86/86 transitions.
RANDOM walk for 40000 steps (8940 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4123 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4075 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2580776 steps, run timeout after 3001 ms. (steps per millisecond=859 ) properties seen :1 out of 2
Probabilistic random walk after 2580776 steps, saw 1126217 distinct states, run finished after 3001 ms. (steps per millisecond=859 ) properties seen :1
[2024-06-01 12:19:43] [INFO ] Invariant cache hit.
[2024-06-01 12:19:43] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 144/167 variables, and 99 constraints, problems are : Problem set: 1 solved, 0 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/81 constraints, ReadFeed: 23/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 393ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[36]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 in 14358 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 119 rows 99 cols
[2024-06-01 12:19:44] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2237 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10000 steps (1006 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-06-01 12:19:44] [INFO ] Invariant cache hit.
[2024-06-01 12:19:44] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:19:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:19:44] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-01 12:19:44] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:19:44] [INFO ] [Real]Added 54 Read/Feed constraints in 26 ms returned sat
[2024-06-01 12:19:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:19:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 12:19:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:19:44] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-01 12:19:44] [INFO ] [Nat]Added 54 Read/Feed constraints in 24 ms returned sat
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2024-06-01 12:19:44] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 16 ms.
[2024-06-01 12:19:45] [INFO ] Added : 19 causal constraints over 4 iterations in 116 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 119/119 transitions.
Graph (complete) has 283 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 96 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 96 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 96 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 94 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 94 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 94 transition count 111
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 92 transition count 108
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 90 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 90 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 90 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 25 place count 88 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 28 place count 87 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 85 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 84 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 83 transition count 96
Applied a total of 37 rules in 38 ms. Remains 83 /99 variables (removed 16) and now considering 96/119 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 83/99 places, 96/119 transitions.
// Phase 1: matrix 96 rows 83 cols
[2024-06-01 12:19:45] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (224207 resets) in 897 ms. (1113 steps per ms)
BEST_FIRST walk for 1000001 steps (103832 resets) in 474 ms. (2105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-06-01 12:19:46] [INFO ] Invariant cache hit.
[2024-06-01 12:19:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:19:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:19:46] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 12:19:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 12:19:46] [INFO ] [Real]Added 42 Read/Feed constraints in 13 ms returned sat
[2024-06-01 12:19:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:19:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:19:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:19:46] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 12:19:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 13 ms returned sat
[2024-06-01 12:19:46] [INFO ] Computed and/alt/rep : 22/51/22 causal constraints (skipped 73 transitions) in 7 ms.
[2024-06-01 12:19:46] [INFO ] Added : 14 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 12:19:46] [INFO ] Invariant cache hit.
[2024-06-01 12:19:47] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 12:19:47] [INFO ] Invariant cache hit.
[2024-06-01 12:19:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 12:19:47] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-01 12:19:47] [INFO ] Redundant transitions in 4 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 12:19:47] [INFO ] Invariant cache hit.
[2024-06-01 12:19:47] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/179 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 42/129 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 129 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/179 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 42/129 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 224 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 10508ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 10511ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11013 ms. Remains : 83/83 places, 96/96 transitions.
RANDOM walk for 40000 steps (8972 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4083 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4154 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2614727 steps, run timeout after 3001 ms. (steps per millisecond=871 ) properties seen :1 out of 2
Probabilistic random walk after 2614727 steps, saw 1212420 distinct states, run finished after 3001 ms. (steps per millisecond=871 ) properties seen :1
[2024-06-01 12:20:01] [INFO ] Invariant cache hit.
[2024-06-01 12:20:01] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/83 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 91/174 variables, 67/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 24/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/179 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 179/179 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/83 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[10]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-10 in 16887 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
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 119 rows 99 cols
[2024-06-01 12:20:01] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2238 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (1024 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 12:20:01] [INFO ] Invariant cache hit.
[2024-06-01 12:20:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:20:01] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:20:01] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-01 12:20:01] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:20:01] [INFO ] [Real]Added 54 Read/Feed constraints in 14 ms returned sat
[2024-06-01 12:20:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:20:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:20:01] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:20:01] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 12:20:01] [INFO ] [Nat]Added 54 Read/Feed constraints in 15 ms returned sat
[2024-06-01 12:20:01] [INFO ] Computed and/alt/rep : 29/68/29 causal constraints (skipped 89 transitions) in 13 ms.
[2024-06-01 12:20:01] [INFO ] Added : 17 causal constraints over 4 iterations in 76 ms. Result :sat
Minimization took 60 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 99 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p23) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 118/118 transitions.
Graph (complete) has 281 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 96 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 96 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 94 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 92 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 92 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 92 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 90 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 90 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 90 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 25 place count 88 transition count 94
Iterating global reduction 5 with 2 rules applied. Total rules applied 27 place count 88 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 28 place count 87 transition count 93
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 87 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 30 place count 87 transition count 92
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 31 place count 86 transition count 91
Iterating global reduction 6 with 1 rules applied. Total rules applied 32 place count 86 transition count 91
Applied a total of 32 rules in 19 ms. Remains 86 /99 variables (removed 13) and now considering 91/118 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 86/99 places, 91/118 transitions.
// Phase 1: matrix 91 rows 86 cols
[2024-06-01 12:20:01] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (224171 resets) in 1012 ms. (987 steps per ms)
BEST_FIRST walk for 1000001 steps (103609 resets) in 444 ms. (2247 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 12:20:03] [INFO ] Invariant cache hit.
[2024-06-01 12:20:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:20:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 12:20:03] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-01 12:20:03] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 12:20:03] [INFO ] [Real]Added 35 Read/Feed constraints in 10 ms returned sat
[2024-06-01 12:20:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:20:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:20:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:20:03] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-01 12:20:03] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2024-06-01 12:20:03] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 67 transitions) in 6 ms.
[2024-06-01 12:20:03] [INFO ] Added : 19 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/86 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 12:20:03] [INFO ] Invariant cache hit.
[2024-06-01 12:20:03] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 12:20:03] [INFO ] Invariant cache hit.
[2024-06-01 12:20:03] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 12:20:03] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-06-01 12:20:03] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 12:20:03] [INFO ] Invariant cache hit.
[2024-06-01 12:20:03] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/177 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 125 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5371 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/177 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 90/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:20:12] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 216 constraints, problems are : Problem set: 0 solved, 90 unsolved in 9076 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 1/1 constraints]
After SMT, in 14573ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 14575ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15057 ms. Remains : 86/86 places, 91/91 transitions.
RANDOM walk for 40000 steps (9026 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4198 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4187 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 834984 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 2
Probabilistic random walk after 834984 steps, saw 393917 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2024-06-01 12:20:21] [INFO ] Invariant cache hit.
[2024-06-01 12:20:21] [INFO ] State equation strengthened by 35 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) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:20:21] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:20:21] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/62 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 70/132 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/158 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 26/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/177 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:20:21] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/62 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 70/132 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 26/158 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 26/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/177 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 130 constraints, problems are : Problem set: 0 solved, 2 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 492ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/86 places, 91/91 transitions.
RANDOM walk for 40000 steps (8882 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4136 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4158 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 793765 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 2
Probabilistic random walk after 793765 steps, saw 372818 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2024-06-01 12:20:25] [INFO ] Invariant cache hit.
[2024-06-01 12:20:25] [INFO ] State equation strengthened by 35 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) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/62 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 70/132 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/158 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 26/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/177 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/62 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 70/132 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 26/158 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 26/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/177 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 130 constraints, problems are : Problem set: 0 solved, 2 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 12:20:25] [INFO ] Invariant cache hit.
[2024-06-01 12:20:26] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 12:20:26] [INFO ] Invariant cache hit.
[2024-06-01 12:20:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 12:20:26] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-06-01 12:20:26] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 12:20:26] [INFO ] Invariant cache hit.
[2024-06-01 12:20:26] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/177 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 125 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5365 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/177 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 90/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:20:34] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 216 constraints, problems are : Problem set: 0 solved, 90 unsolved in 8472 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 1/1 constraints]
After SMT, in 13993ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 13995ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14478 ms. Remains : 86/86 places, 91/91 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 84
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 81 transition count 84
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 12 place count 81 transition count 68
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 44 place count 65 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 60 transition count 63
Applied a total of 54 rules in 13 ms. Remains 60 /86 variables (removed 26) and now considering 63/91 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 63 rows 60 cols
[2024-06-01 12:20:40] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 12:20:40] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 12:20:40] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:20:40] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:20:40] [INFO ] After 76ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-01 12:20:40] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 167 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-13 in 39317 ms.
[2024-06-01 12:20:40] [INFO ] Flatten gal took : 81 ms
[2024-06-01 12:20:40] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-06-01 12:20:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 119 transitions and 472 arcs took 9 ms.
Total runtime 170600 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-UpperBounds-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-UpperBounds-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
BK_STOP 1717244441369
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name SieveSingleMsgMbox-PT-d1m36-UpperBounds-02
ub formula formula --maxsum=/tmp/1035/ub_0_
ub formula name SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
ub formula formula --maxsum=/tmp/1035/ub_1_
ub formula name SieveSingleMsgMbox-PT-d1m36-UpperBounds-10
ub formula formula --maxsum=/tmp/1035/ub_2_
ub formula name SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
ub formula formula --maxsum=/tmp/1035/ub_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m36"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m36, 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 r532-smll-171683810700077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m36.tgz
mv SieveSingleMsgMbox-PT-d1m36 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 ;