About the Execution of GreatSPN+red for DoubleLock-PT-p2s1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1590.896 | 123047.00 | 162372.00 | 252.10 | 1 1 1 1 inf ? 0 inf ? 1 1 inf inf ? 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131500613.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 DoubleLock-PT-p2s1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500613
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 13:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 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 97K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716396674115
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 16:51:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 16:51:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:51:15] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 16:51:15] [INFO ] Transformed 64 places.
[2024-05-22 16:51:15] [INFO ] Transformed 212 transitions.
[2024-05-22 16:51:15] [INFO ] Parsed PT model containing 64 places and 212 transitions and 860 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
FORMULA DoubleLock-PT-p2s1-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 16:51:15] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 56 cols
[2024-05-22 16:51:15] [INFO ] Computed 4 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, +inf, +inf, +inf, 1, 1, +inf, +inf, +inf, 1]
FORMULA DoubleLock-PT-p2s1-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (55 resets) in 41 ms. (238 steps per ms)
FORMULA DoubleLock-PT-p2s1-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (48 resets) in 79 ms. (875 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[34, 22, 7, 6, 6, 13, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 16:51:15] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-05-22 16:51:15] [INFO ] Invariant cache hit.
[2024-05-22 16:51:15] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 16:51:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:51:15] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-22 16:51:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:51:15] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-22 16:51:15] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-22 16:51:15] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2024-05-22 16:51:15] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 20 ms.
[2024-05-22 16:51:16] [INFO ] Added : 29 causal constraints over 6 iterations in 108 ms. Result :sat
Minimization took 45 ms.
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 16:51:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:16] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 14 ms.
[2024-05-22 16:51:16] [INFO ] Added : 11 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 36 ms.
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:51:16] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 14 ms to minimize.
[2024-05-22 16:51:16] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-22 16:51:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2024-05-22 16:51:16] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 20 ms.
[2024-05-22 16:51:16] [INFO ] Added : 22 causal constraints over 5 iterations in 86 ms. Result :sat
Minimization took 35 ms.
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-22 16:51:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 16:51:16] [INFO ] [Nat]Added 27 Read/Feed constraints in 12 ms returned sat
[2024-05-22 16:51:16] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 16:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-22 16:51:17] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 16 ms.
[2024-05-22 16:51:17] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 16:51:17] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-22 16:51:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2024-05-22 16:51:17] [INFO ] Added : 24 causal constraints over 5 iterations in 222 ms. Result :sat
Minimization took 35 ms.
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 16:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:17] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-22 16:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 16:51:17] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 13 ms.
[2024-05-22 16:51:17] [INFO ] Added : 43 causal constraints over 9 iterations in 120 ms. Result :sat
Minimization took 42 ms.
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 16:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:17] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 14 ms.
[2024-05-22 16:51:17] [INFO ] Added : 31 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 36 ms.
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Real]Added 27 Read/Feed constraints in 12 ms returned sat
[2024-05-22 16:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-22 16:51:17] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 16:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-22 16:51:18] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 13 ms.
[2024-05-22 16:51:18] [INFO ] Added : 15 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[34, 22, 7, 6, 6, 13, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[36, 22, 18, 10, 6, 13, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 204/204 transitions.
Graph (complete) has 357 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 53 transition count 200
Applied a total of 5 rules in 23 ms. Remains 53 /56 variables (removed 3) and now considering 200/204 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 53/56 places, 200/204 transitions.
[2024-05-22 16:51:18] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
Found an invariant !
This invariant on transitions {11=1, 24=1, 91=1, 92=1, 142=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {11=1, 24=1, 91=1, 92=1, 142=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :[2147483647, 5, 2147483647, 4, 2147483647, 2147483647, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, 22, +inf, 10, +inf, +inf, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 16:51:18] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
// Phase 1: matrix 148 rows 53 cols
[2024-05-22 16:51:18] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, 22, +inf, 10, +inf, +inf, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1617 ms. (618 steps per ms)
FORMULA DoubleLock-PT-p2s1-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000003 steps (6 resets) in 1259 ms. (2380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22, 12, 13] Max Struct:[+inf, +inf, +inf]
[2024-05-22 16:51:21] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 16:51:21] [INFO ] Invariant cache hit.
[2024-05-22 16:51:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 16:51:21] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-22 16:51:21] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2024-05-22 16:51:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:21] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 16:51:21] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:51:21] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 16:51:21] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 16:51:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2024-05-22 16:51:21] [INFO ] Computed and/alt/rep : 65/458/65 causal constraints (skipped 81 transitions) in 14 ms.
[2024-05-22 16:51:21] [INFO ] Added : 9 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 32 ms.
[2024-05-22 16:51:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 16:51:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 16:51:21] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:21] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 16:51:21] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 16:51:22] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-22 16:51:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2024-05-22 16:51:22] [INFO ] Computed and/alt/rep : 65/458/65 causal constraints (skipped 81 transitions) in 15 ms.
[2024-05-22 16:51:22] [INFO ] Added : 50 causal constraints over 10 iterations in 139 ms. Result :sat
Minimization took 52 ms.
[2024-05-22 16:51:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:22] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 16:51:22] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:22] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-22 16:51:22] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:51:22] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 16:51:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 16:51:22] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-22 16:51:22] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 16:51:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 197 ms
[2024-05-22 16:51:22] [INFO ] Computed and/alt/rep : 65/458/65 causal constraints (skipped 81 transitions) in 18 ms.
[2024-05-22 16:51:22] [INFO ] Added : 30 causal constraints over 7 iterations in 96 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22, 12, 13] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22, 14, 14] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 200/200 transitions.
Graph (complete) has 342 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 188
Applied a total of 7 rules in 15 ms. Remains 49 /53 variables (removed 4) and now considering 188/200 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 49/53 places, 188/200 transitions.
[2024-05-22 16:51:22] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :[11, 8, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[22, 14, 14] Max Struct:[+inf, +inf, +inf]
[2024-05-22 16:51:22] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
// Phase 1: matrix 139 rows 49 cols
[2024-05-22 16:51:22] [INFO ] Computed 3 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[22, 14, 14] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1413 ms. (707 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1153 ms. (2599 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
[2024-05-22 16:51:25] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:25] [INFO ] Invariant cache hit.
[2024-05-22 16:51:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:25] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:51:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:51:25] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:25] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 10 ms.
[2024-05-22 16:51:25] [INFO ] Added : 10 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 31 ms.
[2024-05-22 16:51:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:51:25] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:25] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 16:51:25] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:51:25] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:51:25] [INFO ] Added : 27 causal constraints over 6 iterations in 82 ms. Result :sat
Minimization took 37 ms.
[2024-05-22 16:51:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:26] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:51:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2024-05-22 16:51:26] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:51:26] [INFO ] Added : 36 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:51:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:26] [INFO ] Invariant cache hit.
[2024-05-22 16:51:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 16:51:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:26] [INFO ] Invariant cache hit.
[2024-05-22 16:51:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:51:26] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-22 16:51:26] [INFO ] Redundant transitions in 5 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:51:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:26] [INFO ] Invariant cache hit.
[2024-05-22 16:51:26] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4631 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6683ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6862 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:51:33] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :[12, 9, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
[2024-05-22 16:51:33] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1394 ms. (716 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1158 ms. (2588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
[2024-05-22 16:51:35] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:35] [INFO ] Invariant cache hit.
[2024-05-22 16:51:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:35] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:51:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:35] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 16:51:35] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:51:35] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2024-05-22 16:51:35] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 9 ms.
[2024-05-22 16:51:36] [INFO ] Added : 10 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 38 ms.
[2024-05-22 16:51:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:36] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 16:51:36] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:51:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:36] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:51:36] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:51:36] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 9 ms.
[2024-05-22 16:51:36] [INFO ] Added : 27 causal constraints over 6 iterations in 79 ms. Result :sat
Minimization took 38 ms.
[2024-05-22 16:51:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 16:51:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:36] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 16:51:36] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:36] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:51:36] [INFO ] Added : 36 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:51:36] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:36] [INFO ] Invariant cache hit.
[2024-05-22 16:51:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 16:51:36] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:36] [INFO ] Invariant cache hit.
[2024-05-22 16:51:36] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:51:36] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 16:51:36] [INFO ] Redundant transitions in 6 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:51:36] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:36] [INFO ] Invariant cache hit.
[2024-05-22 16:51:36] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4688 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6548ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6706 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:51:43] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :[11, 6, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40000 steps (8 resets) in 753 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 530184 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 3
Probabilistic random walk after 530184 steps, saw 337816 distinct states, run finished after 3004 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-22 16:51:46] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:46] [INFO ] Invariant cache hit.
[2024-05-22 16:51:46] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 124/142 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 34/188 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 3 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 124/142 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 34/188 variables, 30/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/188 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 81 constraints, problems are : Problem set: 0 solved, 3 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1137 ms.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 49/49 places, 188/188 transitions.
RANDOM walk for 40000 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 595980 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 3
Probabilistic random walk after 595980 steps, saw 376827 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2024-05-22 16:51:51] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:51] [INFO ] Invariant cache hit.
[2024-05-22 16:51:51] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 124/142 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 34/188 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 3 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 124/142 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 34/188 variables, 30/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/188 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 81 constraints, problems are : Problem set: 0 solved, 3 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 258ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 901 ms.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:51:52] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:52] [INFO ] Invariant cache hit.
[2024-05-22 16:51:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 16:51:52] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:52] [INFO ] Invariant cache hit.
[2024-05-22 16:51:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:51:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-22 16:51:52] [INFO ] Redundant transitions in 2 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:51:52] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:52] [INFO ] Invariant cache hit.
[2024-05-22 16:51:52] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6715ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6718ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6865 ms. Remains : 49/49 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 49 transition count 139
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 49 place count 49 transition count 130
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 67 place count 40 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 39 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 38 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 38 transition count 125
Applied a total of 71 rules in 17 ms. Remains 38 /49 variables (removed 11) and now considering 125/188 (removed 63) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 125 rows 38 cols
[2024-05-22 16:51:59] [INFO ] Computed 3 invariants in 3 ms
[2024-05-22 16:51:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:59] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 16:51:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:59] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 16:51:59] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 16:51:59] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 168 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[22, 14, 15] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for DoubleLock-PT-p2s1-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 16:51:59] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
// Phase 1: matrix 139 rows 49 cols
[2024-05-22 16:51:59] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 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:[22] Max Struct:[+inf]
[2024-05-22 16:51:59] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:59] [INFO ] Invariant cache hit.
[2024-05-22 16:51:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 16:51:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:51:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:51:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:51:59] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:51:59] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:51:59] [INFO ] Added : 10 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:51:59] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[22] Max Struct:[+inf]
[2024-05-22 16:51:59] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:51:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[22] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1370 ms. (729 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 398 ms. (2506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22] Max Struct:[+inf]
[2024-05-22 16:52:01] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:01] [INFO ] Invariant cache hit.
[2024-05-22 16:52:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 16:52:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:52:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:01] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 16:52:01] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:52:01] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:52:01] [INFO ] Added : 10 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:52:01] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:01] [INFO ] Invariant cache hit.
[2024-05-22 16:52:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 16:52:01] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:01] [INFO ] Invariant cache hit.
[2024-05-22 16:52:01] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:01] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-22 16:52:01] [INFO ] Redundant transitions in 2 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:52:01] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:01] [INFO ] Invariant cache hit.
[2024-05-22 16:52:01] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4694 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6628ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6630ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6769 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:52:08] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[22] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2110792 steps, run timeout after 3001 ms. (steps per millisecond=703 ) properties seen :0 out of 1
Probabilistic random walk after 2110792 steps, saw 1347977 distinct states, run finished after 3001 ms. (steps per millisecond=703 ) properties seen :0
[2024-05-22 16:52:11] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:11] [INFO ] Invariant cache hit.
[2024-05-22 16:52:11] [INFO ] State equation strengthened by 26 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/150 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/188 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/150 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/188 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4941 steps, including 245 resets, run visited all 1 properties in 6 ms. (steps per millisecond=823 )
Parikh walk visited 1 properties in 13 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[22] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-05 in 12353 ms.
Starting property specific reduction for DoubleLock-PT-p2s1-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 16:52:11] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 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:[5] Max Struct:[+inf]
[2024-05-22 16:52:11] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:11] [INFO ] Invariant cache hit.
[2024-05-22 16:52:11] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 16:52:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 16:52:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:11] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:52:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:52:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:52:12] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:52:12] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:52:12] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-22 16:52:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-22 16:52:12] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 11 ms.
[2024-05-22 16:52:12] [INFO ] Added : 18 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:52:12] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
[2024-05-22 16:52:12] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1442 ms. (693 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 406 ms. (2457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13] Max Struct:[+inf]
[2024-05-22 16:52:14] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:14] [INFO ] Invariant cache hit.
[2024-05-22 16:52:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 16:52:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:14] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2024-05-22 16:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:52:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:14] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-22 16:52:14] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:52:14] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:52:14] [INFO ] Added : 26 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:52:14] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:14] [INFO ] Invariant cache hit.
[2024-05-22 16:52:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 16:52:14] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:14] [INFO ] Invariant cache hit.
[2024-05-22 16:52:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:14] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-22 16:52:14] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:52:14] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:14] [INFO ] Invariant cache hit.
[2024-05-22 16:52:14] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4884 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6803ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6806ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6949 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:52:21] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[13] Max Struct:[+inf]
[2024-05-22 16:52:21] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[13] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1375 ms. (726 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 383 ms. (2604 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[+inf]
[2024-05-22 16:52:23] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:23] [INFO ] Invariant cache hit.
[2024-05-22 16:52:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 16:52:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:23] [INFO ] [Real]Added 26 Read/Feed constraints in 12 ms returned sat
[2024-05-22 16:52:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:52:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:23] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 16:52:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:52:23] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:52:23] [INFO ] Added : 23 causal constraints over 5 iterations in 58 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:52:23] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:23] [INFO ] Invariant cache hit.
[2024-05-22 16:52:23] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 16:52:23] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:23] [INFO ] Invariant cache hit.
[2024-05-22 16:52:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:23] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-22 16:52:23] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:52:23] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:23] [INFO ] Invariant cache hit.
[2024-05-22 16:52:23] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4766 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6699ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6702ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6840 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:52:30] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[19] Max Struct:[+inf]
[2024-05-22 16:52:30] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1382 ms. (723 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 384 ms. (2597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[+inf]
[2024-05-22 16:52:32] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:32] [INFO ] Invariant cache hit.
[2024-05-22 16:52:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:52:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 16:52:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:32] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:52:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:52:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:32] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:52:32] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:52:32] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:52:32] [INFO ] Added : 23 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:52:32] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:32] [INFO ] Invariant cache hit.
[2024-05-22 16:52:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 16:52:32] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:32] [INFO ] Invariant cache hit.
[2024-05-22 16:52:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:32] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-22 16:52:32] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:52:32] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:32] [INFO ] Invariant cache hit.
[2024-05-22 16:52:32] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4626 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6470ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6472ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6606 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:52:39] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[19] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2194282 steps, run timeout after 3001 ms. (steps per millisecond=731 ) properties seen :0 out of 1
Probabilistic random walk after 2194282 steps, saw 1400127 distinct states, run finished after 3001 ms. (steps per millisecond=731 ) properties seen :0
[2024-05-22 16:52:42] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:42] [INFO ] Invariant cache hit.
[2024-05-22 16:52:42] [INFO ] State equation strengthened by 26 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/133 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/150 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/188 variables, 33/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/133 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/150 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/188 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2137937 steps, run timeout after 3001 ms. (steps per millisecond=712 ) properties seen :0 out of 1
Probabilistic random walk after 2137937 steps, saw 1365072 distinct states, run finished after 3001 ms. (steps per millisecond=712 ) properties seen :0
[2024-05-22 16:52:45] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:45] [INFO ] Invariant cache hit.
[2024-05-22 16:52:45] [INFO ] State equation strengthened by 26 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/133 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/150 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/188 variables, 33/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/133 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/150 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/188 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:52:45] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:45] [INFO ] Invariant cache hit.
[2024-05-22 16:52:45] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 16:52:45] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:45] [INFO ] Invariant cache hit.
[2024-05-22 16:52:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-22 16:52:45] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:52:45] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:45] [INFO ] Invariant cache hit.
[2024-05-22 16:52:45] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1855 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4983 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6936ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7090 ms. Remains : 49/49 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 49 transition count 139
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 49 place count 49 transition count 128
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 71 place count 38 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 37 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 36 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 36 transition count 123
Applied a total of 75 rules in 11 ms. Remains 36 /49 variables (removed 13) and now considering 123/188 (removed 65) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 36 cols
[2024-05-22 16:52:52] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 16:52:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:52] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:52:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:52] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:52:52] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:52:52] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 130 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[19] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-08 in 41081 ms.
Starting property specific reduction for DoubleLock-PT-p2s1-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 16:52:52] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
// Phase 1: matrix 139 rows 49 cols
[2024-05-22 16:52:52] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 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:[12] Max Struct:[+inf]
[2024-05-22 16:52:53] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:53] [INFO ] Invariant cache hit.
[2024-05-22 16:52:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 16:52:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:53] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2024-05-22 16:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:52:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:53] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 16:52:53] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:52:53] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:52:53] [INFO ] Added : 23 causal constraints over 5 iterations in 73 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:52:53] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
[2024-05-22 16:52:53] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1402 ms. (712 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 403 ms. (2475 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2024-05-22 16:52:55] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:55] [INFO ] Invariant cache hit.
[2024-05-22 16:52:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 16:52:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:55] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:52:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:52:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:52:55] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 16:52:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-05-22 16:52:55] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-22 16:52:55] [INFO ] Added : 23 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:52:55] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:55] [INFO ] Invariant cache hit.
[2024-05-22 16:52:55] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 16:52:55] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:55] [INFO ] Invariant cache hit.
[2024-05-22 16:52:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:52:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 16:52:55] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:52:55] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:52:55] [INFO ] Invariant cache hit.
[2024-05-22 16:52:55] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1860 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6998ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 7000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7140 ms. Remains : 49/49 places, 188/188 transitions.
[2024-05-22 16:53:02] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2173903 steps, run timeout after 3001 ms. (steps per millisecond=724 ) properties seen :0 out of 1
Probabilistic random walk after 2173903 steps, saw 1387652 distinct states, run finished after 3001 ms. (steps per millisecond=724 ) properties seen :0
[2024-05-22 16:53:05] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:53:05] [INFO ] Invariant cache hit.
[2024-05-22 16:53:05] [INFO ] State equation strengthened by 26 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/149 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/188 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/149 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/188 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
RANDOM walk for 40000 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2128137 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :0 out of 1
Probabilistic random walk after 2128137 steps, saw 1359026 distinct states, run finished after 3001 ms. (steps per millisecond=709 ) properties seen :0
[2024-05-22 16:53:08] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:53:08] [INFO ] Invariant cache hit.
[2024-05-22 16:53:08] [INFO ] State equation strengthened by 26 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/149 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/188 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/149 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/188 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 9 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 16:53:09] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:53:09] [INFO ] Invariant cache hit.
[2024-05-22 16:53:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 16:53:09] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:53:09] [INFO ] Invariant cache hit.
[2024-05-22 16:53:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 16:53:09] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-22 16:53:09] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 16:53:09] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2024-05-22 16:53:09] [INFO ] Invariant cache hit.
[2024-05-22 16:53:09] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4946 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6901ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6903ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7047 ms. Remains : 49/49 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 49 transition count 139
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 49 place count 49 transition count 129
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 69 place count 39 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 37 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 36 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 36 transition count 123
Applied a total of 75 rules in 12 ms. Remains 36 /49 variables (removed 13) and now considering 123/188 (removed 65) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 36 cols
[2024-05-22 16:53:16] [INFO ] Computed 3 invariants in 2 ms
[2024-05-22 16:53:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:53:16] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:53:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:53:16] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:53:16] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:53:16] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 130 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-13 in 23337 ms.
[2024-05-22 16:53:16] [INFO ] Flatten gal took : 39 ms
[2024-05-22 16:53:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-22 16:53:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49 places, 188 transitions and 760 arcs took 3 ms.
Total runtime 121275 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p2s1
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 49
TRANSITIONS: 188
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1047
MODEL NAME: /home/mcc/execution/413/model
49 places, 188 transitions.
Enabling coverability test.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 15 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716396797162
--------------------
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="DoubleLock-PT-p2s1"
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 DoubleLock-PT-p2s1, 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 r135-tall-171631131500613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s1.tgz
mv DoubleLock-PT-p2s1 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;