fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r223-tall-171649610600053
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for JoinFreeModules-PT-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2168.256 323403.00 398691.00 890.00 100 100 101 103 100 102 102 102 102 103 102 102 101 103 102 101 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.r223-tall-171649610600053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is JoinFreeModules-PT-0100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 11 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 304K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716499194099

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 21:19:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 21:19:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:19:55] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-23 21:19:55] [INFO ] Transformed 501 places.
[2024-05-23 21:19:55] [INFO ] Transformed 801 transitions.
[2024-05-23 21:19:55] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[100, 100, 1, 0, 100, 2, 2, 0, 0, 0, 0, 2, 1, 0, 2, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[100, 100, 1, 0, 100, 2, 2, 0, 0, 0, 0, 2, 1, 0, 2, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 801 rows 500 cols
[2024-05-23 21:19:55] [INFO ] Computed 100 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100, 100, 1, 0, 100, 2, 2, 0, 0, 0, 0, 2, 1, 0, 2, 1] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 10051 steps (2 resets) in 96 ms. (103 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 946 ms. (168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100, 100, 18, 50, 100, 2, 3, 50, 50, 26, 17, 2, 18, 50, 2, 18] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
[2024-05-23 21:19:56] [INFO ] Invariant cache hit.
[2024-05-23 21:19:56] [INFO ] [Real]Absence check using 100 positive place invariants in 45 ms returned sat
[2024-05-23 21:19:57] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2024-05-23 21:19:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:19:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 19 ms returned sat
[2024-05-23 21:19:57] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2024-05-23 21:19:57] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-23 21:19:58] [INFO ] [Nat]Added 100 Read/Feed constraints in 168 ms returned sat
[2024-05-23 21:19:58] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 55 ms.
[2024-05-23 21:19:59] [INFO ] Added : 118 causal constraints over 26 iterations in 1313 ms. Result :sat
Minimization took 140 ms.
[2024-05-23 21:19:59] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2024-05-23 21:19:59] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-23 21:19:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2024-05-23 21:20:00] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-05-23 21:20:00] [INFO ] [Nat]Added 100 Read/Feed constraints in 157 ms returned sat
[2024-05-23 21:20:00] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 51 ms.
[2024-05-23 21:20:02] [INFO ] Added : 272 causal constraints over 55 iterations in 2482 ms. Result :sat
Minimization took 178 ms.
[2024-05-23 21:20:03] [INFO ] [Real]Absence check using 100 positive place invariants in 20 ms returned sat
[2024-05-23 21:20:03] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 21:20:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:03] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:03] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2024-05-23 21:20:03] [INFO ] [Nat]Added 100 Read/Feed constraints in 96 ms returned sat
[2024-05-23 21:20:03] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 50 ms.
[2024-05-23 21:20:05] [INFO ] Added : 148 causal constraints over 31 iterations in 1365 ms. Result :sat
Minimization took 174 ms.
[2024-05-23 21:20:05] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2024-05-23 21:20:05] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-05-23 21:20:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:05] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2024-05-23 21:20:06] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-23 21:20:06] [INFO ] [Nat]Added 100 Read/Feed constraints in 159 ms returned sat
[2024-05-23 21:20:06] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 43 ms.
[2024-05-23 21:20:09] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 12 ms to minimize.
[2024-05-23 21:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-05-23 21:20:09] [INFO ] Added : 306 causal constraints over 63 iterations in 3007 ms. Result :sat
Minimization took 501 ms.
[2024-05-23 21:20:09] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:10] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-23 21:20:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:10] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2024-05-23 21:20:10] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-23 21:20:10] [INFO ] [Nat]Added 100 Read/Feed constraints in 171 ms returned sat
[2024-05-23 21:20:10] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 46 ms.
[2024-05-23 21:20:12] [INFO ] Added : 163 causal constraints over 34 iterations in 1530 ms. Result :sat
Minimization took 145 ms.
[2024-05-23 21:20:12] [INFO ] [Real]Absence check using 100 positive place invariants in 18 ms returned sat
[2024-05-23 21:20:12] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-23 21:20:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:12] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:12] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-05-23 21:20:13] [INFO ] [Nat]Added 100 Read/Feed constraints in 158 ms returned sat
[2024-05-23 21:20:13] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 45 ms.
[2024-05-23 21:20:15] [INFO ] Added : 290 causal constraints over 61 iterations in 2891 ms. Result :sat
Minimization took 510 ms.
[2024-05-23 21:20:16] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:16] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-23 21:20:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:16] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2024-05-23 21:20:17] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-05-23 21:20:17] [INFO ] [Nat]Added 100 Read/Feed constraints in 150 ms returned sat
[2024-05-23 21:20:17] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-23 21:20:20] [INFO ] Added : 319 causal constraints over 66 iterations in 2996 ms. Result :sat
Minimization took 505 ms.
[2024-05-23 21:20:20] [INFO ] [Real]Absence check using 100 positive place invariants in 18 ms returned sat
[2024-05-23 21:20:21] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-23 21:20:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:21] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2024-05-23 21:20:21] [INFO ] [Nat]Added 100 Read/Feed constraints in 156 ms returned sat
[2024-05-23 21:20:21] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-23 21:20:22] [INFO ] Added : 134 causal constraints over 28 iterations in 1324 ms. Result :sat
Minimization took 355 ms.
[2024-05-23 21:20:23] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:23] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-05-23 21:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2024-05-23 21:20:23] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-23 21:20:24] [INFO ] [Nat]Added 100 Read/Feed constraints in 159 ms returned sat
[2024-05-23 21:20:24] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-23 21:20:26] [INFO ] Added : 304 causal constraints over 63 iterations in 2861 ms. Result :sat
Minimization took 466 ms.
[2024-05-23 21:20:27] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:27] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-23 21:20:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:27] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2024-05-23 21:20:28] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2024-05-23 21:20:28] [INFO ] [Nat]Added 100 Read/Feed constraints in 151 ms returned sat
[2024-05-23 21:20:28] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 43 ms.
[2024-05-23 21:20:31] [INFO ] Added : 304 causal constraints over 63 iterations in 2838 ms. Result :sat
Minimization took 503 ms.
[2024-05-23 21:20:31] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2024-05-23 21:20:31] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 21:20:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:31] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2024-05-23 21:20:32] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-23 21:20:32] [INFO ] [Nat]Added 100 Read/Feed constraints in 169 ms returned sat
[2024-05-23 21:20:32] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-23 21:20:34] [INFO ] Added : 283 causal constraints over 58 iterations in 2657 ms. Result :sat
Minimization took 502 ms.
[2024-05-23 21:20:35] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2024-05-23 21:20:35] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-23 21:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:35] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:35] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-23 21:20:36] [INFO ] [Nat]Added 100 Read/Feed constraints in 192 ms returned sat
[2024-05-23 21:20:36] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 48 ms.
[2024-05-23 21:20:38] [INFO ] Added : 259 causal constraints over 53 iterations in 2475 ms. Result :sat
Minimization took 501 ms.
[2024-05-23 21:20:39] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:39] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 21:20:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:39] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:39] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-05-23 21:20:39] [INFO ] [Nat]Added 100 Read/Feed constraints in 144 ms returned sat
[2024-05-23 21:20:39] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 43 ms.
[2024-05-23 21:20:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
[2024-05-23 21:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-23 21:20:42] [INFO ] Added : 315 causal constraints over 64 iterations in 3072 ms. Result :sat
Minimization took 215 ms.
[2024-05-23 21:20:43] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2024-05-23 21:20:43] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-23 21:20:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:43] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2024-05-23 21:20:43] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2024-05-23 21:20:43] [INFO ] [Nat]Added 100 Read/Feed constraints in 144 ms returned sat
[2024-05-23 21:20:44] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 48 ms.
[2024-05-23 21:20:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 21:20:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 6 ms to minimize.
[2024-05-23 21:20:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-05-23 21:20:45] [INFO ] Added : 169 causal constraints over 36 iterations in 1797 ms. Result :sat
Minimization took 352 ms.
[2024-05-23 21:20:46] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:46] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-23 21:20:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:46] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-05-23 21:20:46] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-23 21:20:46] [INFO ] [Nat]Added 100 Read/Feed constraints in 166 ms returned sat
[2024-05-23 21:20:46] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-23 21:20:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 21:20:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 21:20:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:20:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 21:20:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 341 ms
[2024-05-23 21:20:50] [INFO ] Added : 317 causal constraints over 66 iterations in 3252 ms. Result :sat
Minimization took 504 ms.
[2024-05-23 21:20:50] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2024-05-23 21:20:50] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 21:20:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:20:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2024-05-23 21:20:51] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-23 21:20:51] [INFO ] [Nat]Added 100 Read/Feed constraints in 198 ms returned sat
[2024-05-23 21:20:51] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-23 21:20:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:20:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 21:20:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2024-05-23 21:20:54] [INFO ] Added : 273 causal constraints over 56 iterations in 2767 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100, 100, 18, 50, 100, 2, 3, 50, 50, 26, 17, 2, 18, 50, 2, 18] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100, 100, 101, 50, 100, 16, 20, 101, 101, 26, 22, 16, 101, 100, 17, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Support contains 16 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 801/801 transitions.
Graph (complete) has 1200 edges and 500 vertex of which 75 are kept as prefixes of interest. Removing 425 places using SCC suffix rule.3 ms
Discarding 425 places :
Also discarding 680 output transitions
Drop transitions (Output transitions of discarded places.) removed 680 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 120
Applied a total of 2 rules in 26 ms. Remains 75 /500 variables (removed 425) and now considering 120/801 (removed 681) transitions.
Running 90 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 75 cols
[2024-05-23 21:22:39] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 21:22:39] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 15/75 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 120/195 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 105 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 15/75 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 120/195 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 90/195 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 195 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2320 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 3984ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 3993ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4031 ms. Remains : 75/500 places, 120/801 transitions.
[2024-05-23 21:22:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100, 100, 101, 50, 100, 16, 20, 101, 101, 26, 22, 16, 101, 100, 17, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 1000029 steps (2 resets) in 1303 ms. (766 steps per ms)
FORMULA JoinFreeModules-PT-0100-UpperBounds-13 103 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0100-UpperBounds-09 103 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 14000013 steps (28 resets) in 17877 ms. (783 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100, 100, 101, 102, 100, 100, 100, 101, 101, 100, 100, 101, 100, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
[2024-05-23 21:23:03] [INFO ] Invariant cache hit.
[2024-05-23 21:23:03] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:23:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:03] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 21:23:03] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 21:23:03] [INFO ] [Nat]Added 15 Read/Feed constraints in 66 ms returned sat
[2024-05-23 21:23:03] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:23:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-23 21:23:03] [INFO ] Added : 50 causal constraints over 10 iterations in 128 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 21:23:03] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:03] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-23 21:23:03] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2024-05-23 21:23:03] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:23:03] [INFO ] Added : 31 causal constraints over 7 iterations in 80 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 21:23:03] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 21:23:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:03] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-23 21:23:03] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2024-05-23 21:23:03] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:23:04] [INFO ] Added : 30 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 21:23:04] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 21:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Nat]Added 15 Read/Feed constraints in 42 ms returned sat
[2024-05-23 21:23:04] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:23:04] [INFO ] Added : 44 causal constraints over 12 iterations in 146 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:23:04] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 21:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Nat]Added 15 Read/Feed constraints in 64 ms returned sat
[2024-05-23 21:23:04] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-23 21:23:04] [INFO ] Added : 58 causal constraints over 12 iterations in 139 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 21:23:04] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 21:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 21:23:04] [INFO ] [Nat]Added 15 Read/Feed constraints in 66 ms returned sat
[2024-05-23 21:23:04] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-23 21:23:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:23:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 21:23:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 21:23:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 92 ms
[2024-05-23 21:23:05] [INFO ] Added : 50 causal constraints over 12 iterations in 226 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 21:23:05] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 21:23:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:05] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-23 21:23:05] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-23 21:23:05] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:05] [INFO ] Added : 35 causal constraints over 10 iterations in 99 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:23:05] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:05] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-23 21:23:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 21:23:05] [INFO ] [Nat]Added 15 Read/Feed constraints in 88 ms returned sat
[2024-05-23 21:23:05] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:05] [INFO ] Added : 45 causal constraints over 10 iterations in 86 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 21:23:05] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 21:23:06] [INFO ] [Nat]Added 15 Read/Feed constraints in 22 ms returned sat
[2024-05-23 21:23:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-23 21:23:06] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-23 21:23:06] [INFO ] Added : 56 causal constraints over 12 iterations in 99 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:23:06] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 21:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:06] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-23 21:23:06] [INFO ] [Nat]Added 15 Read/Feed constraints in 8 ms returned sat
[2024-05-23 21:23:06] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-23 21:23:06] [INFO ] Added : 38 causal constraints over 9 iterations in 86 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 21:23:06] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:06] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 21:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:06] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 21:23:06] [INFO ] [Nat]Added 15 Read/Feed constraints in 30 ms returned sat
[2024-05-23 21:23:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-23 21:23:06] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:06] [INFO ] Added : 52 causal constraints over 13 iterations in 148 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 21:23:06] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:07] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:23:07] [INFO ] [Nat]Added 15 Read/Feed constraints in 52 ms returned sat
[2024-05-23 21:23:07] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:07] [INFO ] Added : 51 causal constraints over 11 iterations in 87 ms. Result :sat
Minimization took 42 ms.
[2024-05-23 21:23:07] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:07] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:23:07] [INFO ] [Nat]Added 15 Read/Feed constraints in 44 ms returned sat
[2024-05-23 21:23:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-23 21:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-23 21:23:07] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:23:07] [INFO ] Added : 51 causal constraints over 11 iterations in 88 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 21:23:07] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:07] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-23 21:23:07] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 21:23:07] [INFO ] [Nat]Added 15 Read/Feed constraints in 45 ms returned sat
[2024-05-23 21:23:07] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:23:07] [INFO ] Added : 55 causal constraints over 12 iterations in 100 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100, 100, 101, 102, 100, 100, 100, 101, 101, 100, 100, 101, 100, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 102, 101, 102, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Support contains 14 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 65 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 4 ms. Remains 65 /75 variables (removed 10) and now considering 104/120 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/75 places, 104/120 transitions.
// Phase 1: matrix 104 rows 65 cols
[2024-05-23 21:23:12] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 102, 101, 102, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 1000000 steps (2 resets) in 1176 ms. (849 steps per ms)
BEST_FIRST walk for 14000014 steps (28 resets) in 16291 ms. (859 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 102, 101, 102, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
[2024-05-23 21:23:29] [INFO ] Invariant cache hit.
[2024-05-23 21:23:29] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:30] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2024-05-23 21:23:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 21:23:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 26 ms returned sat
[2024-05-23 21:23:30] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-23 21:23:30] [INFO ] Added : 49 causal constraints over 12 iterations in 90 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 21:23:30] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:23:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:30] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 21:23:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 69 ms returned sat
[2024-05-23 21:23:30] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:23:30] [INFO ] Added : 64 causal constraints over 16 iterations in 113 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 21:23:30] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:30] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:23:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:23:30] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:23:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 21:23:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-23 21:23:30] [INFO ] Added : 74 causal constraints over 15 iterations in 163 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 21:23:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 46 ms returned sat
[2024-05-23 21:23:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:23:31] [INFO ] Added : 64 causal constraints over 14 iterations in 97 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:23:31] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2024-05-23 21:23:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:31] [INFO ] Added : 59 causal constraints over 14 iterations in 96 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 21:23:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:23:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:23:31] [INFO ] Added : 58 causal constraints over 12 iterations in 82 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:23:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:31] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:23:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:23:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:23:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-23 21:23:32] [INFO ] Added : 53 causal constraints over 13 iterations in 135 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:23:32] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:23:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:23:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 21:23:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:23:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2024-05-23 21:23:32] [INFO ] Added : 66 causal constraints over 14 iterations in 178 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 21:23:32] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:23:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:23:32] [INFO ] Added : 70 causal constraints over 16 iterations in 111 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 21:23:32] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:23:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 46 ms returned sat
[2024-05-23 21:23:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:23:33] [INFO ] Added : 58 causal constraints over 12 iterations in 87 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 21:23:33] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:23:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:23:33] [INFO ] Added : 48 causal constraints over 11 iterations in 80 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:23:33] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:23:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:23:33] [INFO ] Added : 61 causal constraints over 13 iterations in 96 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 21:23:33] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-23 21:23:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:23:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 21:23:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2024-05-23 21:23:33] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:34] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:34] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-23 21:23:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 27 ms returned sat
[2024-05-23 21:23:34] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-23 21:23:34] [INFO ] Added : 55 causal constraints over 14 iterations in 177 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 102, 101, 102, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 102, 103]
FORMULA JoinFreeModules-PT-0100-UpperBounds-14 102 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 60 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 60 /65 variables (removed 5) and now considering 96/104 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/65 places, 96/104 transitions.
// Phase 1: matrix 96 rows 60 cols
[2024-05-23 21:23:37] [INFO ] Computed 12 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 1000047 steps (2 resets) in 1014 ms. (985 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 13215 ms. (983 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
[2024-05-23 21:23:52] [INFO ] Invariant cache hit.
[2024-05-23 21:23:52] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:23:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 21:23:52] [INFO ] [Nat]Added 12 Read/Feed constraints in 77 ms returned sat
[2024-05-23 21:23:52] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:23:52] [INFO ] Added : 37 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 21:23:52] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2024-05-23 21:23:52] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:23:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:23:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-23 21:23:52] [INFO ] Added : 26 causal constraints over 7 iterations in 79 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:23:52] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:23:52] [INFO ] Added : 45 causal constraints over 11 iterations in 71 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 21:23:52] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 52 ms returned sat
[2024-05-23 21:23:53] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:23:53] [INFO ] Added : 42 causal constraints over 11 iterations in 89 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 21:23:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 83 ms returned sat
[2024-05-23 21:23:53] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:53] [INFO ] Added : 55 causal constraints over 12 iterations in 83 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 21:23:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 26 ms returned sat
[2024-05-23 21:23:53] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:23:53] [INFO ] Added : 48 causal constraints over 12 iterations in 80 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:23:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 26 ms returned sat
[2024-05-23 21:23:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 21:23:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2024-05-23 21:23:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:23:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:23:53] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:23:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:23:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
Minimization took 19 ms.
[2024-05-23 21:23:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 27 ms returned sat
[2024-05-23 21:23:54] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:23:54] [INFO ] Added : 53 causal constraints over 13 iterations in 85 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 21:23:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 27 ms returned sat
[2024-05-23 21:23:54] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:23:54] [INFO ] Added : 44 causal constraints over 9 iterations in 66 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 21:23:54] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2024-05-23 21:23:54] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:23:54] [INFO ] Added : 56 causal constraints over 12 iterations in 183 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:23:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:54] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:23:55] [INFO ] [Nat]Added 12 Read/Feed constraints in 74 ms returned sat
[2024-05-23 21:23:55] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:23:55] [INFO ] Added : 52 causal constraints over 11 iterations in 78 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 21:23:55] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:23:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 21:23:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:23:55] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:23:55] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:23:55] [INFO ] Added : 54 causal constraints over 12 iterations in 76 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 102, 102, 103, 103, 103, 103, 103]
FORMULA JoinFreeModules-PT-0100-UpperBounds-07 102 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0100-UpperBounds-06 102 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 50 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 3 ms. Remains 50 /60 variables (removed 10) and now considering 80/96 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/60 places, 80/96 transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-05-23 21:23:57] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100, 100, 101, 102, 100, 102, 102, 102, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 1000003 steps (2 resets) in 849 ms. (1176 steps per ms)
FORMULA JoinFreeModules-PT-0100-UpperBounds-03 103 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000010 steps (20 resets) in 8533 ms. (1171 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100, 100, 101, 100, 102, 102, 102, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
[2024-05-23 21:24:07] [INFO ] Invariant cache hit.
[2024-05-23 21:24:07] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:24:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 21:24:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 145 ms returned sat
[2024-05-23 21:24:07] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:24:07] [INFO ] Added : 35 causal constraints over 7 iterations in 45 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 21:24:07] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2024-05-23 21:24:07] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:24:07] [INFO ] Added : 28 causal constraints over 7 iterations in 75 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 21:24:07] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2024-05-23 21:24:07] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:24:07] [INFO ] Added : 22 causal constraints over 7 iterations in 73 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 21:24:07] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:07] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 80 ms returned sat
[2024-05-23 21:24:08] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:24:08] [INFO ] Added : 29 causal constraints over 7 iterations in 44 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:24:08] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:24:08] [INFO ] Added : 23 causal constraints over 7 iterations in 39 ms. Result :sat
Minimization took 15 ms.
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:24:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:24:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 21:24:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:24:08] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:24:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:24:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
Minimization took 14 ms.
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:24:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:08] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:24:09] [INFO ] Added : 39 causal constraints over 8 iterations in 205 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:24:09] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:24:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:24:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:09] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:24:09] [INFO ] Added : 35 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100, 100, 101, 100, 102, 102, 102, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 102, 102, 102, 103, 103]
FORMULA JoinFreeModules-PT-0100-UpperBounds-11 102 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0100-UpperBounds-10 102 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0100-UpperBounds-08 102 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100, 100, 101, 100, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103]
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 35 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 35 /50 variables (removed 15) and now considering 56/80 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/50 places, 56/80 transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:24:10] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100, 100, 101, 100, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 1000003 steps (2 resets) in 612 ms. (1631 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 4147 ms. (1687 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100, 100, 101, 100, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103]
[2024-05-23 21:24:14] [INFO ] Invariant cache hit.
[2024-05-23 21:24:14] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:24:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:24:15] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 21:24:15] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:24:15] [INFO ] Added : 23 causal constraints over 5 iterations in 39 ms. Result :sat
Minimization took 14 ms.
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Added 7 Read/Feed constraints in 14 ms returned sat
[2024-05-23 21:24:15] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:24:15] [INFO ] Added : 23 causal constraints over 5 iterations in 69 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:24:15] [INFO ] Added : 29 causal constraints over 7 iterations in 31 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 21:24:15] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:24:15] [INFO ] Added : 23 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 14 ms.
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:24:15] [INFO ] Added : 34 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 21:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:24:15] [INFO ] Added : 30 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 17 ms.
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:24:15] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 21:24:15] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:24:15] [INFO ] Added : 28 causal constraints over 6 iterations in 30 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100, 100, 101, 100, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100, 100, 101, 100, 102, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103, 103]
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-23 21:24:16] [INFO ] Invariant cache hit.
[2024-05-23 21:24:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-23 21:24:16] [INFO ] Invariant cache hit.
[2024-05-23 21:24:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:24:16] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-23 21:24:16] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-23 21:24:16] [INFO ] Invariant cache hit.
[2024-05-23 21:24:16] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1082ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1083ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1171 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 40047 steps (8 resets) in 389 ms. (102 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 177866 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 14
Probabilistic random walk after 177866 steps, saw 152736 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-23 21:24:21] [INFO ] Invariant cache hit.
[2024-05-23 21:24:21] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 21:24:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-23 21:24:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-23 21:24:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-23 21:24:21] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 21:24:21] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:24:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 21:24:21] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MIN4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 7/14 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/49 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 8 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/56 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/56 constraints. Problems are: Problem set: 8 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 56 constraints, problems are : Problem set: 8 solved, 6 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 8 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 6/12 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/42 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/48 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/54 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/91 variables, and 54 constraints, problems are : Problem set: 8 solved, 6 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 30/35 constraints, ReadFeed: 6/7 constraints, PredecessorRefiner: 6/14 constraints, Known Traps: 6/7 constraints]
After SMT, in 547ms problems are : Problem set: 8 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2027 ms.
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 30 /35 variables (removed 5) and now considering 48/56 (removed 8) transitions.
Running 36 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 30 cols
[2024-05-23 21:24:24] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 21:24:24] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 879ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 880ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 884 ms. Remains : 30/35 places, 48/56 transitions.
RANDOM walk for 40084 steps (8 resets) in 29 ms. (1336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 570224 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 6
Probabilistic random walk after 570224 steps, saw 483934 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2024-05-23 21:24:28] [INFO ] Invariant cache hit.
[2024-05-23 21:24:28] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 6 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 21:24:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:24:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 21:24:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 51 constraints, problems are : Problem set: 0 solved, 6 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 424ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 353 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-23 21:24:28] [INFO ] Invariant cache hit.
[2024-05-23 21:24:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 21:24:28] [INFO ] Invariant cache hit.
[2024-05-23 21:24:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 21:24:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-23 21:24:28] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-23 21:24:28] [INFO ] Invariant cache hit.
[2024-05-23 21:24:28] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 953ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1013 ms. Remains : 30/30 places, 48/48 transitions.
FORMULA JoinFreeModules-PT-0100-UpperBounds-05 102 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[100, 100, 101, 100, 101, 101] Max Struct:[103, 103, 103, 103, 103, 103]
Starting property specific reduction for JoinFreeModules-PT-0100-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[103]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:24:29] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[103]
RANDOM walk for 10009 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100] Max Struct:[103]
[2024-05-23 21:24:29] [INFO ] Invariant cache hit.
[2024-05-23 21:24:29] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:24:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:24:29] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-05-23 21:24:29] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:24:29] [INFO ] Added : 23 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100] Max Struct:[103]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:24:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:24:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:24:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[103]
RANDOM walk for 1000011 steps (2 resets) in 158 ms. (6289 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 157 ms. (6329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100] Max Struct:[103]
[2024-05-23 21:24:30] [INFO ] Invariant cache hit.
[2024-05-23 21:24:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:30] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:24:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:30] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:24:30] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:24:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:24:30] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:24:30] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100] Max Struct:[103]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:24:30] [INFO ] Invariant cache hit.
[2024-05-23 21:24:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 21:24:30] [INFO ] Invariant cache hit.
[2024-05-23 21:24:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:30] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-23 21:24:30] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:30] [INFO ] Invariant cache hit.
[2024-05-23 21:24:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40033 steps (8 resets) in 14 ms. (2668 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1432141 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 2
Probabilistic random walk after 1432141 steps, saw 529026 distinct states, run finished after 3004 ms. (steps per millisecond=476 ) properties seen :0
[2024-05-23 21:24:33] [INFO ] Invariant cache hit.
[2024-05-23 21:24:33] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:24:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 90ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:33] [INFO ] Invariant cache hit.
[2024-05-23 21:24:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40052 steps (8 resets) in 16 ms. (2356 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3881258 steps, run timeout after 3001 ms. (steps per millisecond=1293 ) properties seen :0 out of 1
Probabilistic random walk after 3881258 steps, saw 1395029 distinct states, run finished after 3001 ms. (steps per millisecond=1293 ) properties seen :0
[2024-05-23 21:24:36] [INFO ] Invariant cache hit.
[2024-05-23 21:24:36] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:24:37] [INFO ] Invariant cache hit.
[2024-05-23 21:24:37] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 21:24:37] [INFO ] Invariant cache hit.
[2024-05-23 21:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-23 21:24:37] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:37] [INFO ] Invariant cache hit.
[2024-05-23 21:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[100] Max Struct:[103]
Ending property specific reduction for JoinFreeModules-PT-0100-UpperBounds-00 in 7361 ms.
Starting property specific reduction for JoinFreeModules-PT-0100-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[103]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:24:37] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[103]
RANDOM walk for 10007 steps (2 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100] Max Struct:[103]
[2024-05-23 21:24:37] [INFO ] Invariant cache hit.
[2024-05-23 21:24:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:37] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:37] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:24:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:24:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 27 ms returned sat
[2024-05-23 21:24:37] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:24:37] [INFO ] Added : 23 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100] Max Struct:[103]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:24:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:24:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[103]
RANDOM walk for 1000011 steps (2 resets) in 169 ms. (5882 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 179 ms. (5555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100] Max Struct:[103]
[2024-05-23 21:24:37] [INFO ] Invariant cache hit.
[2024-05-23 21:24:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:24:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:24:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:38] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:24:38] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:24:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:38] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:24:38] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100] Max Struct:[103]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:24:38] [INFO ] Invariant cache hit.
[2024-05-23 21:24:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 21:24:38] [INFO ] Invariant cache hit.
[2024-05-23 21:24:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-23 21:24:38] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:38] [INFO ] Invariant cache hit.
[2024-05-23 21:24:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40040 steps (8 resets) in 25 ms. (1540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1410429 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :0 out of 2
Probabilistic random walk after 1410429 steps, saw 521242 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
[2024-05-23 21:24:41] [INFO ] Invariant cache hit.
[2024-05-23 21:24:41] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:24:41] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 105ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:41] [INFO ] Invariant cache hit.
[2024-05-23 21:24:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40097 steps (8 resets) in 14 ms. (2673 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4051301 steps, run timeout after 3001 ms. (steps per millisecond=1349 ) properties seen :0 out of 1
Probabilistic random walk after 4051301 steps, saw 1453608 distinct states, run finished after 3001 ms. (steps per millisecond=1349 ) properties seen :0
[2024-05-23 21:24:44] [INFO ] Invariant cache hit.
[2024-05-23 21:24:44] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:24:44] [INFO ] Invariant cache hit.
[2024-05-23 21:24:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 21:24:44] [INFO ] Invariant cache hit.
[2024-05-23 21:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:44] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-23 21:24:44] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:44] [INFO ] Invariant cache hit.
[2024-05-23 21:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[100] Max Struct:[103]
Ending property specific reduction for JoinFreeModules-PT-0100-UpperBounds-01 in 7551 ms.
Starting property specific reduction for JoinFreeModules-PT-0100-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[103]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[103]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:24:44] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[103]
RANDOM walk for 10017 steps (2 resets) in 9 ms. (1001 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101] Max Struct:[103]
[2024-05-23 21:24:44] [INFO ] Invariant cache hit.
[2024-05-23 21:24:44] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:44] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:24:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:24:44] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:44] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:24:44] [INFO ] Added : 29 causal constraints over 7 iterations in 32 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[101] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[103]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:24:44] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 21:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:24:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[101] Max Struct:[103]
RANDOM walk for 1000000 steps (2 resets) in 153 ms. (6493 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 226 ms. (4405 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101] Max Struct:[103]
[2024-05-23 21:24:45] [INFO ] Invariant cache hit.
[2024-05-23 21:24:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:24:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:24:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:24:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:24:45] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[101] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[103]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:24:45] [INFO ] Invariant cache hit.
[2024-05-23 21:24:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 21:24:45] [INFO ] Invariant cache hit.
[2024-05-23 21:24:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:45] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-23 21:24:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:45] [INFO ] Invariant cache hit.
[2024-05-23 21:24:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40050 steps (8 resets) in 37 ms. (1053 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1256424 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :0 out of 2
Probabilistic random walk after 1256424 steps, saw 465348 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :0
[2024-05-23 21:24:48] [INFO ] Invariant cache hit.
[2024-05-23 21:24:48] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:24:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 82ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:48] [INFO ] Invariant cache hit.
[2024-05-23 21:24:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40038 steps (8 resets) in 17 ms. (2224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3730701 steps, run timeout after 3001 ms. (steps per millisecond=1243 ) properties seen :0 out of 1
Probabilistic random walk after 3730701 steps, saw 1343824 distinct states, run finished after 3001 ms. (steps per millisecond=1243 ) properties seen :0
[2024-05-23 21:24:52] [INFO ] Invariant cache hit.
[2024-05-23 21:24:52] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:24:52] [INFO ] Invariant cache hit.
[2024-05-23 21:24:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 21:24:52] [INFO ] Invariant cache hit.
[2024-05-23 21:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-23 21:24:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:52] [INFO ] Invariant cache hit.
[2024-05-23 21:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[101] Max Struct:[103]
Ending property specific reduction for JoinFreeModules-PT-0100-UpperBounds-02 in 7565 ms.
Starting property specific reduction for JoinFreeModules-PT-0100-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[103]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:24:52] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[103]
RANDOM walk for 10005 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100] Max Struct:[103]
[2024-05-23 21:24:52] [INFO ] Invariant cache hit.
[2024-05-23 21:24:52] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned sat
[2024-05-23 21:24:52] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-23 21:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 21:24:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:24:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:24:52] [INFO ] [Nat]Added 7 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:24:52] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:24:52] [INFO ] Added : 23 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100] Max Struct:[103]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:24:52] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 21:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 185ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:24:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[103]
RANDOM walk for 1000012 steps (2 resets) in 155 ms. (6410 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 153 ms. (6493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100] Max Struct:[103]
[2024-05-23 21:24:53] [INFO ] Invariant cache hit.
[2024-05-23 21:24:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:24:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:24:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:24:53] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:24:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:24:53] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:24:53] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[100] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100] Max Struct:[103]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:24:53] [INFO ] Invariant cache hit.
[2024-05-23 21:24:53] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 21:24:53] [INFO ] Invariant cache hit.
[2024-05-23 21:24:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-23 21:24:53] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:53] [INFO ] Invariant cache hit.
[2024-05-23 21:24:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40021 steps (8 resets) in 23 ms. (1667 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2117394 steps, run timeout after 3001 ms. (steps per millisecond=705 ) properties seen :0 out of 2
Probabilistic random walk after 2117394 steps, saw 774942 distinct states, run finished after 3001 ms. (steps per millisecond=705 ) properties seen :0
[2024-05-23 21:24:56] [INFO ] Invariant cache hit.
[2024-05-23 21:24:56] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:24:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 109ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:56] [INFO ] Invariant cache hit.
[2024-05-23 21:24:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40074 steps (8 resets) in 11 ms. (3339 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12 ms. (3077 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3951742 steps, run timeout after 3001 ms. (steps per millisecond=1316 ) properties seen :0 out of 1
Probabilistic random walk after 3951742 steps, saw 1419909 distinct states, run finished after 3003 ms. (steps per millisecond=1315 ) properties seen :0
[2024-05-23 21:24:59] [INFO ] Invariant cache hit.
[2024-05-23 21:24:59] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:24:59] [INFO ] Invariant cache hit.
[2024-05-23 21:24:59] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-23 21:24:59] [INFO ] Invariant cache hit.
[2024-05-23 21:24:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:24:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-23 21:24:59] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:24:59] [INFO ] Invariant cache hit.
[2024-05-23 21:24:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[100] Max Struct:[103]
Ending property specific reduction for JoinFreeModules-PT-0100-UpperBounds-04 in 7780 ms.
Starting property specific reduction for JoinFreeModules-PT-0100-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[103]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[103]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:25:00] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[103]
RANDOM walk for 10015 steps (2 resets) in 7 ms. (1251 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101] Max Struct:[103]
[2024-05-23 21:25:00] [INFO ] Invariant cache hit.
[2024-05-23 21:25:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:25:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:25:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:25:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:25:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:25:00] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:25:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:25:00] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:25:00] [INFO ] Added : 30 causal constraints over 7 iterations in 40 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[101] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[103]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:25:00] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:25:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:25:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[101] Max Struct:[103]
RANDOM walk for 1000000 steps (2 resets) in 168 ms. (5917 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 175 ms. (5681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101] Max Struct:[103]
[2024-05-23 21:25:00] [INFO ] Invariant cache hit.
[2024-05-23 21:25:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:25:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 21:25:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:25:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:25:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-23 21:25:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:25:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:25:00] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:25:00] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[101] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[103]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:25:01] [INFO ] Invariant cache hit.
[2024-05-23 21:25:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 21:25:01] [INFO ] Invariant cache hit.
[2024-05-23 21:25:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:25:01] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-23 21:25:01] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:25:01] [INFO ] Invariant cache hit.
[2024-05-23 21:25:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40033 steps (8 resets) in 30 ms. (1291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2328086 steps, run timeout after 3001 ms. (steps per millisecond=775 ) properties seen :0 out of 2
Probabilistic random walk after 2328086 steps, saw 850088 distinct states, run finished after 3005 ms. (steps per millisecond=774 ) properties seen :0
[2024-05-23 21:25:04] [INFO ] Invariant cache hit.
[2024-05-23 21:25:04] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:25:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 92ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:25:04] [INFO ] Invariant cache hit.
[2024-05-23 21:25:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40028 steps (8 resets) in 12 ms. (3079 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4182135 steps, run timeout after 3001 ms. (steps per millisecond=1393 ) properties seen :0 out of 1
Probabilistic random walk after 4182135 steps, saw 1498727 distinct states, run finished after 3001 ms. (steps per millisecond=1393 ) properties seen :0
[2024-05-23 21:25:07] [INFO ] Invariant cache hit.
[2024-05-23 21:25:07] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:25:07] [INFO ] Invariant cache hit.
[2024-05-23 21:25:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 21:25:07] [INFO ] Invariant cache hit.
[2024-05-23 21:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:25:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-23 21:25:07] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:25:07] [INFO ] Invariant cache hit.
[2024-05-23 21:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[101] Max Struct:[103]
Ending property specific reduction for JoinFreeModules-PT-0100-UpperBounds-12 in 7602 ms.
Starting property specific reduction for JoinFreeModules-PT-0100-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[103]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[103]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:25:07] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[103]
RANDOM walk for 10005 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101] Max Struct:[103]
[2024-05-23 21:25:07] [INFO ] Invariant cache hit.
[2024-05-23 21:25:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-23 21:25:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:25:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:25:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 21:25:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:25:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:25:07] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 21:25:07] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:25:07] [INFO ] Added : 28 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[101] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[103]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:25:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 21:25:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[101] Max Struct:[103]
RANDOM walk for 1000003 steps (2 resets) in 152 ms. (6535 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 158 ms. (6289 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101] Max Struct:[103]
[2024-05-23 21:25:08] [INFO ] Invariant cache hit.
[2024-05-23 21:25:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:25:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:25:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:25:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:25:08] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:25:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:25:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:25:08] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:25:08] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[101] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[103]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:25:08] [INFO ] Invariant cache hit.
[2024-05-23 21:25:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 21:25:08] [INFO ] Invariant cache hit.
[2024-05-23 21:25:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:25:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-23 21:25:08] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:25:08] [INFO ] Invariant cache hit.
[2024-05-23 21:25:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40035 steps (8 resets) in 20 ms. (1906 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1113908 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :0 out of 2
Probabilistic random walk after 1113908 steps, saw 425173 distinct states, run finished after 3001 ms. (steps per millisecond=371 ) properties seen :0
[2024-05-23 21:25:11] [INFO ] Invariant cache hit.
[2024-05-23 21:25:11] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:25:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 93ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:25:11] [INFO ] Invariant cache hit.
[2024-05-23 21:25:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40088 steps (8 resets) in 17 ms. (2227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4318185 steps, run timeout after 3001 ms. (steps per millisecond=1438 ) properties seen :0 out of 1
Probabilistic random walk after 4318185 steps, saw 1545262 distinct states, run finished after 3002 ms. (steps per millisecond=1438 ) properties seen :0
[2024-05-23 21:25:14] [INFO ] Invariant cache hit.
[2024-05-23 21:25:14] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:25:14] [INFO ] Invariant cache hit.
[2024-05-23 21:25:14] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 21:25:14] [INFO ] Invariant cache hit.
[2024-05-23 21:25:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:25:14] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-23 21:25:14] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:25:14] [INFO ] Invariant cache hit.
[2024-05-23 21:25:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[101] Max Struct:[103]
Ending property specific reduction for JoinFreeModules-PT-0100-UpperBounds-15 in 7395 ms.
[2024-05-23 21:25:15] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:25:15] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/UpperBounds.sr.xml took 18 ms.
[2024-05-23 21:25:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 35 places, 56 transitions and 147 arcs took 3 ms.
Total runtime 319985 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-0100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 35
TRANSITIONS: 56
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.000s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1675
MODEL NAME: /home/mcc/execution/417/model
35 places, 56 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA JoinFreeModules-PT-0100-UpperBounds-01 100 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0100-UpperBounds-00 100 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0100-UpperBounds-02 101 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0100-UpperBounds-04 100 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0100-UpperBounds-12 101 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0100-UpperBounds-15 101 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716499517502

--------------------
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

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="JoinFreeModules-PT-0100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is JoinFreeModules-PT-0100, 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 r223-tall-171649610600053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;