About the Execution of GreatSPN+red for DoubleLock-PT-p2s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13198.592 | 1420742.00 | 2780449.00 | 2012.80 | 10 ? 1 0 1 0 0 ? 1 1 10 1 1 ? 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131500621.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-p2s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500621
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 12 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 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 813K 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-p2s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716397237120
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-p2s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:00:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 17:00:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:00:38] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-22 17:00:38] [INFO ] Transformed 184 places.
[2024-05-22 17:00:38] [INFO ] Transformed 1832 transitions.
[2024-05-22 17:00:38] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 17:00:38] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2024-05-22 17:00:38] [INFO ] Computed 4 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, +inf, 1, 1, +inf, 1, 1, 10, 1, 1, +inf, 1, 1]
RANDOM walk for 10001 steps (103 resets) in 41 ms. (238 steps per ms)
FORMULA DoubleLock-PT-p2s2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (56 resets) in 44 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:00:38] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2024-05-22 17:00:38] [INFO ] Invariant cache hit.
[2024-05-22 17:00:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 17:00:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:00:39] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-22 17:00:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:00:39] [INFO ] [Real]Added 116 Read/Feed constraints in 51 ms returned sat
[2024-05-22 17:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:00:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 17:00:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:00:39] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-22 17:00:39] [INFO ] [Nat]Added 116 Read/Feed constraints in 136 ms returned sat
[2024-05-22 17:00:39] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 168 ms.
[2024-05-22 17:00:40] [INFO ] Added : 2 causal constraints over 2 iterations in 362 ms. Result :sat
Minimization took 635 ms.
[2024-05-22 17:00:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:00:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:00:41] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-22 17:00:41] [INFO ] [Real]Added 116 Read/Feed constraints in 75 ms returned sat
[2024-05-22 17:00:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:00:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:00:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:00:41] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2024-05-22 17:00:41] [INFO ] [Nat]Added 116 Read/Feed constraints in 133 ms returned sat
[2024-05-22 17:00:41] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 13 ms to minimize.
[2024-05-22 17:00:42] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 1 ms to minimize.
[2024-05-22 17:00:42] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 1 ms to minimize.
[2024-05-22 17:00:42] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 1 ms to minimize.
[2024-05-22 17:00:42] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 1 ms to minimize.
[2024-05-22 17:00:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1178 ms
[2024-05-22 17:00:42] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 92 ms.
[2024-05-22 17:00:42] [INFO ] Added : 0 causal constraints over 0 iterations in 172 ms. Result :sat
Minimization took 620 ms.
[2024-05-22 17:00:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:00:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:00:43] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-22 17:00:43] [INFO ] [Real]Added 116 Read/Feed constraints in 35 ms returned sat
[2024-05-22 17:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:00:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:00:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:00:44] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-05-22 17:00:44] [INFO ] [Nat]Added 116 Read/Feed constraints in 86 ms returned sat
[2024-05-22 17:00:44] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 1 ms to minimize.
[2024-05-22 17:00:44] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 1 ms to minimize.
[2024-05-22 17:00:44] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 1 ms to minimize.
[2024-05-22 17:00:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 689 ms
[2024-05-22 17:00:45] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 167 ms.
[2024-05-22 17:00:45] [INFO ] Added : 0 causal constraints over 0 iterations in 330 ms. Result :sat
Minimization took 644 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 144 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 143 transition count 1720
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 143 transition count 1720
Applied a total of 19 rules in 117 ms. Remains 143 /148 variables (removed 5) and now considering 1720/1768 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 143/148 places, 1720/1768 transitions.
[2024-05-22 17:00:45] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 150 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :[1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 2] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:00:46] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
// Phase 1: matrix 1177 rows 143 cols
[2024-05-22 17:00:46] [INFO ] Computed 2 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 2] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000004 steps (10154 resets) in 1460 ms. (684 steps per ms)
BEST_FIRST walk for 3000001 steps (5815 resets) in 1474 ms. (2033 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:00:49] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2024-05-22 17:00:49] [INFO ] Invariant cache hit.
[2024-05-22 17:00:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:00:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:00:49] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-05-22 17:00:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:00:50] [INFO ] [Real]Added 116 Read/Feed constraints in 90 ms returned sat
[2024-05-22 17:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:00:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:00:50] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-22 17:00:50] [INFO ] [Nat]Added 116 Read/Feed constraints in 284 ms returned sat
[2024-05-22 17:00:50] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 88 ms.
[2024-05-22 17:00:50] [INFO ] Added : 1 causal constraints over 1 iterations in 255 ms. Result :sat
Minimization took 1294 ms.
[2024-05-22 17:00:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:00:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:00:52] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-05-22 17:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:00:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:00:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:00:52] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-22 17:00:55] [INFO ] [Nat]Added 116 Read/Feed constraints in 3356 ms returned sat
[2024-05-22 17:00:56] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 90 ms.
[2024-05-22 17:00:56] [INFO ] Added : 0 causal constraints over 0 iterations in 160 ms. Result :sat
Minimization took 1300 ms.
[2024-05-22 17:00:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:00:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:00:57] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-22 17:00:57] [INFO ] [Real]Added 116 Read/Feed constraints in 75 ms returned sat
[2024-05-22 17:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:00:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:00:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:00:58] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-22 17:00:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 215 ms returned sat
[2024-05-22 17:00:58] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 80 ms.
[2024-05-22 17:00:58] [INFO ] Added : 0 causal constraints over 0 iterations in 152 ms. Result :sat
Minimization took 1479 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 33 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2024-05-22 17:01:00] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2024-05-22 17:01:00] [INFO ] Invariant cache hit.
[2024-05-22 17:01:00] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 17:01:00] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2024-05-22 17:01:00] [INFO ] Invariant cache hit.
[2024-05-22 17:01:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:01:01] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
[2024-05-22 17:01:01] [INFO ] Redundant transitions in 101 ms returned []
Running 1718 sub problems to find dead transitions.
[2024-05-22 17:01:01] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2024-05-22 17:01:01] [INFO ] Invariant cache hit.
[2024-05-22 17:01:01] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 261 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1168 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 1718/1979 constraints. Problems are: Problem set: 20 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 1979 constraints, problems are : Problem set: 20 solved, 1698 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
After SMT, in 62801ms problems are : Problem set: 20 solved, 1698 unsolved
Search for dead transitions found 20 dead transitions in 62834ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1700/1720 transitions.
Applied a total of 0 rules in 32 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 17:02:04] [INFO ] Redundant transitions in 26 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64028 ms. Remains : 143/143 places, 1700/1720 transitions.
[2024-05-22 17:02:04] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 218=1, 390=1, 663=1, 664=1, 754=1, 756=1, 843=1, 935=1, 1074=1, 1076=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 702=1, 703=1, 1113=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 162 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :[2, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:02:05] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2024-05-22 17:02:05] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (10164 resets) in 1273 ms. (784 steps per ms)
BEST_FIRST walk for 3000003 steps (5838 resets) in 1523 ms. (1968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:02:08] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:02:08] [INFO ] Invariant cache hit.
[2024-05-22 17:02:08] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:02:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:02:08] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-22 17:02:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:02:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:02:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-22 17:02:08] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-22 17:02:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:02:08] [INFO ] [Nat]Added 116 Read/Feed constraints in 277 ms returned sat
[2024-05-22 17:02:08] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1019 transitions) in 86 ms.
[2024-05-22 17:02:08] [INFO ] Added : 0 causal constraints over 0 iterations in 168 ms. Result :sat
Minimization took 1054 ms.
[2024-05-22 17:02:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:02:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:02:10] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-22 17:02:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:02:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:02:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 17:02:10] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-22 17:02:10] [INFO ] [Nat]Added 116 Read/Feed constraints in 174 ms returned sat
[2024-05-22 17:02:10] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1019 transitions) in 77 ms.
[2024-05-22 17:02:10] [INFO ] Added : 0 causal constraints over 0 iterations in 150 ms. Result :sat
Minimization took 1015 ms.
[2024-05-22 17:02:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:02:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:02:12] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2024-05-22 17:02:12] [INFO ] [Real]Added 116 Read/Feed constraints in 72 ms returned sat
[2024-05-22 17:02:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:02:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:02:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:02:12] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-22 17:02:12] [INFO ] [Nat]Added 116 Read/Feed constraints in 284 ms returned sat
[2024-05-22 17:02:12] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1019 transitions) in 81 ms.
[2024-05-22 17:02:12] [INFO ] Added : 0 causal constraints over 0 iterations in 158 ms. Result :sat
Minimization took 1019 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 143/143 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 23 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 17:02:14] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:02:14] [INFO ] Invariant cache hit.
[2024-05-22 17:02:14] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-22 17:02:14] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:02:14] [INFO ] Invariant cache hit.
[2024-05-22 17:02:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:02:15] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
[2024-05-22 17:02:15] [INFO ] Redundant transitions in 79 ms returned []
Running 1698 sub problems to find dead transitions.
[2024-05-22 17:02:15] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:02:15] [INFO ] Invariant cache hit.
[2024-05-22 17:02:15] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1304 variables, 1698/1959 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1959 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
After SMT, in 62257ms problems are : Problem set: 0 solved, 1698 unsolved
Search for dead transitions found 0 dead transitions in 62272ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63387 ms. Remains : 143/143 places, 1700/1700 transitions.
[2024-05-22 17:03:17] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 218=1, 390=1, 663=1, 664=1, 754=1, 756=1, 843=1, 935=1, 1074=1, 1076=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 702=1, 703=1, 1113=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 157 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :[2, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40015 steps (407 resets) in 675 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (75 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 293877 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 3
Probabilistic random walk after 293877 steps, saw 201477 distinct states, run finished after 3007 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-22 17:03:21] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:03:21] [INFO ] Invariant cache hit.
[2024-05-22 17:03:21] [INFO ] State equation strengthened by 116 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) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1066/1211 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1211 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1211 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 15/1226 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1226 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1226 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 78/1304 variables, 69/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1304 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 80/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1304 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 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) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1066/1211 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1211 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1211 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1211 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/1226 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1226 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1226 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 78/1304 variables, 69/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 80/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1304 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1304 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 264 constraints, problems are : Problem set: 0 solved, 3 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1335ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 143/143 places, 1700/1700 transitions.
RANDOM walk for 40015 steps (419 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (79 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (74 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (76 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 249754 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 3
Probabilistic random walk after 249754 steps, saw 171950 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-22 17:03:26] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:03:26] [INFO ] Invariant cache hit.
[2024-05-22 17:03:26] [INFO ] State equation strengthened by 116 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) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1066/1211 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1211 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1211 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 15/1226 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1226 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1226 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 78/1304 variables, 69/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1304 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 80/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1304 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 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) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1066/1211 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1211 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1211 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1211 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/1226 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1226 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1226 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 78/1304 variables, 69/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 80/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1304 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1304 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 264 constraints, problems are : Problem set: 0 solved, 3 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1372ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 23 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 143/143 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 17:03:27] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:03:27] [INFO ] Invariant cache hit.
[2024-05-22 17:03:27] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 17:03:27] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:03:27] [INFO ] Invariant cache hit.
[2024-05-22 17:03:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:03:28] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2024-05-22 17:03:28] [INFO ] Redundant transitions in 29 ms returned []
Running 1698 sub problems to find dead transitions.
[2024-05-22 17:03:28] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:03:28] [INFO ] Invariant cache hit.
[2024-05-22 17:03:28] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1304 variables, 1698/1959 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1959 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
After SMT, in 62232ms problems are : Problem set: 0 solved, 1698 unsolved
Search for dead transitions found 0 dead transitions in 62247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63203 ms. Remains : 143/143 places, 1700/1700 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 143 transition count 1161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 539 place count 143 transition count 1151
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 559 place count 133 transition count 1151
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 563 place count 131 transition count 1149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 564 place count 130 transition count 1117
Iterating global reduction 1 with 1 rules applied. Total rules applied 565 place count 130 transition count 1117
Applied a total of 565 rules in 41 ms. Remains 130 /143 variables (removed 13) and now considering 1117/1700 (removed 583) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1117 rows 130 cols
[2024-05-22 17:04:31] [INFO ] Computed 2 invariants in 8 ms
[2024-05-22 17:04:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:04:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:04:31] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 17:04:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:04:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:04:31] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 17:04:31] [INFO ] After 388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 17:04:31] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 866 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-01
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 17:04:31] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2024-05-22 17:04:31] [INFO ] Computed 2 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (102 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:04:31] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:04:31] [INFO ] Invariant cache hit.
[2024-05-22 17:04:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:04:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:04:32] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-22 17:04:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:04:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:04:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:04:32] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-22 17:04:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:04:32] [INFO ] [Nat]Added 116 Read/Feed constraints in 352 ms returned sat
[2024-05-22 17:04:32] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1019 transitions) in 83 ms.
[2024-05-22 17:04:32] [INFO ] Added : 0 causal constraints over 0 iterations in 154 ms. Result :sat
Minimization took 599 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1700/1700 transitions.
[2024-05-22 17:04:33] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 218=1, 390=1, 663=1, 664=1, 754=1, 756=1, 843=1, 935=1, 1074=1, 1076=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 702=1, 703=1, 1113=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 160 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:04:34] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:04:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (10248 resets) in 1245 ms. (802 steps per ms)
BEST_FIRST walk for 1000000 steps (1895 resets) in 497 ms. (2008 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:04:35] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:04:35] [INFO ] Invariant cache hit.
[2024-05-22 17:04:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:04:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:04:36] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-22 17:04:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:04:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:04:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:04:36] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-22 17:04:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:04:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 284 ms returned sat
[2024-05-22 17:04:36] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1019 transitions) in 83 ms.
[2024-05-22 17:04:36] [INFO ] Added : 0 causal constraints over 0 iterations in 163 ms. Result :sat
Minimization took 1046 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 17:04:38] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:04:38] [INFO ] Invariant cache hit.
[2024-05-22 17:04:38] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 17:04:38] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:04:38] [INFO ] Invariant cache hit.
[2024-05-22 17:04:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:04:38] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2024-05-22 17:04:39] [INFO ] Redundant transitions in 30 ms returned []
Running 1698 sub problems to find dead transitions.
[2024-05-22 17:04:39] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:04:39] [INFO ] Invariant cache hit.
[2024-05-22 17:04:39] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1304 variables, 1698/1959 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1959 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
After SMT, in 62433ms problems are : Problem set: 0 solved, 1698 unsolved
Search for dead transitions found 0 dead transitions in 62450ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63491 ms. Remains : 143/143 places, 1700/1700 transitions.
[2024-05-22 17:05:41] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 218=1, 390=1, 663=1, 664=1, 754=1, 756=1, 843=1, 935=1, 1074=1, 1076=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 702=1, 703=1, 1113=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 162 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:05:42] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:05:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10192 resets) in 1342 ms. (744 steps per ms)
BEST_FIRST walk for 1000001 steps (1944 resets) in 520 ms. (1919 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:05:43] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:05:43] [INFO ] Invariant cache hit.
[2024-05-22 17:05:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:05:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 17:05:44] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-22 17:05:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:05:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:05:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:05:44] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-22 17:05:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:05:44] [INFO ] [Nat]Added 116 Read/Feed constraints in 257 ms returned sat
[2024-05-22 17:05:44] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1019 transitions) in 79 ms.
[2024-05-22 17:05:44] [INFO ] Added : 0 causal constraints over 0 iterations in 156 ms. Result :sat
Minimization took 1008 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 33 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 143/143 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 17:05:46] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:05:46] [INFO ] Invariant cache hit.
[2024-05-22 17:05:46] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 17:05:46] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:05:46] [INFO ] Invariant cache hit.
[2024-05-22 17:05:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:05:47] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2024-05-22 17:05:47] [INFO ] Redundant transitions in 23 ms returned []
Running 1698 sub problems to find dead transitions.
[2024-05-22 17:05:47] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:05:47] [INFO ] Invariant cache hit.
[2024-05-22 17:05:47] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1304 variables, 1698/1959 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1959 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
After SMT, in 62334ms problems are : Problem set: 0 solved, 1698 unsolved
Search for dead transitions found 0 dead transitions in 62348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63453 ms. Remains : 143/143 places, 1700/1700 transitions.
[2024-05-22 17:06:49] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 218=1, 390=1, 663=1, 664=1, 754=1, 756=1, 843=1, 935=1, 1074=1, 1076=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 702=1, 703=1, 1113=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 156 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (404 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (72 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505881 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505881 steps, saw 343341 distinct states, run finished after 3004 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-22 17:06:53] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:06:53] [INFO ] Invariant cache hit.
[2024-05-22 17:06:53] [INFO ] State equation strengthened by 116 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1151/1201 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/1219 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1219 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1219 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/1304 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1304 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1304 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1151/1201 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/1219 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1219 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1219 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/1304 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 82/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1304 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1304 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 795ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 149 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 143/143 places, 1700/1700 transitions.
RANDOM walk for 40007 steps (405 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (72 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519471 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519471 steps, saw 352433 distinct states, run finished after 3002 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-22 17:06:57] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:06:57] [INFO ] Invariant cache hit.
[2024-05-22 17:06:57] [INFO ] State equation strengthened by 116 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1151/1201 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/1219 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1219 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1219 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/1304 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1304 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1304 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1151/1201 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/1219 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1219 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1219 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/1304 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 82/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1304 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1304 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 775ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 143/143 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 17:06:57] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:06:57] [INFO ] Invariant cache hit.
[2024-05-22 17:06:58] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 17:06:58] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:06:58] [INFO ] Invariant cache hit.
[2024-05-22 17:06:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:06:58] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2024-05-22 17:06:58] [INFO ] Redundant transitions in 31 ms returned []
Running 1698 sub problems to find dead transitions.
[2024-05-22 17:06:58] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:06:58] [INFO ] Invariant cache hit.
[2024-05-22 17:06:58] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 261 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1304 variables, 1698/1959 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1959 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
After SMT, in 62276ms problems are : Problem set: 0 solved, 1698 unsolved
Search for dead transitions found 0 dead transitions in 62289ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63191 ms. Remains : 143/143 places, 1700/1700 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 143 transition count 1161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 539 place count 143 transition count 1151
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 559 place count 133 transition count 1151
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 565 place count 130 transition count 1148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 566 place count 129 transition count 1116
Iterating global reduction 1 with 1 rules applied. Total rules applied 567 place count 129 transition count 1116
Applied a total of 567 rules in 39 ms. Remains 129 /143 variables (removed 14) and now considering 1116/1700 (removed 584) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1116 rows 129 cols
[2024-05-22 17:08:01] [INFO ] Computed 2 invariants in 23 ms
[2024-05-22 17:08:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:08:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:08:01] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 17:08:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:08:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:08:01] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 17:08:01] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 17:08:01] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 654 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-01 in 209909 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 17:08:01] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2024-05-22 17:08:01] [INFO ] Computed 2 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (99 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:08:01] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:08:01] [INFO ] Invariant cache hit.
[2024-05-22 17:08:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:08:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:08:02] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-05-22 17:08:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:08:02] [INFO ] [Real]Added 116 Read/Feed constraints in 61 ms returned sat
[2024-05-22 17:08:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:08:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:08:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:08:02] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-22 17:08:02] [INFO ] [Nat]Added 116 Read/Feed constraints in 157 ms returned sat
[2024-05-22 17:08:02] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1019 transitions) in 188 ms.
[2024-05-22 17:08:02] [INFO ] Added : 0 causal constraints over 0 iterations in 268 ms. Result :sat
Minimization took 607 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1684
Applied a total of 16 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1684/1700 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 143/143 places, 1684/1700 transitions.
[2024-05-22 17:08:03] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
Found an invariant !
This invariant on transitions {12=2, 18=1, 29=1, 674=1, 675=1, 1085=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 647=1, 648=1, 1058=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 155 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:08:03] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
// Phase 1: matrix 1145 rows 143 cols
[2024-05-22 17:08:04] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10199 resets) in 1232 ms. (811 steps per ms)
BEST_FIRST walk for 1000001 steps (1923 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:08:05] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
[2024-05-22 17:08:05] [INFO ] Invariant cache hit.
[2024-05-22 17:08:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:08:05] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-22 17:08:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:08:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:08:06] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-22 17:08:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:08:06] [INFO ] [Nat]Added 116 Read/Feed constraints in 170 ms returned sat
[2024-05-22 17:08:06] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 14 ms to minimize.
[2024-05-22 17:08:06] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 1 ms to minimize.
[2024-05-22 17:08:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2024-05-22 17:08:06] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1003 transitions) in 78 ms.
[2024-05-22 17:08:07] [INFO ] Added : 0 causal constraints over 0 iterations in 159 ms. Result :sat
Minimization took 1344 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1684/1684 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1684/1684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 1684/1684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1684/1684 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1684/1684 (removed 0) transitions.
[2024-05-22 17:08:08] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
[2024-05-22 17:08:08] [INFO ] Invariant cache hit.
[2024-05-22 17:08:08] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 17:08:08] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
[2024-05-22 17:08:08] [INFO ] Invariant cache hit.
[2024-05-22 17:08:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:08:10] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2024-05-22 17:08:10] [INFO ] Redundant transitions in 31 ms returned []
Running 1682 sub problems to find dead transitions.
[2024-05-22 17:08:10] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
[2024-05-22 17:08:10] [INFO ] Invariant cache hit.
[2024-05-22 17:08:10] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
[2024-05-22 17:08:23] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 1 ms to minimize.
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
[2024-05-22 17:08:23] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 1 ms to minimize.
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
[2024-05-22 17:08:23] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 1 ms to minimize.
Problem TDEAD1219 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/6 constraints. Problems are: Problem set: 148 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 148 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 timeout
0.0)
(s91 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1145/1288 variables, 143/149 constraints. Problems are: Problem set: 148 solved, 1534 unsolved
SMT process timed out in 32368ms, After SMT, problems are : Problem set: 148 solved, 1534 unsolved
Search for dead transitions found 148 dead transitions in 32385ms
Found 148 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 148 transitions
Dead transitions reduction (with SMT) removed 148 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1684 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-05-22 17:08:42] [INFO ] Redundant transitions in 23 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33953 ms. Remains : 143/143 places, 1536/1684 transitions.
[2024-05-22 17:08:42] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 152 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:08:43] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2024-05-22 17:08:43] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10159 resets) in 1251 ms. (798 steps per ms)
BEST_FIRST walk for 1000001 steps (1921 resets) in 490 ms. (2036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:08:44] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:08:44] [INFO ] Invariant cache hit.
[2024-05-22 17:08:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 17:08:45] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-22 17:08:45] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-22 17:08:45] [INFO ] [Real]Added 112 Read/Feed constraints in 66 ms returned sat
[2024-05-22 17:08:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:08:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:08:45] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-22 17:08:45] [INFO ] [Nat]Added 112 Read/Feed constraints in 77 ms returned sat
[2024-05-22 17:08:45] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 2 ms to minimize.
[2024-05-22 17:08:45] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 2 ms to minimize.
[2024-05-22 17:08:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2024-05-22 17:08:45] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 76 ms.
[2024-05-22 17:08:46] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Minimization took 862 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-05-22 17:08:46] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:08:46] [INFO ] Invariant cache hit.
[2024-05-22 17:08:47] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 17:08:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:08:47] [INFO ] Invariant cache hit.
[2024-05-22 17:08:47] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-22 17:08:47] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2024-05-22 17:08:47] [INFO ] Redundant transitions in 26 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-05-22 17:08:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:08:47] [INFO ] Invariant cache hit.
[2024-05-22 17:08:47] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62029ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62042ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62900 ms. Remains : 143/143 places, 1536/1536 transitions.
[2024-05-22 17:09:49] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 158 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40009 steps (404 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (79 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 556155 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 1
Probabilistic random walk after 556155 steps, saw 376983 distinct states, run finished after 3002 ms. (steps per millisecond=185 ) properties seen :0
[2024-05-22 17:09:53] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:09:53] [INFO ] Invariant cache hit.
[2024-05-22 17:09:53] [INFO ] State equation strengthened by 112 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:09:54] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2024-05-22 17:09:54] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1164 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1164 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1020ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40001 steps (401 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (73 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 560640 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 560640 steps, saw 379984 distinct states, run finished after 3003 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-22 17:09:57] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:09:57] [INFO ] Invariant cache hit.
[2024-05-22 17:09:57] [INFO ] State equation strengthened by 112 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:09:58] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2024-05-22 17:09:58] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1164 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1164 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1037ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-05-22 17:09:58] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:09:58] [INFO ] Invariant cache hit.
[2024-05-22 17:09:58] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 17:09:58] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:09:58] [INFO ] Invariant cache hit.
[2024-05-22 17:09:58] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-22 17:09:59] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2024-05-22 17:09:59] [INFO ] Redundant transitions in 25 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-05-22 17:09:59] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:09:59] [INFO ] Invariant cache hit.
[2024-05-22 17:09:59] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62115ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63031 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 132 transition count 1010
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 541 place count 130 transition count 1008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 542 place count 129 transition count 976
Iterating global reduction 1 with 1 rules applied. Total rules applied 543 place count 129 transition count 976
Applied a total of 543 rules in 28 ms. Remains 129 /143 variables (removed 14) and now considering 976/1536 (removed 560) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 976 rows 129 cols
[2024-05-22 17:11:01] [INFO ] Computed 3 invariants in 11 ms
[2024-05-22 17:11:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:11:01] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 17:11:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:11:02] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 17:11:02] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 17:11:02] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 560 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 180392 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-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 17:11:02] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2024-05-22 17:11:02] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (101 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10000 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:11:02] [INFO ] Flow matrix only has 1161 transitions (discarded 539 similar events)
[2024-05-22 17:11:02] [INFO ] Invariant cache hit.
[2024-05-22 17:11:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:11:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:11:02] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-22 17:11:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:11:02] [INFO ] [Real]Added 116 Read/Feed constraints in 51 ms returned sat
[2024-05-22 17:11:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:11:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:11:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 17:11:02] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-22 17:11:03] [INFO ] [Nat]Added 116 Read/Feed constraints in 254 ms returned sat
[2024-05-22 17:11:03] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1019 transitions) in 79 ms.
[2024-05-22 17:11:03] [INFO ] Added : 0 causal constraints over 0 iterations in 154 ms. Result :sat
Minimization took 593 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1684
Applied a total of 16 rules in 28 ms. Remains 143 /143 variables (removed 0) and now considering 1684/1700 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 143/143 places, 1684/1700 transitions.
[2024-05-22 17:11:03] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
Found an invariant !
This invariant on transitions {12=2, 18=1, 29=1, 674=1, 675=1, 1085=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 647=1, 648=1, 1058=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 167 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:11:04] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
// Phase 1: matrix 1145 rows 143 cols
[2024-05-22 17:11:04] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10158 resets) in 1272 ms. (785 steps per ms)
BEST_FIRST walk for 1000001 steps (1948 resets) in 528 ms. (1890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:11:06] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
[2024-05-22 17:11:06] [INFO ] Invariant cache hit.
[2024-05-22 17:11:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:11:06] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-05-22 17:11:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:11:06] [INFO ] [Real]Added 116 Read/Feed constraints in 105 ms returned sat
[2024-05-22 17:11:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:11:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:11:06] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-22 17:11:07] [INFO ] [Nat]Added 116 Read/Feed constraints in 263 ms returned sat
[2024-05-22 17:11:07] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 1 ms to minimize.
[2024-05-22 17:11:07] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 1 ms to minimize.
[2024-05-22 17:11:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2024-05-22 17:11:07] [INFO ] Computed and/alt/rep : 140/1068/140 causal constraints (skipped 1003 transitions) in 79 ms.
[2024-05-22 17:11:07] [INFO ] Added : 0 causal constraints over 0 iterations in 159 ms. Result :sat
Minimization took 1200 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1684/1684 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1684/1684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 1684/1684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1684/1684 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1684/1684 (removed 0) transitions.
[2024-05-22 17:11:08] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
[2024-05-22 17:11:08] [INFO ] Invariant cache hit.
[2024-05-22 17:11:09] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 17:11:09] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
[2024-05-22 17:11:09] [INFO ] Invariant cache hit.
[2024-05-22 17:11:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:11:10] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
[2024-05-22 17:11:10] [INFO ] Redundant transitions in 24 ms returned []
Running 1682 sub problems to find dead transitions.
[2024-05-22 17:11:10] [INFO ] Flow matrix only has 1145 transitions (discarded 539 similar events)
[2024-05-22 17:11:10] [INFO ] Invariant cache hit.
[2024-05-22 17:11:10] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
[2024-05-22 17:11:24] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
[2024-05-22 17:11:24] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 1 ms to minimize.
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
[2024-05-22 17:11:24] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 1 ms to minimize.
Problem TDEAD1219 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/6 constraints. Problems are: Problem set: 148 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 148 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1145/1288 variables, 143/149 constraints. Problems are: Problem set: 148 solved, 1534 unsolved
SMT process timed out in 32307ms, After SMT, problems are : Problem set: 148 solved, 1534 unsolved
Search for dead transitions found 148 dead transitions in 32322ms
Found 148 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 148 transitions
Dead transitions reduction (with SMT) removed 148 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1684 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-05-22 17:11:42] [INFO ] Redundant transitions in 20 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33926 ms. Remains : 143/143 places, 1536/1684 transitions.
[2024-05-22 17:11:42] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 161 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:11:43] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2024-05-22 17:11:43] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10119 resets) in 1222 ms. (817 steps per ms)
BEST_FIRST walk for 1000000 steps (1962 resets) in 489 ms. (2040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 17:11:45] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:11:45] [INFO ] Invariant cache hit.
[2024-05-22 17:11:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:11:45] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-22 17:11:45] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-22 17:11:45] [INFO ] [Real]Added 112 Read/Feed constraints in 36 ms returned sat
[2024-05-22 17:11:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:11:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:11:45] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-22 17:11:45] [INFO ] [Nat]Added 112 Read/Feed constraints in 85 ms returned sat
[2024-05-22 17:11:45] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 2 ms to minimize.
[2024-05-22 17:11:46] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 1 ms to minimize.
[2024-05-22 17:11:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2024-05-22 17:11:46] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 71 ms.
[2024-05-22 17:11:46] [INFO ] Added : 0 causal constraints over 0 iterations in 143 ms. Result :sat
Minimization took 929 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-05-22 17:11:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:11:47] [INFO ] Invariant cache hit.
[2024-05-22 17:11:47] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 17:11:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:11:47] [INFO ] Invariant cache hit.
[2024-05-22 17:11:47] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-22 17:11:48] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2024-05-22 17:11:48] [INFO ] Redundant transitions in 26 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-05-22 17:11:48] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:11:48] [INFO ] Invariant cache hit.
[2024-05-22 17:11:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62124ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62985 ms. Remains : 143/143 places, 1536/1536 transitions.
[2024-05-22 17:12:50] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 153 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40001 steps (414 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (78 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567748 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 567748 steps, saw 384739 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-22 17:12:53] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:12:53] [INFO ] Invariant cache hit.
[2024-05-22 17:12:53] [INFO ] State equation strengthened by 112 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/1113 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1164 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/1113 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1164 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40010 steps (396 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567517 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 567517 steps, saw 384586 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-22 17:12:57] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:12:57] [INFO ] Invariant cache hit.
[2024-05-22 17:12:57] [INFO ] State equation strengthened by 112 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/1113 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1164 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/1113 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1164 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 687ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-05-22 17:12:58] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:12:58] [INFO ] Invariant cache hit.
[2024-05-22 17:12:58] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 17:12:58] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:12:58] [INFO ] Invariant cache hit.
[2024-05-22 17:12:58] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-22 17:12:59] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2024-05-22 17:12:59] [INFO ] Redundant transitions in 25 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-05-22 17:12:59] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-05-22 17:12:59] [INFO ] Invariant cache hit.
[2024-05-22 17:12:59] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62249ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62263ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63116 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
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 537 place count 132 transition count 1010
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 543 place count 129 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 544 place count 128 transition count 975
Iterating global reduction 1 with 1 rules applied. Total rules applied 545 place count 128 transition count 975
Applied a total of 545 rules in 23 ms. Remains 128 /143 variables (removed 15) and now considering 975/1536 (removed 561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 975 rows 128 cols
[2024-05-22 17:14:01] [INFO ] Computed 3 invariants in 12 ms
[2024-05-22 17:14:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:14:01] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 17:14:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:14:01] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 17:14:01] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 17:14:01] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 542 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 179797 ms.
[2024-05-22 17:14:02] [INFO ] Flatten gal took : 151 ms
[2024-05-22 17:14:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-22 17:14:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 1700 transitions and 6832 arcs took 9 ms.
Total runtime 804078 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p2s2
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 143
TRANSITIONS: 1700
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.001s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 1123
MODEL NAME: /home/mcc/execution/414/model
143 places, 1700 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716398657862
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-p2s2"
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-p2s2, 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-171631131500621"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 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 ;