About the Execution of GreatSPN+red for DES-PT-60b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11361.264 | 3600000.00 | 4684932.00 | 8836.00 | ?FT??T?F??FT??F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r091-tall-171624188400756.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DES-PT-60b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188400756
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 139K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-60b-LTLFireability-00
FORMULA_NAME DES-PT-60b-LTLFireability-01
FORMULA_NAME DES-PT-60b-LTLFireability-02
FORMULA_NAME DES-PT-60b-LTLFireability-03
FORMULA_NAME DES-PT-60b-LTLFireability-04
FORMULA_NAME DES-PT-60b-LTLFireability-05
FORMULA_NAME DES-PT-60b-LTLFireability-06
FORMULA_NAME DES-PT-60b-LTLFireability-07
FORMULA_NAME DES-PT-60b-LTLFireability-08
FORMULA_NAME DES-PT-60b-LTLFireability-09
FORMULA_NAME DES-PT-60b-LTLFireability-10
FORMULA_NAME DES-PT-60b-LTLFireability-11
FORMULA_NAME DES-PT-60b-LTLFireability-12
FORMULA_NAME DES-PT-60b-LTLFireability-13
FORMULA_NAME DES-PT-60b-LTLFireability-14
FORMULA_NAME DES-PT-60b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716330740171
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 22:32:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 22:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:32:21] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-21 22:32:21] [INFO ] Transformed 519 places.
[2024-05-21 22:32:21] [INFO ] Transformed 470 transitions.
[2024-05-21 22:32:21] [INFO ] Found NUPN structural information;
[2024-05-21 22:32:21] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-60b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 492 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 492 transition count 446
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 478 transition count 432
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 478 transition count 432
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 89 place count 478 transition count 422
Applied a total of 89 rules in 129 ms. Remains 478 /519 variables (removed 41) and now considering 422/470 (removed 48) transitions.
// Phase 1: matrix 422 rows 478 cols
[2024-05-21 22:32:21] [INFO ] Computed 62 invariants in 49 ms
[2024-05-21 22:32:22] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-21 22:32:22] [INFO ] Invariant cache hit.
[2024-05-21 22:32:22] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-21 22:32:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (OVERLAPS) 422/900 variables, 478/540 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-21 22:32:36] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 27 ms to minimize.
[2024-05-21 22:32:36] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-21 22:32:36] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:32:36] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 12 ms to minimize.
[2024-05-21 22:32:36] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:32:36] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-21 22:32:40] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 3 ms to minimize.
[2024-05-21 22:32:40] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-21 22:32:40] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 6 ms to minimize.
[2024-05-21 22:32:41] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 10/550 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-21 22:32:50] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-21 22:32:50] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-21 22:32:50] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:32:51] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:32:51] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-21 22:32:51] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/900 variables, and 556 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-21 22:32:57] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:32:57] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-21 22:32:57] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:32:57] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:32:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:32:58] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:32:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:32:58] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:32:58] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:32:58] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-21 22:32:58] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:32:58] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:32:59] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:32:59] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-21 22:32:59] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 22:32:59] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:32:59] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:32:59] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:32:59] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 5 ms to minimize.
[2024-05-21 22:33:02] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-21 22:33:02] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:33:02] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:33:02] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:33:03] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-21 22:33:03] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:33:03] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:33:03] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:33:03] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:33:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:33:04] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-21 22:33:04] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:33:07] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-21 22:33:08] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-21 22:33:08] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
[2024-05-21 22:33:08] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 3 ms to minimize.
[2024-05-21 22:33:09] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-21 22:33:13] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-21 22:33:13] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:33:13] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 10 (OVERLAPS) 422/900 variables, 478/595 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/900 variables, and 1016 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 55/55 constraints]
After SMT, in 60496ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Starting structural reductions in LTL mode, iteration 1 : 478/519 places, 422/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61692 ms. Remains : 478/519 places, 422/470 transitions.
Support contains 35 out of 478 places after structural reductions.
[2024-05-21 22:33:23] [INFO ] Flatten gal took : 64 ms
[2024-05-21 22:33:23] [INFO ] Flatten gal took : 30 ms
[2024-05-21 22:33:23] [INFO ] Input system was already deterministic with 422 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (350 resets) in 1851 ms. (21 steps per ms) remains 10/23 properties
BEST_FIRST walk for 40002 steps (49 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 386 ms. (103 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
[2024-05-21 22:33:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 46/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 122/187 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 275/462 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 409/872 variables, 463/525 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 18/890 variables, 10/535 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 6/896 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/896 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/898 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/898 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 2/900 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/900 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/900 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 540 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 46/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 122/187 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 275/462 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:33:28] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/463 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:33:28] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 409/872 variables, 463/527 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/872 variables, 10/537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:33:31] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:33:31] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 4 ms to minimize.
[2024-05-21 22:33:31] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-21 22:33:31] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-21 22:33:32] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:33:32] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 22:33:32] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-21 22:33:32] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:33:32] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/900 variables, and 546 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 463/478 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 11/11 constraints]
After SMT, in 7875ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 472 transition count 405
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 460 transition count 405
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 460 transition count 394
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 449 transition count 394
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 446 transition count 391
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 446 transition count 391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 446 transition count 388
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 445 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 60 place count 445 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 444 transition count 386
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 443 transition count 385
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 443 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 443 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 442 transition count 383
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 213 place count 369 transition count 310
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 6 with 4 rules applied. Total rules applied 217 place count 367 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 219 place count 366 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 365 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 221 place count 364 transition count 310
Applied a total of 221 rules in 173 ms. Remains 364 /478 variables (removed 114) and now considering 310/422 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 364/478 places, 310/422 transitions.
RANDOM walk for 40000 steps (1510 resets) in 552 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (294 resets) in 202 ms. (197 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (294 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (305 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (299 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (309 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (305 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (316 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (319 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (328 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (276 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 669737 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 10
Probabilistic random walk after 669737 steps, saw 101951 distinct states, run finished after 3009 ms. (steps per millisecond=222 ) properties seen :0
// Phase 1: matrix 310 rows 364 cols
[2024-05-21 22:33:36] [INFO ] Computed 60 invariants in 8 ms
[2024-05-21 22:33:36] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 21/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 71/111 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 195/306 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/307 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 310/617 variables, 307/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/617 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/617 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 57/674 variables, 57/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/674 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 430 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 364/364 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 21/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:33:38] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 71/111 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:33:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 195/306 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/307 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:33:38] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 310/617 variables, 307/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/617 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/617 variables, 7/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:33:42] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:33:42] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/617 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:33:51] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/617 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/617 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 57/674 variables, 57/443 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/674 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/674 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 22:34:09] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/674 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/674 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 447 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 364/364 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 46670ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 16 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 364/364 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2024-05-21 22:34:23] [INFO ] Invariant cache hit.
[2024-05-21 22:34:23] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 22:34:23] [INFO ] Invariant cache hit.
[2024-05-21 22:34:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 22:34:23] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-05-21 22:34:23] [INFO ] Redundant transitions in 19 ms returned []
Running 307 sub problems to find dead transitions.
[2024-05-21 22:34:23] [INFO ] Invariant cache hit.
[2024-05-21 22:34:23] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 3/364 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 310/674 variables, 364/424 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 22:34:39] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/674 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 431 constraints, problems are : Problem set: 0 solved, 307 unsolved in 27406 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 364/364 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 3/364 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 310/674 variables, 364/425 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 6/431 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 307/738 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 22:35:12] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-21 22:35:13] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:35:14] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 22:35:14] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:35:14] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:35:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:35:15] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 745 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 364/364 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 8/8 constraints]
After SMT, in 57666ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 57669ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58227 ms. Remains : 364/364 places, 310/310 transitions.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||G(p1))))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 475 transition count 419
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 413
Applied a total of 14 rules in 33 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-21 22:35:21] [INFO ] Computed 62 invariants in 18 ms
[2024-05-21 22:35:22] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-21 22:35:22] [INFO ] Invariant cache hit.
[2024-05-21 22:35:22] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-21 22:35:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:35:33] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:35:33] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-21 22:35:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:35:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 22:35:34] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-21 22:35:34] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:35:34] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:35:34] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-21 22:35:34] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:35:35] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:35:35] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:35:35] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:35:35] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 22:35:36] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:35:52] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-21 22:35:52] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-05-21 22:35:52] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:35:56] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:35:56] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:35:56] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:35:56] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:35:56] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-21 22:35:57] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 22:35:57] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:35:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:35:57] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-21 22:35:57] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:35:58] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:35:59] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:35:59] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:35:59] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:35:59] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:35:59] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-21 22:36:00] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-21 22:36:00] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:36:03] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:36:03] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:36:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:36:04] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:36:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:36:07] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:36:08] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:36:11] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61120 ms. Remains : 473/478 places, 413/422 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-60b-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 243 ms.
Product exploration explored 100000 steps with 25000 reset in 192 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3133 steps (23 resets) in 27 ms. (111 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Applied a total of 0 rules in 10 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-05-21 22:36:24] [INFO ] Invariant cache hit.
[2024-05-21 22:36:24] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 22:36:24] [INFO ] Invariant cache hit.
[2024-05-21 22:36:25] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-21 22:36:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:36:35] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:36:36] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-21 22:36:36] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:36:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 22:36:36] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:36:36] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:36:36] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:36:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 22:36:37] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:36:37] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-05-21 22:36:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:36:37] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:36:38] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-21 22:36:39] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:36:54] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-21 22:36:55] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 3 ms to minimize.
[2024-05-21 22:36:55] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:36:59] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:36:59] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:36:59] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:36:59] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:36:59] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:36:59] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-21 22:37:00] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:37:00] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:37:00] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-21 22:37:00] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:37:00] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:37:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:37:01] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:37:01] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:37:01] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-21 22:37:01] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:37:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:37:01] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:37:01] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:37:01] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:37:02] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:37:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:37:02] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:37:02] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:37:02] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:37:03] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:37:06] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:37:06] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:37:07] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:37:07] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:37:07] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:37:10] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:37:11] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:37:14] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Finished structural reductions in LTL mode , in 1 iterations and 61044 ms. Remains : 473/473 places, 413/413 transitions.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4693 steps (42 resets) in 37 ms. (123 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 115 ms.
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 467 transition count 410
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 16 place count 467 transition count 412
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 467 transition count 412
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 462 transition count 407
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 462 transition count 407
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 108 place count 462 transition count 410
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 117 place count 453 transition count 401
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 126 place count 453 transition count 401
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 453 transition count 427
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 451 transition count 421
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 451 transition count 421
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 136 rules in 148 ms. Remains 451 /473 variables (removed 22) and now considering 421/413 (removed -8) transitions.
[2024-05-21 22:37:27] [INFO ] Redundant transitions in 28 ms returned []
Running 420 sub problems to find dead transitions.
// Phase 1: matrix 421 rows 451 cols
[2024-05-21 22:37:27] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 22:37:27] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
At refinement iteration 5 (OVERLAPS) 421/872 variables, 451/510 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/872 variables, 16/526 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/872 variables, 0/526 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 0/872 variables, 0/526 constraints. Problems are: Problem set: 110 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 526 constraints, problems are : Problem set: 110 solved, 310 unsolved in 24125 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 451/451 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 110 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 13/13 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/13 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 67/430 variables, 32/45 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/45 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 14/444 variables, 14/59 constraints. Problems are: Problem set: 110 solved, 310 unsolved
[2024-05-21 22:37:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:37:56] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:37:56] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:37:57] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:37:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 5/64 constraints. Problems are: Problem set: 110 solved, 310 unsolved
[2024-05-21 22:37:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:37:59] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 2/66 constraints. Problems are: Problem set: 110 solved, 310 unsolved
[2024-05-21 22:38:02] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 1/67 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/67 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 417/861 variables, 444/511 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 16/527 constraints. Problems are: Problem set: 110 solved, 310 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/861 variables, 310/837 constraints. Problems are: Problem set: 110 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 861/872 variables, and 837 constraints, problems are : Problem set: 110 solved, 310 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 444/451 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 310/420 constraints, Known Traps: 8/8 constraints]
After SMT, in 54440ms problems are : Problem set: 110 solved, 310 unsolved
Search for dead transitions found 110 dead transitions in 54444ms
Found 110 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 110 transitions
Dead transitions reduction (with SMT) removed 110 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 451/473 places, 311/413 transitions.
Graph (complete) has 1253 edges and 451 vertex of which 364 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.1 ms
Discarding 87 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 364 /451 variables (removed 87) and now considering 311/311 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 364/473 places, 311/413 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54662 ms. Remains : 364/473 places, 311/413 transitions.
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Applied a total of 0 rules in 7 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-21 22:38:21] [INFO ] Computed 62 invariants in 6 ms
[2024-05-21 22:38:22] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 22:38:22] [INFO ] Invariant cache hit.
[2024-05-21 22:38:22] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-21 22:38:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:38:33] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:38:35] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:38:35] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:38:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:38:35] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:38:36] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 22:38:37] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:38:52] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-21 22:38:52] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 3 ms to minimize.
[2024-05-21 22:38:52] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:38:56] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:38:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:38:56] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-21 22:38:56] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:38:57] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:38:57] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-21 22:38:57] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:38:57] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:38:57] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-05-21 22:38:57] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:38:58] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:38:59] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:38:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:38:59] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:38:59] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:38:59] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:39:00] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:39:00] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:39:03] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-05-21 22:39:03] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-21 22:39:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:39:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:39:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:39:07] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:39:09] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:39:11] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Finished structural reductions in LTL mode , in 1 iterations and 61036 ms. Remains : 473/473 places, 413/413 transitions.
Treatment of property DES-PT-60b-LTLFireability-00 finished in 241251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X((X(p1)||p0))) U p2)))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 476 transition count 420
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 476 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 476 transition count 419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 475 transition count 418
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 475 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 475 transition count 417
Applied a total of 8 rules in 37 ms. Remains 475 /478 variables (removed 3) and now considering 417/422 (removed 5) transitions.
// Phase 1: matrix 417 rows 475 cols
[2024-05-21 22:39:23] [INFO ] Computed 62 invariants in 10 ms
[2024-05-21 22:39:23] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-21 22:39:23] [INFO ] Invariant cache hit.
[2024-05-21 22:39:23] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-21 22:39:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 416 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (OVERLAPS) 417/892 variables, 475/537 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-21 22:39:35] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-05-21 22:39:35] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-21 22:39:35] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:39:35] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-21 22:39:35] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:39:36] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:39:36] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
[2024-05-21 22:39:36] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:39:36] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-21 22:39:36] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:39:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:39:37] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:39:37] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:39:38] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-21 22:39:38] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:39:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:39:39] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 22:39:39] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:39:39] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-21 22:39:39] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-21 22:39:42] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-21 22:39:42] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:39:42] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:39:42] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 22:39:45] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 6/563 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-21 22:39:48] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:39:51] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:39:53] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:39:53] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:39:54] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:39:54] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
SMT process timed out in 30253ms, After SMT, problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 30258ms
Starting structural reductions in LTL mode, iteration 1 : 475/478 places, 417/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31139 ms. Remains : 475/478 places, 417/422 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : DES-PT-60b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-01 finished in 31458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1)))))))))'
Support contains 8 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 471 transition count 406
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 459 transition count 406
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 459 transition count 395
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 448 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 445 transition count 392
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 445 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 445 transition count 389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 444 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 443 transition count 387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 442 transition count 386
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 442 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 442 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 63 place count 442 transition count 384
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 65 place count 441 transition count 384
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 209 place count 369 transition count 312
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 5 with 4 rules applied. Total rules applied 213 place count 367 transition count 314
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 365 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 364 transition count 312
Applied a total of 216 rules in 79 ms. Remains 364 /478 variables (removed 114) and now considering 312/422 (removed 110) transitions.
// Phase 1: matrix 312 rows 364 cols
[2024-05-21 22:39:54] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 22:39:54] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 22:39:54] [INFO ] Invariant cache hit.
[2024-05-21 22:39:55] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-05-21 22:39:55] [INFO ] Redundant transitions in 2 ms returned []
Running 309 sub problems to find dead transitions.
[2024-05-21 22:39:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 2/363 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 309 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/364 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 312/676 variables, 364/422 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:40:06] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:40:06] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:40:13] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-21 22:40:13] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:40:14] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/676 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 427 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 2/363 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 1/364 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 11 (OVERLAPS) 312/676 variables, 364/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 309/736 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:40:50] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 737 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 6/6 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 364/478 places, 312/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60917 ms. Remains : 364/478 places, 312/422 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-03
Product exploration explored 100000 steps with 4659 reset in 267 ms.
Product exploration explored 100000 steps with 4709 reset in 315 ms.
Computed a total of 259 stabilizing places and 254 stable transitions
Computed a total of 259 stabilizing places and 254 stable transitions
Detected a total of 259/364 stabilizing places and 254/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 218 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, p0, (AND (NOT p2) p1 p0)]
RANDOM walk for 40000 steps (1832 resets) in 246 ms. (161 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (334 resets) in 311 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (355 resets) in 671 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (371 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (354 resets) in 263 ms. (151 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (346 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (349 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
[2024-05-21 22:40:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/82 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 207/289 variables, 24/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/292 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/295 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 309/604 variables, 295/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/604 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 72/676 variables, 69/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/676 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 422 constraints, problems are : Problem set: 0 solved, 6 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/82 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 207/289 variables, 24/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:40:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/292 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/295 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 309/604 variables, 295/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/604 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:40:58] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/604 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 72/676 variables, 69/423 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/676 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/676 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/676 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/676 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 430 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2186 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 3120ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13913 ms.
Support contains 8 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 364 transition count 311
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 364 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 362 transition count 309
Applied a total of 5 rules in 19 ms. Remains 362 /364 variables (removed 2) and now considering 309/312 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 362/364 places, 309/312 transitions.
RANDOM walk for 40000 steps (1787 resets) in 935 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (336 resets) in 304 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (348 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (338 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (334 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (354 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (316 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 646681 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 6
Probabilistic random walk after 646681 steps, saw 81870 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
// Phase 1: matrix 309 rows 362 cols
[2024-05-21 22:41:17] [INFO ] Computed 59 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 205/292 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/295 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 306/601 variables, 295/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 70/671 variables, 67/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/671 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/671 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/671 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 421 constraints, problems are : Problem set: 0 solved, 6 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 205/292 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:41:18] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:41:19] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-21 22:41:19] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/295 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:41:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:41:19] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 306/601 variables, 295/357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:41:20] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 70/671 variables, 67/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/671 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/671 variables, 5/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/671 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/671 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 433 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2543 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 3419ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 15575 ms.
Support contains 8 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 362/362 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-05-21 22:41:36] [INFO ] Invariant cache hit.
[2024-05-21 22:41:37] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 22:41:37] [INFO ] Invariant cache hit.
[2024-05-21 22:41:37] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-21 22:41:37] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-21 22:41:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 2/361 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 309/671 variables, 362/421 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-21 22:41:47] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:41:47] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:41:48] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:41:48] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 0/671 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 425 constraints, problems are : Problem set: 0 solved, 306 unsolved in 22950 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 2/361 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/362 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 309/671 variables, 362/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 306/731 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-21 22:42:28] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/671 variables, and 732 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
After SMT, in 53181ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 53184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53689 ms. Remains : 362/362 places, 309/309 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-21 22:42:30] [INFO ] Invariant cache hit.
[2024-05-21 22:42:30] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 22:42:30] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-21 22:42:30] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 22:42:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 22:42:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 22:42:31] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-21 22:42:31] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:42:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-21 22:42:31] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:42:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-21 22:42:32] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-21 22:42:32] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:42:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
TRAPS : Iteration 1
[2024-05-21 22:42:33] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:42:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 2
[2024-05-21 22:42:33] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-21 22:42:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
TRAPS : Iteration 3
[2024-05-21 22:42:35] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:42:35] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:42:35] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:42:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
TRAPS : Iteration 4
[2024-05-21 22:42:36] [INFO ] After 5652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-21 22:42:37] [INFO ] After 6470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 6622 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (OR p2 (NOT p1)) (NOT p0)))), (F p0)]
Knowledge based reduction with 15 factoid took 350 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Support contains 8 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 312/312 transitions.
Applied a total of 0 rules in 8 ms. Remains 364 /364 variables (removed 0) and now considering 312/312 (removed 0) transitions.
// Phase 1: matrix 312 rows 364 cols
[2024-05-21 22:42:37] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 22:42:38] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 22:42:38] [INFO ] Invariant cache hit.
[2024-05-21 22:42:38] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-21 22:42:38] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2024-05-21 22:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 2/363 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 309 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/364 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 312/676 variables, 364/422 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:42:49] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:42:49] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:42:56] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-21 22:42:56] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-21 22:42:57] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/676 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 427 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 2/363 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 1/364 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 11 (OVERLAPS) 312/676 variables, 364/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 309/736 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:43:34] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 737 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 6/6 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60877 ms. Remains : 364/364 places, 312/312 transitions.
Computed a total of 259 stabilizing places and 254 stable transitions
Computed a total of 259 stabilizing places and 254 stable transitions
Detected a total of 259/364 stabilizing places and 254/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 235 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, (AND (NOT p2) p1 p0)]
RANDOM walk for 40000 steps (1817 resets) in 671 ms. (59 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (350 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (354 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (361 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (359 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (363 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (345 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
[2024-05-21 22:43:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/82 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 207/289 variables, 24/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/292 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/295 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 309/604 variables, 295/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/604 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 72/676 variables, 69/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/676 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 422 constraints, problems are : Problem set: 0 solved, 6 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/82 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 207/289 variables, 24/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:43:40] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/292 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/295 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 309/604 variables, 295/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/604 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:43:41] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/604 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 72/676 variables, 69/423 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/676 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/676 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/676 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/676 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 430 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2194 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 3125ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13286 ms.
Support contains 8 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 364 transition count 311
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 364 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 362 transition count 309
Applied a total of 5 rules in 35 ms. Remains 362 /364 variables (removed 2) and now considering 309/312 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 362/364 places, 309/312 transitions.
RANDOM walk for 40000 steps (1779 resets) in 811 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (323 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (330 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (343 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (329 resets) in 212 ms. (187 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (373 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (343 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 493030 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 6
Probabilistic random walk after 493030 steps, saw 64055 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
// Phase 1: matrix 309 rows 362 cols
[2024-05-21 22:44:00] [INFO ] Computed 59 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 205/292 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/295 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 306/601 variables, 295/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 70/671 variables, 67/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/671 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/671 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/671 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 421 constraints, problems are : Problem set: 0 solved, 6 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 205/292 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:44:01] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:44:01] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-21 22:44:01] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/295 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:44:01] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:44:01] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 306/601 variables, 295/357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:44:02] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 70/671 variables, 67/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/671 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/671 variables, 5/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/671 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/671 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 433 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2539 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 3452ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17978 ms.
Support contains 8 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 362/362 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 309/309 transitions.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-05-21 22:44:21] [INFO ] Invariant cache hit.
[2024-05-21 22:44:21] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 22:44:21] [INFO ] Invariant cache hit.
[2024-05-21 22:44:22] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-21 22:44:22] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-21 22:44:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 2/361 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 309/671 variables, 362/421 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-21 22:44:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:44:32] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:44:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:44:33] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 0/671 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 425 constraints, problems are : Problem set: 0 solved, 306 unsolved in 22472 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 2/361 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/362 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 309/671 variables, 362/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 306/731 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-21 22:45:12] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/671 variables, and 732 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
After SMT, in 52704ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 52707ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53226 ms. Remains : 362/362 places, 309/309 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-21 22:45:14] [INFO ] Invariant cache hit.
[2024-05-21 22:45:14] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 22:45:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-21 22:45:14] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 22:45:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 22:45:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-21 22:45:15] [INFO ] After 766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-21 22:45:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:45:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-21 22:45:16] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:45:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-21 22:45:16] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-21 22:45:16] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-21 22:45:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
TRAPS : Iteration 1
[2024-05-21 22:45:17] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 2
[2024-05-21 22:45:17] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 3 ms to minimize.
[2024-05-21 22:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
TRAPS : Iteration 3
[2024-05-21 22:45:19] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:45:19] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:45:19] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:45:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
TRAPS : Iteration 4
[2024-05-21 22:45:20] [INFO ] After 5487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-21 22:45:21] [INFO ] After 6286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 6421 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (OR p2 (NOT p1)) (NOT p0)))), (F p0)]
Knowledge based reduction with 15 factoid took 356 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 111 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 113 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Product exploration explored 100000 steps with 4658 reset in 243 ms.
Product exploration explored 100000 steps with 4666 reset in 253 ms.
Support contains 8 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 364 /364 variables (removed 0) and now considering 312/312 (removed 0) transitions.
// Phase 1: matrix 312 rows 364 cols
[2024-05-21 22:45:22] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 22:45:22] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 22:45:22] [INFO ] Invariant cache hit.
[2024-05-21 22:45:22] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-21 22:45:22] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2024-05-21 22:45:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 2/363 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 309 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/364 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 312/676 variables, 364/422 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:45:34] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:45:34] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:45:41] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-21 22:45:41] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:45:42] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/676 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 427 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 2/363 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 1/364 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 11 (OVERLAPS) 312/676 variables, 364/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 309/736 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-05-21 22:46:18] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 737 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 6/6 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60794 ms. Remains : 364/364 places, 312/312 transitions.
Treatment of property DES-PT-60b-LTLFireability-03 finished in 388744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 471 transition count 406
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 459 transition count 406
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 459 transition count 395
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 448 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 445 transition count 392
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 445 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 445 transition count 389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 444 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 443 transition count 387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 442 transition count 386
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 442 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 442 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 63 place count 442 transition count 384
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 65 place count 441 transition count 384
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 215 place count 366 transition count 309
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 5 with 4 rules applied. Total rules applied 219 place count 364 transition count 311
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 362 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 361 transition count 309
Applied a total of 222 rules in 62 ms. Remains 361 /478 variables (removed 117) and now considering 309/422 (removed 113) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-21 22:46:23] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 22:46:23] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 22:46:23] [INFO ] Invariant cache hit.
[2024-05-21 22:46:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 22:46:23] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-05-21 22:46:23] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-21 22:46:23] [INFO ] Invariant cache hit.
[2024-05-21 22:46:23] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 1/670 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 425 constraints, problems are : Problem set: 0 solved, 306 unsolved in 28078 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 306/730 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/670 variables, and 730 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
After SMT, in 58294ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 58299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 361/478 places, 309/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58977 ms. Remains : 361/478 places, 309/422 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-04
Product exploration explored 100000 steps with 4689 reset in 262 ms.
Product exploration explored 100000 steps with 4624 reset in 275 ms.
Computed a total of 257 stabilizing places and 252 stable transitions
Computed a total of 257 stabilizing places and 252 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1870 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (381 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1334868 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 1334868 steps, saw 190387 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
[2024-05-21 22:47:26] [INFO ] Invariant cache hit.
[2024-05-21 22:47:26] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/79 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/286 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/292 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 247/539 variables, 292/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/548 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/610 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/610 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/610 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 60/670 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/79 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/286 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/292 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 247/539 variables, 292/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/548 variables, 7/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:47:27] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:47:27] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 22:47:27] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/548 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/610 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 60/670 variables, 60/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/670 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/670 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1896ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 126 ms.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 307
Applied a total of 4 rules in 29 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 360/361 places, 307/309 transitions.
RANDOM walk for 40000 steps (1787 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (336 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1364437 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 1
Probabilistic random walk after 1364437 steps, saw 188283 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
// Phase 1: matrix 307 rows 360 cols
[2024-05-21 22:47:31] [INFO ] Computed 59 invariants in 7 ms
[2024-05-21 22:47:31] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/79 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/290 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/292 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/546 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/608 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 59/667 variables, 59/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/79 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/290 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/292 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:47:32] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/546 variables, 6/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/546 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/608 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/667 variables, 59/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/667 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/667 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 7 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-21 22:47:32] [INFO ] Invariant cache hit.
[2024-05-21 22:47:33] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 22:47:33] [INFO ] Invariant cache hit.
[2024-05-21 22:47:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 22:47:33] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-21 22:47:33] [INFO ] Redundant transitions in 2 ms returned []
Running 304 sub problems to find dead transitions.
[2024-05-21 22:47:33] [INFO ] Invariant cache hit.
[2024-05-21 22:47:33] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 307/666 variables, 359/418 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 1/667 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 22:48:00] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-05-21 22:48:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/667 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 667/667 variables, and 427 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 307/666 variables, 359/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 304/730 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 22:48:27] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:48:28] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-21 22:48:28] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/667 variables, and 733 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 5/5 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60817 ms. Remains : 360/360 places, 307/307 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 360 transition count 307
Applied a total of 1 rules in 18 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-21 22:48:33] [INFO ] Computed 59 invariants in 3 ms
[2024-05-21 22:48:33] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:48:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 22:48:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-21 22:48:34] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 22:48:34] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:48:34] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:48:34] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:48:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
TRAPS : Iteration 1
[2024-05-21 22:48:34] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:48:34] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:48:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
TRAPS : Iteration 2
[2024-05-21 22:48:34] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-21 22:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
TRAPS : Iteration 3
[2024-05-21 22:48:35] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 22:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
TRAPS : Iteration 4
[2024-05-21 22:48:35] [INFO ] After 1566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:48:35] [INFO ] After 1806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1893 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 10 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-21 22:48:35] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 22:48:35] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 22:48:35] [INFO ] Invariant cache hit.
[2024-05-21 22:48:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 22:48:36] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-05-21 22:48:36] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-21 22:48:36] [INFO ] Invariant cache hit.
[2024-05-21 22:48:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 1/670 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 425 constraints, problems are : Problem set: 0 solved, 306 unsolved in 28248 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 306/730 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/670 variables, and 730 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
After SMT, in 58477ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 58480ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59021 ms. Remains : 361/361 places, 309/309 transitions.
Computed a total of 257 stabilizing places and 252 stable transitions
Computed a total of 257 stabilizing places and 252 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1881 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (393 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1313622 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :0 out of 1
Probabilistic random walk after 1313622 steps, saw 185821 distinct states, run finished after 3001 ms. (steps per millisecond=437 ) properties seen :0
[2024-05-21 22:49:38] [INFO ] Invariant cache hit.
[2024-05-21 22:49:38] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/79 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/286 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/292 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 247/539 variables, 292/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/548 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/610 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/610 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/610 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 60/670 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/79 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/286 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/292 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 247/539 variables, 292/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/548 variables, 7/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:49:39] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-21 22:49:39] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:49:39] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/548 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/610 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 60/670 variables, 60/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/670 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/670 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1907ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 307
Applied a total of 4 rules in 27 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 360/361 places, 307/309 transitions.
RANDOM walk for 40000 steps (1830 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (340 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1354874 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :0 out of 1
Probabilistic random walk after 1354874 steps, saw 186874 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
// Phase 1: matrix 307 rows 360 cols
[2024-05-21 22:49:43] [INFO ] Computed 59 invariants in 11 ms
[2024-05-21 22:49:43] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/79 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/290 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/292 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/546 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/608 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 59/667 variables, 59/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/79 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/290 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/292 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:49:44] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/546 variables, 6/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/546 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/608 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/667 variables, 59/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/667 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/667 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1425ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 7 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-21 22:49:44] [INFO ] Invariant cache hit.
[2024-05-21 22:49:44] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 22:49:44] [INFO ] Invariant cache hit.
[2024-05-21 22:49:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 22:49:45] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-21 22:49:45] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
[2024-05-21 22:49:45] [INFO ] Invariant cache hit.
[2024-05-21 22:49:45] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 307/666 variables, 359/418 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 1/667 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 22:50:12] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-05-21 22:50:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/667 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 667/667 variables, and 427 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 307/666 variables, 359/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 304/730 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 22:50:39] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:50:40] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-21 22:50:40] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/667 variables, and 733 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 5/5 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60824 ms. Remains : 360/360 places, 307/307 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 360 transition count 307
Applied a total of 1 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-21 22:50:45] [INFO ] Computed 59 invariants in 8 ms
[2024-05-21 22:50:45] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:50:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 22:50:45] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 22:50:45] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 22:50:46] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:50:46] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:50:46] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:50:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
TRAPS : Iteration 1
[2024-05-21 22:50:46] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:50:46] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:50:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
TRAPS : Iteration 2
[2024-05-21 22:50:46] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-21 22:50:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
TRAPS : Iteration 3
[2024-05-21 22:50:47] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-21 22:50:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
TRAPS : Iteration 4
[2024-05-21 22:50:47] [INFO ] After 1624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:50:47] [INFO ] After 1859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1932 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4646 reset in 252 ms.
Product exploration explored 100000 steps with 4688 reset in 562 ms.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-21 22:50:48] [INFO ] Computed 58 invariants in 8 ms
[2024-05-21 22:50:48] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 22:50:48] [INFO ] Invariant cache hit.
[2024-05-21 22:50:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 22:50:49] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2024-05-21 22:50:49] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-21 22:50:49] [INFO ] Invariant cache hit.
[2024-05-21 22:50:49] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 1/670 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 425 constraints, problems are : Problem set: 0 solved, 306 unsolved in 27504 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 306/730 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/670 variables, and 730 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
After SMT, in 57785ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 57790ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58511 ms. Remains : 361/361 places, 309/309 transitions.
Treatment of property DES-PT-60b-LTLFireability-04 finished in 323931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X((p1||G((F(p0)&&F((G(p2)||G(p0))))))))))'
Support contains 6 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 475 transition count 419
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 413
Applied a total of 14 rules in 24 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-21 22:51:47] [INFO ] Computed 62 invariants in 10 ms
[2024-05-21 22:51:47] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 22:51:47] [INFO ] Invariant cache hit.
[2024-05-21 22:51:47] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-21 22:51:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:51:58] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:51:58] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-21 22:51:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:51:59] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 22:51:59] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-21 22:51:59] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-21 22:51:59] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:51:59] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-21 22:51:59] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-21 22:52:00] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:52:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:52:00] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:52:00] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 22:52:01] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:52:16] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-21 22:52:16] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-21 22:52:16] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:52:21] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:52:21] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-21 22:52:21] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-21 22:52:24] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:52:24] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:52:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:52:24] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:52:24] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:52:24] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:52:24] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:52:25] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:52:25] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:52:25] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:52:25] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:52:28] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:52:28] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:52:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:52:29] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:52:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:52:32] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 22:52:34] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:52:36] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61028 ms. Remains : 473/478 places, 413/422 transitions.
Stuttering acceptance computed with spot in 253 ms :[false, false, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-06
Product exploration explored 100000 steps with 861 reset in 196 ms.
Product exploration explored 100000 steps with 881 reset in 207 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Detected a total of 296/473 stabilizing places and 288/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 211 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (350 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (63 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (56 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (63 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (63 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (65 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 422758 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 6
Probabilistic random walk after 422758 steps, saw 74742 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-21 22:52:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 151/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 289/454 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/458 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 400/858 variables, 458/520 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 18/876 variables, 10/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/876 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 13 (OVERLAPS) 6/882 variables, 3/533 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/882 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/884 variables, 1/534 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/884 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/886 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/886 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/886 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 886/886 variables, and 535 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 151/165 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 289/454 variables, 27/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 4/458 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 400/858 variables, 458/520 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 5/525 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 22:52:55] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/858 variables, 1/526 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/858 variables, 0/526 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 18/876 variables, 10/536 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/876 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/882 variables, 3/539 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 22:52:56] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/882 variables, 1/540 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 22:52:56] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/882 variables, 1/541 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/882 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/884 variables, 1/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/884 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/886 variables, 1/543 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/886 variables, 0/543 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/886 variables, 0/543 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 886/886 variables, and 543 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 6739ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1204 ms.
Support contains 4 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 467 transition count 392
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 451 transition count 392
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 451 transition count 381
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 440 transition count 381
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 209 place count 364 transition count 305
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 2 with 4 rules applied. Total rules applied 213 place count 362 transition count 307
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 362 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 361 transition count 306
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 361 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 360 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 359 transition count 305
Applied a total of 218 rules in 53 ms. Remains 359 /473 variables (removed 114) and now considering 305/413 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 359/473 places, 305/413 transitions.
RANDOM walk for 40000 steps (1719 resets) in 713 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (344 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (336 resets) in 329 ms. (121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (319 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (360 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (354 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 554028 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 5
Probabilistic random walk after 554028 steps, saw 77552 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
// Phase 1: matrix 305 rows 359 cols
[2024-05-21 22:53:04] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 22:53:04] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 210/226 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 33/259 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 25/284 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 7/291 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 243/534 variables, 291/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 9/543 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 62/605 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/605 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/605 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 59/664 variables, 59/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/664 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/664 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 425 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1467 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/359 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 210/226 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 33/259 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:53:06] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 25/284 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 7/291 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 243/534 variables, 291/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:53:06] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 9/543 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:53:07] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 62/605 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/605 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/605 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 59/664 variables, 59/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/664 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 0/664 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 433 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3803 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/359 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 5294ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 11766 ms.
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 305/305 transitions.
Applied a total of 0 rules in 6 ms. Remains 359 /359 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 359/359 places, 305/305 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 359 /359 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-05-21 22:53:21] [INFO ] Invariant cache hit.
[2024-05-21 22:53:21] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 22:53:21] [INFO ] Invariant cache hit.
[2024-05-21 22:53:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 22:53:21] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-21 22:53:21] [INFO ] Redundant transitions in 1 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-21 22:53:21] [INFO ] Invariant cache hit.
[2024-05-21 22:53:21] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 1/358 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 305/663 variables, 358/418 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-21 22:53:35] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 22:53:36] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:53:36] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 1/664 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 428 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/359 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 1/357 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/358 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 305/663 variables, 358/421 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 6/427 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 302/729 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-21 22:54:09] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-05-21 22:54:09] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:54:10] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:54:14] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 733 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/359 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 7/7 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60818 ms. Remains : 359/359 places, 305/305 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 359 transition count 305
Applied a total of 1 rules in 9 ms. Remains 359 /359 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 305 rows 359 cols
[2024-05-21 22:54:22] [INFO ] Computed 60 invariants in 8 ms
[2024-05-21 22:54:22] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 22:54:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 22:54:22] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 22:54:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 22:54:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-21 22:54:22] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-21 22:54:22] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-05-21 22:54:23] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-21 22:54:23] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:54:23] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:54:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 394 ms
TRAPS : Iteration 1
[2024-05-21 22:54:23] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:54:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-21 22:54:23] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:54:23] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:54:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
TRAPS : Iteration 2
[2024-05-21 22:54:24] [INFO ] After 1601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-21 22:54:24] [INFO ] After 1951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 2091 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 231 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 473 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 466 transition count 395
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 452 transition count 395
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 452 transition count 384
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 441 transition count 384
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 199 place count 367 transition count 310
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 2 with 4 rules applied. Total rules applied 203 place count 365 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 363 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 362 transition count 310
Applied a total of 206 rules in 29 ms. Remains 362 /473 variables (removed 111) and now considering 310/413 (removed 103) transitions.
// Phase 1: matrix 310 rows 362 cols
[2024-05-21 22:54:24] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 22:54:24] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 22:54:24] [INFO ] Invariant cache hit.
[2024-05-21 22:54:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 22:54:25] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-05-21 22:54:25] [INFO ] Redundant transitions in 2 ms returned []
Running 307 sub problems to find dead transitions.
[2024-05-21 22:54:25] [INFO ] Invariant cache hit.
[2024-05-21 22:54:25] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 2/361 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 1/362 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 310/672 variables, 362/420 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 22:54:37] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:54:40] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 22:54:48] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/672 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 22:54:54] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/672 variables, and 430 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 362/362 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 2/361 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 310/672 variables, 362/424 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 307/737 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 737 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 362/362 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 4/4 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in SI_LTL mode, iteration 1 : 362/473 places, 310/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60824 ms. Remains : 362/473 places, 310/413 transitions.
Computed a total of 258 stabilizing places and 253 stable transitions
Computed a total of 258 stabilizing places and 253 stable transitions
Detected a total of 258/362 stabilizing places and 253/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1856 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (378 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1396070 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1396070 steps, saw 187282 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-05-21 22:55:28] [INFO ] Invariant cache hit.
[2024-05-21 22:55:28] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 213/219 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/257 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/261 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/290 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/297 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 310/607 variables, 297/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/607 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/607 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 65/672 variables, 65/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/672 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/672 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 426 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 362/362 constraints, ReadFeed: 6/6 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/219 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/257 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/261 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/290 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/297 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 310/607 variables, 297/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/607 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/607 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 65/672 variables, 65/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/672 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/672 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 672/672 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 362/362 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 493 ms.
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 310/310 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 362 transition count 309
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 5 place count 360 transition count 307
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 360 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 359 transition count 306
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 359 transition count 306
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 357 transition count 304
Applied a total of 10 rules in 25 ms. Remains 357 /362 variables (removed 5) and now considering 304/310 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 357/362 places, 304/310 transitions.
RANDOM walk for 40000 steps (2098 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (372 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1363342 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 1
Probabilistic random walk after 1363342 steps, saw 205692 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
// Phase 1: matrix 304 rows 357 cols
[2024-05-21 22:55:32] [INFO ] Computed 59 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 212/218 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/253 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/278 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/285 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:55:33] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/538 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 64/602 variables, 5/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/602 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 59/661 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/661 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/661 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 212/218 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/253 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/278 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/285 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 239/524 variables, 285/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/538 variables, 8/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 64/602 variables, 5/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/602 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/602 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/661 variables, 59/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/661 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/661 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 357/357 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 6 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-21 22:55:33] [INFO ] Invariant cache hit.
[2024-05-21 22:55:33] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 22:55:33] [INFO ] Invariant cache hit.
[2024-05-21 22:55:34] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-21 22:55:34] [INFO ] Redundant transitions in 2 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-21 22:55:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 301 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/356 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 304/660 variables, 356/415 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 22:55:41] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:55:41] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:55:43] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 22:55:45] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:55:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 1/661 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (OVERLAPS) 0/661 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 421 constraints, problems are : Problem set: 0 solved, 301 unsolved in 26262 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 2/356 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 304/660 variables, 356/420 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 301/721 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/661 variables, and 721 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/357 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 5/5 constraints]
After SMT, in 56486ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 56490ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57043 ms. Remains : 357/357 places, 304/304 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 357 transition count 304
Applied a total of 1 rules in 12 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-21 22:56:30] [INFO ] Computed 59 invariants in 7 ms
[2024-05-21 22:56:30] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 22:56:30] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 22:56:30] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:56:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 22:56:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 22:56:30] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 22:56:30] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:56:30] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 349 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4636 reset in 217 ms.
Product exploration explored 100000 steps with 4628 reset in 237 ms.
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 310/310 transitions.
Reduce places removed 2 places and 2 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 358 transition count 306
Applied a total of 4 rules in 11 ms. Remains 358 /362 variables (removed 4) and now considering 306/310 (removed 4) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-21 22:56:31] [INFO ] Computed 58 invariants in 8 ms
[2024-05-21 22:56:31] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-21 22:56:31] [INFO ] Invariant cache hit.
[2024-05-21 22:56:32] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-21 22:56:32] [INFO ] Redundant transitions in 2 ms returned []
Running 303 sub problems to find dead transitions.
[2024-05-21 22:56:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 2/357 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 306/663 variables, 357/415 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 22:56:40] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 22:56:47] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 1/664 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 419 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 2/357 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 306/663 variables, 357/418 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 303/721 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 721 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 3/3 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in SI_LTL mode, iteration 1 : 358/362 places, 306/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60834 ms. Remains : 358/362 places, 306/310 transitions.
Treatment of property DES-PT-60b-LTLFireability-06 finished in 345441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((X(G(p2))&&p1)))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 477 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 477 transition count 420
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 476 transition count 419
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 476 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 476 transition count 418
Applied a total of 6 rules in 24 ms. Remains 476 /478 variables (removed 2) and now considering 418/422 (removed 4) transitions.
// Phase 1: matrix 418 rows 476 cols
[2024-05-21 22:57:32] [INFO ] Computed 62 invariants in 10 ms
[2024-05-21 22:57:32] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 22:57:32] [INFO ] Invariant cache hit.
[2024-05-21 22:57:33] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-05-21 22:57:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 417 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 418/894 variables, 476/538 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:57:42] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-21 22:57:42] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-21 22:57:43] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:57:43] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-05-21 22:57:43] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-21 22:57:44] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-21 22:57:44] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-21 22:57:44] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-05-21 22:57:44] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:57:45] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:57:45] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:57:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:57:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/894 variables, 17/555 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-21 22:57:56] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-21 22:57:56] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/894 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/894 variables, and 557 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-21 22:58:07] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:58:07] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:58:07] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:58:07] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:58:07] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:58:07] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:58:08] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:58:08] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:58:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:58:08] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:58:08] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:58:09] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:58:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:58:09] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:58:09] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:58:09] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:58:11] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:58:11] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:58:12] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 19/100 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-21 22:58:12] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:58:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:58:13] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:58:13] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:58:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:58:13] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:58:13] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-21 22:58:16] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-21 22:58:21] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-21 22:58:21] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-21 22:58:21] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:58:22] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:58:22] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:58:22] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 10 (OVERLAPS) 418/894 variables, 476/590 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/894 variables, 417/1007 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 894/894 variables, and 1007 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 52/52 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in LTL mode, iteration 1 : 476/478 places, 418/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61110 ms. Remains : 476/478 places, 418/422 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-60b-LTLFireability-07
Stuttering criterion allowed to conclude after 350 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-07 finished in 61352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 471 transition count 405
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 458 transition count 405
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 458 transition count 393
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 221 place count 363 transition count 306
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 5 with 4 rules applied. Total rules applied 225 place count 361 transition count 308
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 359 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 358 transition count 306
Applied a total of 228 rules in 57 ms. Remains 358 /478 variables (removed 120) and now considering 306/422 (removed 116) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-21 22:58:34] [INFO ] Computed 58 invariants in 8 ms
[2024-05-21 22:58:34] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 22:58:34] [INFO ] Invariant cache hit.
[2024-05-21 22:58:34] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-21 22:58:34] [INFO ] Redundant transitions in 1 ms returned []
Running 303 sub problems to find dead transitions.
[2024-05-21 22:58:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 303 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/357 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 306/663 variables, 357/415 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 22:58:45] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 22:58:50] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 22:58:53] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-21 22:58:53] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 22:58:57] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 14 (OVERLAPS) 1/664 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 421 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/357 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 306/663 variables, 357/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 303/723 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 723 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 5/5 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 358/478 places, 306/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60896 ms. Remains : 358/478 places, 306/422 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-08
Product exploration explored 100000 steps with 5099 reset in 219 ms.
Product exploration explored 100000 steps with 5171 reset in 228 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/358 stabilizing places and 250/306 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2065 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (421 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1383962 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1383962 steps, saw 191171 distinct states, run finished after 3003 ms. (steps per millisecond=460 ) properties seen :0
[2024-05-21 22:59:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/274 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/279 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/285 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 241/526 variables, 285/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/540 variables, 9/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/604 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/604 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/604 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/664 variables, 60/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/664 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/664 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/274 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/279 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/285 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 241/526 variables, 285/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/540 variables, 9/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 64/604 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/604 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/604 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 60/664 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/664 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/664 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 739ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 523 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 306/306 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 358 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 358 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 357 transition count 304
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 357 transition count 304
Applied a total of 4 rules in 15 ms. Remains 357 /358 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 357/358 places, 304/306 transitions.
RANDOM walk for 40000 steps (2015 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (354 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1383856 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1383856 steps, saw 191116 distinct states, run finished after 3003 ms. (steps per millisecond=460 ) properties seen :0
// Phase 1: matrix 304 rows 357 cols
[2024-05-21 22:59:42] [INFO ] Computed 59 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/274 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/283 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/538 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/602 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/602 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 59/661 variables, 59/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/661 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/661 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/274 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/283 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/538 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 64/602 variables, 5/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/602 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 59/661 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/661 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/661 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 525 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 357/357 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 6 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-21 22:59:44] [INFO ] Invariant cache hit.
[2024-05-21 22:59:44] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 22:59:44] [INFO ] Invariant cache hit.
[2024-05-21 22:59:44] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-21 22:59:44] [INFO ] Redundant transitions in 1 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-21 22:59:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 301 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/356 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 304/660 variables, 356/415 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 22:59:55] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:59:56] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:59:56] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 3 ms to minimize.
[2024-05-21 22:59:56] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:59:56] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:59:56] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (OVERLAPS) 1/661 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:00:02] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:00:05] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:00:05] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:00:07] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:00:08] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:00:08] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/661 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/661 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 428 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 1/355 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/356 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (OVERLAPS) 304/660 variables, 356/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/660 variables, 301/728 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/661 variables, and 728 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/357 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60816 ms. Remains : 357/357 places, 304/304 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 357 transition count 304
Applied a total of 1 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-21 23:00:44] [INFO ] Computed 59 invariants in 8 ms
[2024-05-21 23:00:44] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:00:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:00:45] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 23:00:45] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:00:45] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:00:45] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 346 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 358/358 places, 306/306 transitions.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 306/306 (removed 0) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-21 23:00:45] [INFO ] Computed 58 invariants in 10 ms
[2024-05-21 23:00:45] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-21 23:00:45] [INFO ] Invariant cache hit.
[2024-05-21 23:00:46] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2024-05-21 23:00:46] [INFO ] Redundant transitions in 1 ms returned []
Running 303 sub problems to find dead transitions.
[2024-05-21 23:00:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 303 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/357 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 306/663 variables, 357/415 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 23:00:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 23:01:02] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 23:01:05] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:01:05] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 23:01:09] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 14 (OVERLAPS) 1/664 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 421 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/357 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 306/663 variables, 357/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 303/723 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 723 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 5/5 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61283 ms. Remains : 358/358 places, 306/306 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/358 stabilizing places and 250/306 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2064 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (397 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1370970 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :0 out of 1
Probabilistic random walk after 1370970 steps, saw 189256 distinct states, run finished after 3001 ms. (steps per millisecond=456 ) properties seen :0
[2024-05-21 23:01:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/274 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/279 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/285 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 241/526 variables, 285/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/540 variables, 9/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/604 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/604 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/604 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/664 variables, 60/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/664 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/664 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/274 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/279 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/285 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 241/526 variables, 285/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/540 variables, 9/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 64/604 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/604 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/604 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 60/664 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/664 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/664 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 752ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 539 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 306/306 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 358 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 358 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 357 transition count 304
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 357 transition count 304
Applied a total of 4 rules in 17 ms. Remains 357 /358 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 357/358 places, 304/306 transitions.
RANDOM walk for 40000 steps (1992 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (372 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1374364 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :0 out of 1
Probabilistic random walk after 1374364 steps, saw 189753 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
// Phase 1: matrix 304 rows 357 cols
[2024-05-21 23:01:54] [INFO ] Computed 59 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/274 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/283 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/538 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/602 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/602 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 59/661 variables, 59/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/661 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/661 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/274 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/283 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/538 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 64/602 variables, 5/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/602 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 59/661 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/661 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/661 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 625ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 596 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 357/357 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-21 23:01:55] [INFO ] Invariant cache hit.
[2024-05-21 23:01:55] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:01:55] [INFO ] Invariant cache hit.
[2024-05-21 23:01:56] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-21 23:01:56] [INFO ] Redundant transitions in 1 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-21 23:01:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 301 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/356 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 304/660 variables, 356/415 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:02:07] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:02:07] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:02:07] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:02:07] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:02:07] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:02:08] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (OVERLAPS) 1/661 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:02:14] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:02:17] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:02:17] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:02:19] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:02:19] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:02:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/661 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/661 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 428 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 1/355 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/356 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (OVERLAPS) 304/660 variables, 356/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/660 variables, 301/728 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/661 variables, and 728 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/357 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60833 ms. Remains : 357/357 places, 304/304 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 357 transition count 304
Applied a total of 1 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 357 cols
[2024-05-21 23:02:56] [INFO ] Computed 59 invariants in 6 ms
[2024-05-21 23:02:56] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:02:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:02:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 23:02:56] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:02:56] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:02:56] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 327 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5156 reset in 202 ms.
Product exploration explored 100000 steps with 5177 reset in 225 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 358/358 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 306/306 (removed 0) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-21 23:02:57] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 23:02:57] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:02:57] [INFO ] Invariant cache hit.
[2024-05-21 23:02:57] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-21 23:02:57] [INFO ] Redundant transitions in 1 ms returned []
Running 303 sub problems to find dead transitions.
[2024-05-21 23:02:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 303 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/357 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 306/663 variables, 357/415 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 23:03:08] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 23:03:13] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 23:03:16] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:03:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 23:03:20] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 14 (OVERLAPS) 1/664 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 421 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/357 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 306/663 variables, 357/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 303/723 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 723 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 5/5 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60793 ms. Remains : 358/358 places, 306/306 transitions.
Treatment of property DES-PT-60b-LTLFireability-08 finished in 324140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 471 transition count 407
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 460 transition count 407
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 23 place count 460 transition count 396
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 45 place count 449 transition count 396
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 446 transition count 393
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 446 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 446 transition count 390
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 445 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 56 place count 445 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 444 transition count 388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 443 transition count 387
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 443 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 443 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 442 transition count 385
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 215 place count 366 transition count 309
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 6 with 4 rules applied. Total rules applied 219 place count 364 transition count 311
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 362 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 222 place count 361 transition count 309
Applied a total of 222 rules in 51 ms. Remains 361 /478 variables (removed 117) and now considering 309/422 (removed 113) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-21 23:03:58] [INFO ] Computed 58 invariants in 10 ms
[2024-05-21 23:03:58] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 23:03:58] [INFO ] Invariant cache hit.
[2024-05-21 23:03:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:03:58] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-21 23:03:58] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-21 23:03:58] [INFO ] Invariant cache hit.
[2024-05-21 23:03:58] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 1/359 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 1/360 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-21 23:04:12] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:04:12] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:04:12] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:04:13] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:04:14] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 5/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 1/670 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/670 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 13 (OVERLAPS) 0/670 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 430 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 1/359 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 1/360 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 309/669 variables, 360/423 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 306/735 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/670 variables, and 735 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 361/478 places, 309/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60841 ms. Remains : 361/478 places, 309/422 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-09
Product exploration explored 100000 steps with 4836 reset in 209 ms.
Product exploration explored 100000 steps with 4730 reset in 216 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1882 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (397 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1380512 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :0 out of 1
Probabilistic random walk after 1380512 steps, saw 190261 distinct states, run finished after 3001 ms. (steps per millisecond=460 ) properties seen :0
[2024-05-21 23:05:02] [INFO ] Invariant cache hit.
[2024-05-21 23:05:02] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/210 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/248 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/285 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/294 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 248/542 variables, 294/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 6/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/548 variables, 5/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/548 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/610 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/610 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/670 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/210 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/248 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/285 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/294 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 248/542 variables, 294/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 6/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/548 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/610 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 60/670 variables, 60/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/670 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/670 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 426 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 685ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 307
Applied a total of 4 rules in 15 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 360/361 places, 307/309 transitions.
RANDOM walk for 40000 steps (1892 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (375 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1394259 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :0 out of 1
Probabilistic random walk after 1394259 steps, saw 191987 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
// Phase 1: matrix 307 rows 360 cols
[2024-05-21 23:05:06] [INFO ] Computed 59 invariants in 7 ms
[2024-05-21 23:05:06] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/210 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/252 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/285 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/294 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 246/540 variables, 294/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/546 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/608 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/667 variables, 59/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/210 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/252 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/285 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/294 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 246/540 variables, 294/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/546 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/608 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/667 variables, 59/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/667 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/667 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 426 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 547ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 151 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-21 23:05:07] [INFO ] Invariant cache hit.
[2024-05-21 23:05:07] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 23:05:07] [INFO ] Invariant cache hit.
[2024-05-21 23:05:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:05:07] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-05-21 23:05:07] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
[2024-05-21 23:05:07] [INFO ] Invariant cache hit.
[2024-05-21 23:05:07] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 304 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 307/666 variables, 359/418 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:05:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:05:26] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:05:30] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:05:30] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 13 (OVERLAPS) 1/667 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 667/667 variables, and 429 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 1/358 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 1/359 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 307/666 variables, 359/422 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 6/428 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 304/732 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:06:02] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:06:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:06:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/667 variables, and 735 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60770 ms. Remains : 360/360 places, 307/307 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 360 transition count 307
Applied a total of 1 rules in 10 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-21 23:06:08] [INFO ] Computed 59 invariants in 4 ms
[2024-05-21 23:06:08] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:06:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:06:08] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 23:06:08] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:06:08] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:06:08] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 345 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-21 23:06:08] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 23:06:08] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 23:06:08] [INFO ] Invariant cache hit.
[2024-05-21 23:06:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:06:09] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-05-21 23:06:09] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-21 23:06:09] [INFO ] Invariant cache hit.
[2024-05-21 23:06:09] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 1/359 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 1/360 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-21 23:06:22] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:06:23] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:06:23] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:06:24] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:06:24] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 5/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 1/670 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/670 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 13 (OVERLAPS) 0/670 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 430 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 1/359 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 1/360 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 309/669 variables, 360/423 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 306/735 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/670 variables, and 735 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60830 ms. Remains : 361/361 places, 309/309 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1892 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (376 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1396765 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1396765 steps, saw 192451 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-05-21 23:07:12] [INFO ] Invariant cache hit.
[2024-05-21 23:07:12] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/210 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/248 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/285 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/294 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 248/542 variables, 294/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 6/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/548 variables, 5/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/548 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/610 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/610 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/670 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/670 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/210 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/248 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/285 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/294 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 248/542 variables, 294/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 6/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/548 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/610 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 60/670 variables, 60/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/670 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/670 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 426 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 166 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 307
Applied a total of 4 rules in 24 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 360/361 places, 307/309 transitions.
RANDOM walk for 40000 steps (1863 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (365 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1396702 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1396702 steps, saw 192380 distinct states, run finished after 3003 ms. (steps per millisecond=465 ) properties seen :0
// Phase 1: matrix 307 rows 360 cols
[2024-05-21 23:07:16] [INFO ] Computed 59 invariants in 10 ms
[2024-05-21 23:07:16] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/210 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/252 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/285 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/294 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 246/540 variables, 294/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/546 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/608 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/667 variables, 59/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/667 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/210 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/252 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/285 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/294 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 246/540 variables, 294/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/546 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/608 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/667 variables, 59/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/667 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/667 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 426 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 572ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-21 23:07:17] [INFO ] Invariant cache hit.
[2024-05-21 23:07:17] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 23:07:17] [INFO ] Invariant cache hit.
[2024-05-21 23:07:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:07:17] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-21 23:07:17] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
[2024-05-21 23:07:17] [INFO ] Invariant cache hit.
[2024-05-21 23:07:17] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 304 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 307/666 variables, 359/418 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:07:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:07:35] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:07:40] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:07:40] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 13 (OVERLAPS) 1/667 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 667/667 variables, and 429 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 1/358 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 1/359 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 307/666 variables, 359/422 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 6/428 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 304/732 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:08:12] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:08:12] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:08:12] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/667 variables, and 735 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/360 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60779 ms. Remains : 360/360 places, 307/307 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 360 transition count 307
Applied a total of 1 rules in 9 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2024-05-21 23:08:18] [INFO ] Computed 59 invariants in 6 ms
[2024-05-21 23:08:18] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:08:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:08:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 23:08:18] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:08:18] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:18] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 343 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4769 reset in 190 ms.
Product exploration explored 100000 steps with 4721 reset in 220 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-05-21 23:08:19] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 23:08:19] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-21 23:08:19] [INFO ] Invariant cache hit.
[2024-05-21 23:08:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:08:19] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-05-21 23:08:19] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-21 23:08:19] [INFO ] Invariant cache hit.
[2024-05-21 23:08:19] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 1/359 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 1/360 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 309/669 variables, 360/418 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-21 23:08:33] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:08:33] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:08:33] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:08:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:08:35] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 5/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 1/670 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/670 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 13 (OVERLAPS) 0/670 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 430 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 1/359 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 1/360 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 309/669 variables, 360/423 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 306/735 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/670 variables, and 735 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60793 ms. Remains : 361/361 places, 309/309 transitions.
Treatment of property DES-PT-60b-LTLFireability-09 finished in 321911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 471 transition count 404
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 457 transition count 404
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 393
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 221 place count 363 transition count 306
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 5 with 4 rules applied. Total rules applied 225 place count 361 transition count 308
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 359 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 358 transition count 306
Applied a total of 228 rules in 48 ms. Remains 358 /478 variables (removed 120) and now considering 306/422 (removed 116) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-05-21 23:09:20] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:09:20] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 23:09:20] [INFO ] Invariant cache hit.
[2024-05-21 23:09:20] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-21 23:09:20] [INFO ] Redundant transitions in 1 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-21 23:09:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 2/357 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 306/663 variables, 357/415 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-21 23:09:33] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:09:33] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (OVERLAPS) 1/664 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 12 (OVERLAPS) 0/664 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 418 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 1/355 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 2/357 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 306/663 variables, 357/417 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 302/719 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 719 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 2/2 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Starting structural reductions in SI_LTL mode, iteration 1 : 358/478 places, 306/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60822 ms. Remains : 358/478 places, 306/422 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-10
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-10 finished in 60901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 475 transition count 419
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 413
Applied a total of 14 rules in 19 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-21 23:10:20] [INFO ] Computed 62 invariants in 7 ms
[2024-05-21 23:10:21] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 23:10:21] [INFO ] Invariant cache hit.
[2024-05-21 23:10:21] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-21 23:10:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:10:32] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:10:32] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:10:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:10:33] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:10:33] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:10:33] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:10:33] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:10:33] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:10:33] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2024-05-21 23:10:33] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:10:34] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:10:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:10:34] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:10:35] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:10:49] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:10:49] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:10:49] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:10:51] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 553 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:10:55] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:10:55] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:10:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:10:55] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:10:55] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:10:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:10:56] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:10:57] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:10:57] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:10:59] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:10:59] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:10:59] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:10:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:11:02] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (OVERLAPS) 413/886 variables, 473/576 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 412/988 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 988 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 41/41 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61057 ms. Remains : 473/478 places, 413/422 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-12
Product exploration explored 100000 steps with 878 reset in 185 ms.
Product exploration explored 100000 steps with 882 reset in 193 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Detected a total of 296/473 stabilizing places and 288/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (351 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1251683 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 1
Probabilistic random walk after 1251683 steps, saw 201735 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
[2024-05-21 23:11:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/163 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 288/451 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/458 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 400/858 variables, 458/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/876 variables, 10/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/876 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/882 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/882 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/884 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/884 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/886 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/886 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/886 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 886/886 variables, and 535 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/163 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 288/451 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/458 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 400/858 variables, 458/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/858 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/876 variables, 10/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:11:26] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:11:26] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:11:26] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/876 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/876 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/882 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:11:27] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/882 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/882 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/884 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/884 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/886 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/886 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/886 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 886/886 variables, and 540 constraints, problems are : Problem set: 0 solved, 1 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1359ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 188 ms.
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 467 transition count 391
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 450 transition count 391
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 450 transition count 379
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 438 transition count 379
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 211 place count 363 transition count 304
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 2 with 4 rules applied. Total rules applied 215 place count 361 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 361 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 360 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 359 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 358 transition count 304
Applied a total of 219 rules in 45 ms. Remains 358 /473 variables (removed 115) and now considering 304/413 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 358/473 places, 304/413 transitions.
RANDOM walk for 40000 steps (1788 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (323 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1505275 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :0 out of 1
Probabilistic random walk after 1505275 steps, saw 203710 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) properties seen :0
// Phase 1: matrix 304 rows 358 cols
[2024-05-21 23:11:30] [INFO ] Computed 60 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/216 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/254 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/286 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/295 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/599 variables, 295/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/662 variables, 63/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/216 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/254 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/286 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/295 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/599 variables, 295/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/662 variables, 63/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/662 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/662 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/662 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 662/662 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 4 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 358/358 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-21 23:11:31] [INFO ] Invariant cache hit.
[2024-05-21 23:11:31] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 23:11:31] [INFO ] Invariant cache hit.
[2024-05-21 23:11:31] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-21 23:11:31] [INFO ] Redundant transitions in 1 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-21 23:11:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 2/358 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 301 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 304/662 variables, 358/418 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:11:42] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:11:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:11:46] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:11:46] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:11:49] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (OVERLAPS) 0/662 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 423 constraints, problems are : Problem set: 0 solved, 301 unsolved in 26722 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 2/358 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 304/662 variables, 358/423 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 301/724 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 724 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 5/5 constraints]
After SMT, in 56943ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 56946ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57481 ms. Remains : 358/358 places, 304/304 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 23:12:28] [INFO ] Invariant cache hit.
[2024-05-21 23:12:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 23:12:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-21 23:12:28] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:12:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:12:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-21 23:12:28] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:12:28] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:12:28] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 330 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Applied a total of 0 rules in 10 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-21 23:12:29] [INFO ] Computed 62 invariants in 11 ms
[2024-05-21 23:12:29] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-21 23:12:29] [INFO ] Invariant cache hit.
[2024-05-21 23:12:30] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-21 23:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:12:40] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:12:40] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:12:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:12:41] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:12:41] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:12:41] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:12:41] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:12:41] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:12:41] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:12:41] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:12:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:12:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:12:42] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:12:43] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:12:57] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:12:57] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:12:57] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:12:59] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 553 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:13:04] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:13:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:13:08] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:13:08] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:13:08] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:13:08] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:13:11] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (OVERLAPS) 413/886 variables, 473/576 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 412/988 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 988 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 41/41 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Finished structural reductions in LTL mode , in 1 iterations and 61103 ms. Remains : 473/473 places, 413/413 transitions.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Detected a total of 296/473 stabilizing places and 288/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (344 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1309384 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 1309384 steps, saw 210417 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
[2024-05-21 23:13:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/163 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 288/451 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/458 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 400/858 variables, 458/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/876 variables, 10/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/876 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/882 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/882 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/884 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/884 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/886 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/886 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/886 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 886/886 variables, and 535 constraints, problems are : Problem set: 0 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/163 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 288/451 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/458 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 400/858 variables, 458/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/858 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/876 variables, 10/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:13:34] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:13:34] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:13:34] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/876 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/876 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/882 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:13:34] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/882 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/882 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/884 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/884 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/886 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/886 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/886 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 886/886 variables, and 540 constraints, problems are : Problem set: 0 solved, 1 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1352ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 184 ms.
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 467 transition count 391
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 450 transition count 391
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 450 transition count 379
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 438 transition count 379
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 211 place count 363 transition count 304
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 2 with 4 rules applied. Total rules applied 215 place count 361 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 361 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 360 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 359 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 358 transition count 304
Applied a total of 219 rules in 29 ms. Remains 358 /473 variables (removed 115) and now considering 304/413 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 358/473 places, 304/413 transitions.
RANDOM walk for 40000 steps (1799 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (329 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1586507 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :0 out of 1
Probabilistic random walk after 1586507 steps, saw 214988 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
// Phase 1: matrix 304 rows 358 cols
[2024-05-21 23:13:38] [INFO ] Computed 60 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/216 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/254 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/286 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/295 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/599 variables, 295/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/662 variables, 63/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/216 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/254 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/286 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/295 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/599 variables, 295/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/662 variables, 63/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/662 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/662 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/662 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 662/662 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 358/358 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-21 23:13:38] [INFO ] Invariant cache hit.
[2024-05-21 23:13:39] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 23:13:39] [INFO ] Invariant cache hit.
[2024-05-21 23:13:39] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-21 23:13:39] [INFO ] Redundant transitions in 2 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-21 23:13:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 2/358 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 301 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 304/662 variables, 358/418 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:13:50] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:13:51] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:13:54] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:13:54] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:13:56] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (OVERLAPS) 0/662 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 423 constraints, problems are : Problem set: 0 solved, 301 unsolved in 26330 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 2/358 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 304/662 variables, 358/423 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 301/724 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 23:14:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 725 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 6/6 constraints]
After SMT, in 56551ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 56555ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57074 ms. Remains : 358/358 places, 304/304 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 23:14:36] [INFO ] Invariant cache hit.
[2024-05-21 23:14:36] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:14:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 23:14:36] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:14:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:14:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-21 23:14:36] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:14:36] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:14:36] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 329 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 883 reset in 160 ms.
Product exploration explored 100000 steps with 876 reset in 171 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 467 transition count 410
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 467 transition count 412
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 467 transition count 412
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 462 transition count 407
Deduced a syphon composed of 18 places in 3 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 462 transition count 407
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 462 transition count 410
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 452 transition count 400
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 452 transition count 400
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 452 transition count 428
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 450 transition count 422
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 450 transition count 422
Deduced a syphon composed of 88 places in 1 ms
Applied a total of 140 rules in 48 ms. Remains 450 /473 variables (removed 23) and now considering 422/413 (removed -9) transitions.
[2024-05-21 23:14:37] [INFO ] Redundant transitions in 2 ms returned []
Running 421 sub problems to find dead transitions.
// Phase 1: matrix 422 rows 450 cols
[2024-05-21 23:14:37] [INFO ] Computed 59 invariants in 7 ms
[2024-05-21 23:14:37] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/450 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 5 (OVERLAPS) 422/872 variables, 450/509 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/872 variables, 16/525 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/872 variables, 0/525 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 0/872 variables, 0/525 constraints. Problems are: Problem set: 113 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 525 constraints, problems are : Problem set: 113 solved, 308 unsolved in 23647 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 450/450 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 113 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 13/13 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 67/428 variables, 32/45 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/45 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 15/443 variables, 14/59 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/59 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 418/861 variables, 443/502 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/861 variables, 16/518 constraints. Problems are: Problem set: 113 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 308/826 constraints. Problems are: Problem set: 113 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 861/872 variables, and 826 constraints, problems are : Problem set: 113 solved, 308 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 443/450 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 308/421 constraints, Known Traps: 0/0 constraints]
After SMT, in 53911ms problems are : Problem set: 113 solved, 308 unsolved
Search for dead transitions found 113 dead transitions in 53915ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 450/473 places, 309/413 transitions.
Graph (complete) has 1254 edges and 450 vertex of which 362 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.1 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 362 /450 variables (removed 88) and now considering 309/309 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 362/473 places, 309/413 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53978 ms. Remains : 362/473 places, 309/413 transitions.
Support contains 2 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 413/413 transitions.
Applied a total of 0 rules in 5 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-21 23:15:31] [INFO ] Computed 62 invariants in 14 ms
[2024-05-21 23:15:31] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 23:15:31] [INFO ] Invariant cache hit.
[2024-05-21 23:15:32] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-21 23:15:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:15:42] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:15:42] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:15:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:15:42] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:15:43] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:15:43] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:15:43] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:15:43] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:15:43] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:15:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:15:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:15:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:15:44] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:15:45] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:15:58] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:15:59] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:15:59] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:16:01] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 553 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:16:05] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:16:06] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:16:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:16:07] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:16:07] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:16:07] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:16:07] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:16:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:16:07] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:16:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:16:10] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:16:10] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-21 23:16:10] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:16:10] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:16:13] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (OVERLAPS) 413/886 variables, 473/576 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 412/988 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 988 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 41/41 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Finished structural reductions in LTL mode , in 1 iterations and 61044 ms. Remains : 473/473 places, 413/413 transitions.
Treatment of property DES-PT-60b-LTLFireability-12 finished in 371436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 3 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 471 transition count 404
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 457 transition count 404
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 393
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 217 place count 365 transition count 308
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 5 with 4 rules applied. Total rules applied 221 place count 363 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 361 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 360 transition count 308
Applied a total of 224 rules in 61 ms. Remains 360 /478 variables (removed 118) and now considering 308/422 (removed 114) transitions.
// Phase 1: matrix 308 rows 360 cols
[2024-05-21 23:16:32] [INFO ] Computed 58 invariants in 10 ms
[2024-05-21 23:16:32] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 23:16:32] [INFO ] Invariant cache hit.
[2024-05-21 23:16:32] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-05-21 23:16:33] [INFO ] Redundant transitions in 2 ms returned []
Running 305 sub problems to find dead transitions.
[2024-05-21 23:16:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 308/667 variables, 359/417 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:16:41] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:16:47] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:16:48] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:16:52] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/668 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 422 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 308/667 variables, 359/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 305/726 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/668 variables, and 726 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/360 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Starting structural reductions in SI_LTL mode, iteration 1 : 360/478 places, 308/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60897 ms. Remains : 360/478 places, 308/422 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60b-LTLFireability-13
Product exploration explored 100000 steps with 5442 reset in 279 ms.
Product exploration explored 100000 steps with 5360 reset in 278 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 121 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 24332 steps (1305 resets) in 107 ms. (225 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F (NOT (OR p0 p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 23 factoid took 370 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 308/308 transitions.
Applied a total of 0 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-05-21 23:17:34] [INFO ] Invariant cache hit.
[2024-05-21 23:17:34] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 23:17:34] [INFO ] Invariant cache hit.
[2024-05-21 23:17:35] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-21 23:17:35] [INFO ] Redundant transitions in 1 ms returned []
Running 305 sub problems to find dead transitions.
[2024-05-21 23:17:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 308/667 variables, 359/417 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:17:42] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:17:48] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:17:49] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:17:53] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/668 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 422 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 308/667 variables, 359/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 305/726 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/668 variables, and 726 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/360 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60828 ms. Remains : 360/360 places, 308/308 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 96 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 37005 steps (2023 resets) in 131 ms. (280 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F (NOT (OR p0 p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 23 factoid took 338 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 5461 reset in 264 ms.
Product exploration explored 100000 steps with 5387 reset in 282 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 308/308 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-05-21 23:18:36] [INFO ] Invariant cache hit.
[2024-05-21 23:18:36] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 23:18:36] [INFO ] Invariant cache hit.
[2024-05-21 23:18:37] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-21 23:18:37] [INFO ] Redundant transitions in 1 ms returned []
Running 305 sub problems to find dead transitions.
[2024-05-21 23:18:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 308/667 variables, 359/417 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:18:44] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:18:51] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:18:51] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-21 23:18:55] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/668 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 422 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 308/667 variables, 359/421 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 305/726 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/668 variables, and 726 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/360 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60754 ms. Remains : 360/360 places, 308/308 transitions.
Treatment of property DES-PT-60b-LTLFireability-13 finished in 185038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 471 transition count 404
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 457 transition count 404
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 393
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 223 place count 362 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 361 transition count 305
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 359 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 358 transition count 303
Applied a total of 228 rules in 53 ms. Remains 358 /478 variables (removed 120) and now considering 303/422 (removed 119) transitions.
// Phase 1: matrix 303 rows 358 cols
[2024-05-21 23:19:37] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 23:19:37] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 23:19:37] [INFO ] Invariant cache hit.
[2024-05-21 23:19:38] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-21 23:19:38] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-21 23:19:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 2/357 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 303/660 variables, 357/415 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:19:44] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:19:44] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/661 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:19:55] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:19:55] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/661 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 424 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 2/357 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 303/660 variables, 357/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 300/723 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/661 variables, and 723 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in SI_LTL mode, iteration 1 : 358/478 places, 303/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60832 ms. Remains : 358/478 places, 303/422 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-15
Product exploration explored 100000 steps with 23802 reset in 253 ms.
Product exploration explored 100000 steps with 23776 reset in 222 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-21 23:20:39] [INFO ] Invariant cache hit.
[2024-05-21 23:20:39] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-21 23:20:39] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 23 ms returned sat
[2024-05-21 23:20:40] [INFO ] [Real]Absence check using state equation in 1547 ms returned sat
[2024-05-21 23:20:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:20:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-21 23:20:43] [INFO ] [Nat]Absence check using state equation in 2202 ms returned sat
[2024-05-21 23:20:43] [INFO ] Computed and/alt/rep : 293/478/293 causal constraints (skipped 7 transitions) in 16 ms.
[2024-05-21 23:20:46] [INFO ] Added : 258 causal constraints over 52 iterations in 2735 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 358/358 places, 303/303 transitions.
Applied a total of 0 rules in 8 ms. Remains 358 /358 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-05-21 23:20:46] [INFO ] Invariant cache hit.
[2024-05-21 23:20:46] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:20:46] [INFO ] Invariant cache hit.
[2024-05-21 23:20:46] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-21 23:20:46] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-21 23:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 2/357 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 303/660 variables, 357/415 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/661 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:21:14] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/661 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 424 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 2/357 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 303/660 variables, 357/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 300/723 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/661 variables, and 723 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60822 ms. Remains : 358/358 places, 303/303 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-21 23:21:47] [INFO ] Invariant cache hit.
[2024-05-21 23:21:47] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-21 23:21:47] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 22 ms returned sat
[2024-05-21 23:21:48] [INFO ] [Real]Absence check using state equation in 1538 ms returned sat
[2024-05-21 23:21:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:21:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:21:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-21 23:21:51] [INFO ] [Nat]Absence check using state equation in 2191 ms returned sat
[2024-05-21 23:21:51] [INFO ] Computed and/alt/rep : 293/478/293 causal constraints (skipped 7 transitions) in 25 ms.
[2024-05-21 23:21:53] [INFO ] Added : 258 causal constraints over 52 iterations in 2542 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23835 reset in 173 ms.
Product exploration explored 100000 steps with 23799 reset in 182 ms.
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 358/358 places, 303/303 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-05-21 23:21:54] [INFO ] Invariant cache hit.
[2024-05-21 23:21:54] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 23:21:54] [INFO ] Invariant cache hit.
[2024-05-21 23:21:54] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-21 23:21:54] [INFO ] Redundant transitions in 1 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-21 23:21:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 2/357 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 303/660 variables, 357/415 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:22:00] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:00] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/661 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:22:11] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:22:11] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:22:11] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:22:12] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:22:12] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/661 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 424 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 2/357 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 303/660 variables, 357/423 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 300/723 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/661 variables, and 723 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60737 ms. Remains : 358/358 places, 303/303 transitions.
Treatment of property DES-PT-60b-LTLFireability-15 finished in 197687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X((p1||G((F(p0)&&F((G(p2)||G(p0))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DES-PT-60b-LTLFireability-12
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 478/478 places, 422/422 transitions.
Graph (complete) has 1139 edges and 478 vertex of which 472 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 471 transition count 404
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 457 transition count 404
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 393
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 446 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 443 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 443 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 443 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 442 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 442 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 441 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 440 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 440 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 440 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 67 place count 440 transition count 382
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 439 transition count 382
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 219 place count 364 transition count 307
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 5 with 4 rules applied. Total rules applied 223 place count 362 transition count 309
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 360 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 359 transition count 307
Applied a total of 226 rules in 56 ms. Remains 359 /478 variables (removed 119) and now considering 307/422 (removed 115) transitions.
// Phase 1: matrix 307 rows 359 cols
[2024-05-21 23:22:55] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:22:56] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 23:22:56] [INFO ] Invariant cache hit.
[2024-05-21 23:22:56] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-05-21 23:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 2/359 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 307/666 variables, 359/417 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/666 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 420 constraints, problems are : Problem set: 0 solved, 304 unsolved in 28717 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 1/357 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 2/359 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 307/666 variables, 359/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 304/724 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 724 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 3/3 constraints]
After SMT, in 58938ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 58942ms
Starting structural reductions in LI_LTL mode, iteration 1 : 359/478 places, 307/422 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 59486 ms. Remains : 359/478 places, 307/422 transitions.
Running random walk in product with property : DES-PT-60b-LTLFireability-12
Product exploration explored 100000 steps with 5100 reset in 185 ms.
Product exploration explored 100000 steps with 5065 reset in 210 ms.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Detected a total of 256/359 stabilizing places and 251/307 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2049 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (366 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1579787 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :0 out of 1
Probabilistic random walk after 1579787 steps, saw 214191 distinct states, run finished after 3002 ms. (steps per millisecond=526 ) properties seen :0
[2024-05-21 23:23:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/206 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/244 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/282 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/291 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/595 variables, 291/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/595 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 71/666 variables, 68/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/666 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/206 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/244 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/282 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/291 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/595 variables, 291/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/595 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 71/666 variables, 68/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/666 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/666 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 307/307 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 359 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 359 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 358 transition count 305
Applied a total of 3 rules in 12 ms. Remains 358 /359 variables (removed 1) and now considering 305/307 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 358/359 places, 305/307 transitions.
RANDOM walk for 40000 steps (1942 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (356 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1576247 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :0 out of 1
Probabilistic random walk after 1576247 steps, saw 213677 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :0
// Phase 1: matrix 305 rows 358 cols
[2024-05-21 23:24:02] [INFO ] Computed 59 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/212 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/250 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/282 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/291 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 302/593 variables, 291/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/593 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/663 variables, 67/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/663 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/663 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/663 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/212 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/250 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/282 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/291 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 302/593 variables, 291/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/593 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/593 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 70/663 variables, 67/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/663 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/663 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/663 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/663 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/663 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 358/358 places, 305/305 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-05-21 23:24:03] [INFO ] Invariant cache hit.
[2024-05-21 23:24:03] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 23:24:03] [INFO ] Invariant cache hit.
[2024-05-21 23:24:04] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-21 23:24:04] [INFO ] Redundant transitions in 3 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-21 23:24:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 2/358 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 302 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 305/663 variables, 358/417 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 7/424 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/663 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 12 (OVERLAPS) 0/663 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 425 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 2/358 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 305/663 variables, 358/425 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 302/727 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 727 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60761 ms. Remains : 358/358 places, 305/305 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 23:25:04] [INFO ] Invariant cache hit.
[2024-05-21 23:25:04] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:25:04] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 23:25:04] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:25:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:25:04] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 23:25:04] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:25:04] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:25:04] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 336 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
// Phase 1: matrix 307 rows 359 cols
[2024-05-21 23:25:05] [INFO ] Computed 58 invariants in 8 ms
[2024-05-21 23:25:05] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 23:25:05] [INFO ] Invariant cache hit.
[2024-05-21 23:25:05] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-05-21 23:25:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 2/359 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 307/666 variables, 359/417 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/666 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 420 constraints, problems are : Problem set: 0 solved, 304 unsolved in 29744 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 1/357 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 2/359 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 307/666 variables, 359/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 304/724 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 724 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 3/3 constraints]
After SMT, in 59979ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 59983ms
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 359/359 places, 307/307 transitions.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Detected a total of 256/359 stabilizing places and 251/307 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2005 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (367 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1536901 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :0 out of 1
Probabilistic random walk after 1536901 steps, saw 208167 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
[2024-05-21 23:26:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/206 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/244 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/282 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/291 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/595 variables, 291/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/595 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 71/666 variables, 68/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/666 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/206 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/244 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/282 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/291 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/595 variables, 291/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/595 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 71/666 variables, 68/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/666 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/666 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 307/307 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 359 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 359 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 358 transition count 305
Applied a total of 3 rules in 10 ms. Remains 358 /359 variables (removed 1) and now considering 305/307 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 358/359 places, 305/307 transitions.
RANDOM walk for 40000 steps (1997 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (352 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1587214 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :0 out of 1
Probabilistic random walk after 1587214 steps, saw 215118 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
// Phase 1: matrix 305 rows 358 cols
[2024-05-21 23:26:12] [INFO ] Computed 59 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/212 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/250 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/282 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/291 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 302/593 variables, 291/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/593 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/663 variables, 67/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/663 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/663 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/663 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/212 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/250 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/282 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/291 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 302/593 variables, 291/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/593 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/593 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 70/663 variables, 67/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/663 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/663 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/663 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/663 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/663 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 358/358 places, 305/305 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 305/305 transitions.
Applied a total of 0 rules in 4 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-05-21 23:26:13] [INFO ] Invariant cache hit.
[2024-05-21 23:26:13] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 23:26:13] [INFO ] Invariant cache hit.
[2024-05-21 23:26:13] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-21 23:26:13] [INFO ] Redundant transitions in 1 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-21 23:26:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 2/358 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 302 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 305/663 variables, 358/417 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-21 23:26:24] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:26:24] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:26] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:26] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:27] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 7/424 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/663 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 12 (OVERLAPS) 0/663 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 425 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 2/358 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 305/663 variables, 358/425 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 302/727 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 727 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60774 ms. Remains : 358/358 places, 305/305 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 23:27:14] [INFO ] Invariant cache hit.
[2024-05-21 23:27:14] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:27:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 23:27:14] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:27:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:27:14] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 23:27:14] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:27:14] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:27:14] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 310 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5151 reset in 211 ms.
Product exploration explored 100000 steps with 5029 reset in 232 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 307/307 transitions.
Applied a total of 0 rules in 8 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-21 23:27:15] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
// Phase 1: matrix 307 rows 359 cols
[2024-05-21 23:27:15] [INFO ] Computed 58 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 2/359 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 307/666 variables, 359/417 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:27:28] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:27:28] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (OVERLAPS) 0/666 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 420 constraints, problems are : Problem set: 0 solved, 304 unsolved in 23968 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 1/357 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 2/359 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 307/666 variables, 359/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 304/724 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:28:07] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 725 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 4/4 constraints]
After SMT, in 54220ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 54224ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54241 ms. Remains : 359/359 places, 307/307 transitions.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-05-21 23:28:09] [INFO ] Invariant cache hit.
[2024-05-21 23:28:09] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 23:28:09] [INFO ] Invariant cache hit.
[2024-05-21 23:28:10] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-05-21 23:28:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 2/359 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 307/666 variables, 359/417 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/666 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 420 constraints, problems are : Problem set: 0 solved, 304 unsolved in 28675 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 1/357 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 2/359 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 307/666 variables, 359/420 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 304/724 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 724 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 3/3 constraints]
After SMT, in 58913ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 58916ms
Finished structural reductions in LTL mode , in 1 iterations and 59425 ms. Remains : 359/359 places, 307/307 transitions.
Treatment of property DES-PT-60b-LTLFireability-12 finished in 373452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-21 23:29:09] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:29:09] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 23:29:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 478 places, 422 transitions and 1501 arcs took 5 ms.
Total runtime 3408070 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-60b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 478
TRANSITIONS: 422
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 5495
MODEL NAME: /home/mcc/execution/412/model
478 places, 422 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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-60b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188400756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;