About the Execution of LTSMin+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 |
| 1828.680 | 3600000.00 | 5180428.00 | 9530.10 | ?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.r480-tall-171624189900756.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DES-PT-60b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900756
=====================================================================
--------------------
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 1717200161870
Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:02:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:02:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:02:43] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-01 00:02:43] [INFO ] Transformed 519 places.
[2024-06-01 00:02:43] [INFO ] Transformed 470 transitions.
[2024-06-01 00:02:43] [INFO ] Found NUPN structural information;
[2024-06-01 00:02:43] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 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 156 ms. Remains 478 /519 variables (removed 41) and now considering 422/470 (removed 48) transitions.
// Phase 1: matrix 422 rows 478 cols
[2024-06-01 00:02:43] [INFO ] Computed 62 invariants in 45 ms
[2024-06-01 00:02:44] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-06-01 00:02:44] [INFO ] Invariant cache hit.
[2024-06-01 00:02:44] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-06-01 00:02:45] [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-06-01 00:02:57] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 42 ms to minimize.
[2024-06-01 00:02:57] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-06-01 00:02:57] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:02:57] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:02:58] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:02:58] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:03:02] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
[2024-06-01 00:03:02] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-06-01 00:03:02] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 3 ms to minimize.
[2024-06-01 00:03:03] [INFO ] Deduced a trap composed of 43 places in 76 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-06-01 00:03:12] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:03:12] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:03:12] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:03:12] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:03:13] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 00:03:13] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 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 30022 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-06-01 00:03:19] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:03:19] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:03:19] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:03:20] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:03:20] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:03:20] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:03:20] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:03:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:03:20] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:03:20] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:03:21] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:03:21] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:03:21] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:03:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:03:21] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:03:21] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:03:21] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:03:21] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:03:22] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
[2024-06-01 00:03:24] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:03:26] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
[2024-06-01 00:03:26] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-06-01 00:03:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:03:29] [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-06-01 00:03:30] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-06-01 00:03:31] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-06-01 00:03:31] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2024-06-01 00:03:31] [INFO ] Deduced a trap composed of 23 places in 107 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-06-01 00:03:35] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:03:35] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:03:35] [INFO ] Deduced a trap composed of 19 places in 56 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
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 421/1016 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 30021 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 60445ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60486ms
Starting structural reductions in LTL mode, iteration 1 : 478/519 places, 422/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61922 ms. Remains : 478/519 places, 422/470 transitions.
Support contains 35 out of 478 places after structural reductions.
[2024-06-01 00:03:45] [INFO ] Flatten gal took : 82 ms
[2024-06-01 00:03:45] [INFO ] Flatten gal took : 30 ms
[2024-06-01 00:03:45] [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 (349 resets) in 1755 ms. (22 steps per ms) remains 10/23 properties
BEST_FIRST walk for 40004 steps (51 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (53 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (54 resets) in 515 ms. (77 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (61 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (51 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (60 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
[2024-06-01 00:03:46] [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 2652 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-06-01 00:03:49] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 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-06-01 00:03:50] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 8 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-06-01 00:03:53] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:03:53] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-01 00:03:53] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:03:53] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:03:53] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:03:53] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:03:54] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:03:54] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:03:54] [INFO ] Deduced a trap composed of 24 places in 61 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 5014 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 7701ms 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.6 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 2 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 226 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 227 ms. Remains : 364/478 places, 310/422 transitions.
RANDOM walk for 40000 steps (1544 resets) in 651 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (320 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (302 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (306 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (323 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (276 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (328 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (317 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (318 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (321 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (294 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 651851 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 10
Probabilistic random walk after 651851 steps, saw 99594 distinct states, run finished after 3014 ms. (steps per millisecond=216 ) properties seen :0
// Phase 1: matrix 310 rows 364 cols
[2024-06-01 00:03:58] [INFO ] Computed 60 invariants in 14 ms
[2024-06-01 00:03:58] [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 1488 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-06-01 00:04:00] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 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-06-01 00:04:00] [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-06-01 00:04:00] [INFO ] Deduced a trap composed of 7 places in 28 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-06-01 00:04:03] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:04:04] [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-06-01 00:04:12] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 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-06-01 00:04:30] [INFO ] Deduced a trap composed of 6 places in 53 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 46551ms 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 20 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 20 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 17 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2024-06-01 00:04:45] [INFO ] Invariant cache hit.
[2024-06-01 00:04:45] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 00:04:45] [INFO ] Invariant cache hit.
[2024-06-01 00:04:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:04:45] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-06-01 00:04:45] [INFO ] Redundant transitions in 14 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-01 00:04:45] [INFO ] Invariant cache hit.
[2024-06-01 00:04:45] [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-06-01 00:05:00] [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 26158 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-06-01 00:05:33] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:05:34] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-01 00:05:34] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:05:34] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-06-01 00:05:35] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:05:35] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:05:36] [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 30020 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 56421ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 56424ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57060 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.17 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 29 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-06-01 00:05:42] [INFO ] Computed 62 invariants in 6 ms
[2024-06-01 00:05:42] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 00:05:42] [INFO ] Invariant cache hit.
[2024-06-01 00:05:43] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:05:43] [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-06-01 00:05:54] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:05:54] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 00:05:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:05:54] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:05:56] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:05:57] [INFO ] Deduced a trap composed of 34 places in 68 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-06-01 00:06:11] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 00:06:11] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:06:11] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:06:13] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 3 ms to minimize.
SMT process timed out in 30304ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30315ms
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31272 ms. Remains : 473/478 places, 413/422 transitions.
Stuttering acceptance computed with spot in 354 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 242 ms.
Product exploration explored 100000 steps with 25000 reset in 196 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.10 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 154 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 173 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 1575 steps (11 resets) in 24 ms. (63 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 161 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 177 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 169 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-06-01 00:06:15] [INFO ] Invariant cache hit.
[2024-06-01 00:06:15] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 00:06:15] [INFO ] Invariant cache hit.
[2024-06-01 00:06:16] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:06:16] [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-06-01 00:06:26] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-06-01 00:06:28] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:06:28] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:06:28] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:06:28] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:06:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:06:29] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-06-01 00:06:30] [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-06-01 00:06:44] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-06-01 00:06:44] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:06:44] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)timeout
(s108 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 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: 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-06-01 00:06:50] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:06:50] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:06:50] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-06-01 00:06:50] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:06:50] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-01 00:06:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:06:50] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:06:51] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:06:51] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-06-01 00:06:51] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:06:51] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:06:51] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:06:52] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:06:52] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:06:52] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:06:52] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:06:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:06:52] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:06:52] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:06:52] [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-06-01 00:06:53] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:06:53] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:06:53] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:06:53] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:06:53] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:06:53] [INFO ] Deduced a trap composed of 11 places in 30 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-06-01 00:06:56] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:06:57] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:06:58] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:06:58] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:06:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:07:00] [INFO ] Deduced a trap composed of 29 places in 46 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-06-01 00:07:02] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:07:04] [INFO ] Deduced a trap composed of 34 places in 39 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 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: 51/51 constraints]
After SMT, in 60261ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Finished structural reductions in LTL mode , in 1 iterations and 61197 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.8 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 63 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 173 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 4823 steps (42 resets) in 72 ms. (66 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 135 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 178 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 163 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 153 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 126 ms.
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 164 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.3 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 0 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 1 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 0 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 1 ms
Applied a total of 136 rules in 134 ms. Remains 451 /473 variables (removed 22) and now considering 421/413 (removed -8) transitions.
[2024-06-01 00:07:18] [INFO ] Redundant transitions in 16 ms returned []
Running 420 sub problems to find dead transitions.
// Phase 1: matrix 421 rows 451 cols
[2024-06-01 00:07:18] [INFO ] Computed 59 invariants in 8 ms
[2024-06-01 00:07:18] [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 23011 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-06-01 00:07:46] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:07:46] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:07:46] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:07:47] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:07:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 5/64 constraints. Problems are: Problem set: 110 solved, 310 unsolved
[2024-06-01 00:07:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 00:07:49] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 2/66 constraints. Problems are: Problem set: 110 solved, 310 unsolved
[2024-06-01 00:07:52] [INFO ] Deduced a trap composed of 11 places in 43 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 30020 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 53307ms problems are : Problem set: 110 solved, 310 unsolved
Search for dead transitions found 110 dead transitions in 53311ms
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.2 ms
Discarding 87 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 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 53484 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-06-01 00:08:11] [INFO ] Computed 62 invariants in 6 ms
[2024-06-01 00:08:11] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-01 00:08:11] [INFO ] Invariant cache hit.
[2024-06-01 00:08:12] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:08:12] [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-06-01 00:08:23] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:08:23] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-06-01 00:08:23] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
[2024-06-01 00:08:24] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:08:24] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:08:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:08:24] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:08:24] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:08:24] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:08:24] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:08:25] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:08:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:08:25] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-06-01 00:08:26] [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-06-01 00:08:40] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-06-01 00:08:40] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:08:41] [INFO ] Deduced a trap composed of 30 places in 105 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 30011 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-06-01 00:08:46] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:08:46] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-06-01 00:08:46] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:08:46] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:08:46] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-01 00:08:47] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:08:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:08:47] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:08:47] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 00:08:47] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:08:47] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:08:48] [INFO ] Deduced a trap composed of 14 places in 46 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-06-01 00:08:49] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:08:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:08:49] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:08:49] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:08:49] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:08:50] [INFO ] Deduced a trap composed of 11 places in 23 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-06-01 00:08:53] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:08:53] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:08:54] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:08:54] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:08:54] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:08:56] [INFO ] Deduced a trap composed of 29 places in 52 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-06-01 00:08:58] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:09:00] [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 30018 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 60265ms
Finished structural reductions in LTL mode , in 1 iterations and 61166 ms. Remains : 473/473 places, 413/413 transitions.
Treatment of property DES-PT-60b-LTLFireability-00 finished in 210543 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 32 ms. Remains 475 /478 variables (removed 3) and now considering 417/422 (removed 5) transitions.
// Phase 1: matrix 417 rows 475 cols
[2024-06-01 00:09:12] [INFO ] Computed 62 invariants in 7 ms
[2024-06-01 00:09:13] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 00:09:13] [INFO ] Invariant cache hit.
[2024-06-01 00:09:13] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-06-01 00:09:13] [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-06-01 00:09:25] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 2 ms to minimize.
[2024-06-01 00:09:25] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:09:25] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:09:25] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:09:26] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-06-01 00:09:26] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:09:26] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:09:26] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:09:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:09:26] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:09:27] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:09:27] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-01 00:09:27] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:09:28] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:09:28] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:09:28] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:09:29] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:09:29] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:09:29] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:09:29] [INFO ] Deduced a trap composed of 39 places in 74 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-06-01 00:09:32] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:09:32] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:09:32] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:09:32] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:09:33] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:09:35] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 6/563 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 00:09:38] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:09:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:09:42] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:09:42] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-06-01 00:09:43] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-06-01 00:09:43] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 892/892 variables, and 569 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
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
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, 32/94 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 00:09:47] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:09:47] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:09:47] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:09:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:09:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:09:48] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:09:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:09:48] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-06-01 00:09:49] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 00:09:49] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:09:49] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:09:49] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:09:49] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:09:49] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 00:09:53] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 4 ms to minimize.
[2024-06-01 00:09:53] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:09:53] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-06-01 00:09:54] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 00:09:57] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:09:58] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:09:58] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:10:01] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 00:10:03] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 00:10:06] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:10:07] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:10:07] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:10:07] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:10:07] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 62)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 timeout
1)
(s25 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/892 variables, and 122 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 60/60 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 475/478 places, 417/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61194 ms. Remains : 475/478 places, 417/422 transitions.
Stuttering acceptance computed with spot in 309 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 61523 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.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 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 1 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 0 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 73 ms. Remains 364 /478 variables (removed 114) and now considering 312/422 (removed 110) transitions.
// Phase 1: matrix 312 rows 364 cols
[2024-06-01 00:10:14] [INFO ] Computed 58 invariants in 4 ms
[2024-06-01 00:10:14] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 00:10:14] [INFO ] Invariant cache hit.
[2024-06-01 00:10:15] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-06-01 00:10:15] [INFO ] Redundant transitions in 2 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-01 00:10:15] [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-06-01 00:10:26] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:10:26] [INFO ] Deduced a trap composed of 17 places in 68 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-06-01 00:10:33] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:10:33] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:10:33] [INFO ] Deduced a trap composed of 27 places in 73 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
At refinement iteration 13 (OVERLAPS) 0/676 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 427 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30012 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-06-01 00:11:10] [INFO ] Deduced a trap composed of 6 places in 51 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 30010 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 60244ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
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 60964 ms. Remains : 364/478 places, 312/422 transitions.
Stuttering acceptance computed with spot in 128 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 4708 reset in 294 ms.
Product exploration explored 100000 steps with 4667 reset in 344 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 223 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 (1837 resets) in 292 ms. (136 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (328 resets) in 471 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (363 resets) in 966 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (353 resets) in 1033 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (345 resets) in 408 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (382 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (357 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
[2024-06-01 00:11:17] [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 901 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-06-01 00:11:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 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-06-01 00:11:19] [INFO ] Deduced a trap composed of 15 places in 84 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 2149 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 3075ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 16532 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 21 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 21 ms. Remains : 362/364 places, 309/312 transitions.
RANDOM walk for 40000 steps (1767 resets) in 946 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (337 resets) in 220 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (354 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (335 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (365 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (323 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (341 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 573334 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 6
Probabilistic random walk after 573334 steps, saw 73420 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 309 rows 362 cols
[2024-06-01 00:11:40] [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 825 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-06-01 00:11:41] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:11:42] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:11:42] [INFO ] Deduced a trap composed of 4 places in 91 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-06-01 00:11:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:11:42] [INFO ] Deduced a trap composed of 4 places in 89 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-06-01 00:11:43] [INFO ] Deduced a trap composed of 18 places in 68 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 2464 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 3350ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 20090 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 12 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 12 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 9 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-06-01 00:12:04] [INFO ] Invariant cache hit.
[2024-06-01 00:12:04] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-01 00:12:04] [INFO ] Invariant cache hit.
[2024-06-01 00:12:04] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-06-01 00:12:04] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 00:12:04] [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-06-01 00:12:15] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:12:15] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:12:15] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:12:16] [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 22177 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-06-01 00:12:54] [INFO ] Deduced a trap composed of 5 places in 51 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 30024 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 52424ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 52427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53084 ms. Remains : 362/362 places, 309/309 transitions.
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 327 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 114 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 109 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 13 ms. Remains 364 /364 variables (removed 0) and now considering 312/312 (removed 0) transitions.
// Phase 1: matrix 312 rows 364 cols
[2024-06-01 00:12:58] [INFO ] Computed 58 invariants in 5 ms
[2024-06-01 00:12:58] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 00:12:58] [INFO ] Invariant cache hit.
[2024-06-01 00:12:58] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-06-01 00:12:58] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-01 00:12:58] [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-06-01 00:13:09] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:13:10] [INFO ] Deduced a trap composed of 17 places in 68 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-06-01 00:13:16] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:13:16] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:13:17] [INFO ] Deduced a trap composed of 27 places in 76 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
At refinement iteration 13 (OVERLAPS) 0/676 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 427 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: 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-06-01 00:13:53] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 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 30019 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 60266ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60926 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 223 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 113 ms :[p0, p0, (AND (NOT p2) p1 p0)]
RANDOM walk for 40000 steps (1842 resets) in 812 ms. (49 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (345 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (353 resets) in 273 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (363 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (330 resets) in 255 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (358 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (326 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
[2024-06-01 00:14:00] [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 923 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-06-01 00:14:01] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 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-06-01 00:14:01] [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 2277 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 3224ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 16002 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 26 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 26 ms. Remains : 362/364 places, 309/312 transitions.
RANDOM walk for 40000 steps (1807 resets) in 922 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (330 resets) in 267 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (344 resets) in 307 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (343 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (340 resets) in 340 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (338 resets) in 324 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (331 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 576887 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 6
Probabilistic random walk after 576887 steps, saw 73784 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 309 rows 362 cols
[2024-06-01 00:14:23] [INFO ] Computed 59 invariants in 6 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 870 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-06-01 00:14:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:14:24] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:14:24] [INFO ] Deduced a trap composed of 4 places in 93 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-06-01 00:14:24] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:14:24] [INFO ] Deduced a trap composed of 4 places in 93 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-06-01 00:14:25] [INFO ] Deduced a trap composed of 18 places in 66 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 2553 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 3457ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 20689 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 11 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 11 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 11 ms. Remains 362 /362 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-06-01 00:14:47] [INFO ] Invariant cache hit.
[2024-06-01 00:14:47] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-01 00:14:47] [INFO ] Invariant cache hit.
[2024-06-01 00:14:47] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-06-01 00:14:47] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 00:14:47] [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-06-01 00:14:58] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-06-01 00:14:58] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:14:59] [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 21779 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-06-01 00:15:36] [INFO ] Deduced a trap composed of 5 places in 53 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 30021 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 52012ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 52016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52687 ms. Remains : 362/362 places, 309/309 transitions.
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 363 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 119 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 117 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 133 ms :[p0, p0, (AND (NOT p2) p1 p0)]
Product exploration explored 100000 steps with 4702 reset in 280 ms.
Product exploration explored 100000 steps with 4711 reset in 293 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-06-01 00:15:41] [INFO ] Computed 58 invariants in 8 ms
[2024-06-01 00:15:41] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 00:15:41] [INFO ] Invariant cache hit.
[2024-06-01 00:15:41] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-06-01 00:15:41] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-01 00:15:41] [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-06-01 00:15:53] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:15:53] [INFO ] Deduced a trap composed of 17 places in 68 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-06-01 00:15:59] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:15:59] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:16:00] [INFO ] Deduced a trap composed of 27 places in 76 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
At refinement iteration 13 (OVERLAPS) 0/676 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, 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-06-01 00:16:36] [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 30012 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 60253ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60864 ms. Remains : 364/364 places, 312/312 transitions.
Treatment of property DES-PT-60b-LTLFireability-03 finished in 387864 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.0 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 1 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 1 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 56 ms. Remains 361 /478 variables (removed 117) and now considering 309/422 (removed 113) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-06-01 00:16:42] [INFO ] Computed 58 invariants in 3 ms
[2024-06-01 00:16:42] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 00:16:42] [INFO ] Invariant cache hit.
[2024-06-01 00:16:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:16:42] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-06-01 00:16:42] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 00:16:42] [INFO ] Invariant cache hit.
[2024-06-01 00:16:42] [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 26758 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 57043ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 57047ms
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 57764 ms. Remains : 361/478 places, 309/422 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-04
Product exploration explored 100000 steps with 4640 reset in 276 ms.
Product exploration explored 100000 steps with 4706 reset in 298 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 65 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1828 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (378 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1258384 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 1
Probabilistic random walk after 1258384 steps, saw 176595 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :0
[2024-06-01 00:17:44] [INFO ] Invariant cache hit.
[2024-06-01 00:17:44] [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 477 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-06-01 00:17:45] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:17:45] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:17:45] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 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 1411 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 1897ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 200 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 19 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 19 ms. Remains : 360/361 places, 307/309 transitions.
RANDOM walk for 40000 steps (1813 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (368 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1285698 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :0 out of 1
Probabilistic random walk after 1285698 steps, saw 177054 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
// Phase 1: matrix 307 rows 360 cols
[2024-06-01 00:17:49] [INFO ] Computed 59 invariants in 9 ms
[2024-06-01 00:17:49] [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 403 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-06-01 00:17:50] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 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 955 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 1374ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 188 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-06-01 00:17:50] [INFO ] Invariant cache hit.
[2024-06-01 00:17:51] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 00:17:51] [INFO ] Invariant cache hit.
[2024-06-01 00:17:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:17:51] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-06-01 00:17:51] [INFO ] Redundant transitions in 4 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-01 00:17:51] [INFO ] Invariant cache hit.
[2024-06-01 00:17:51] [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-06-01 00:18:17] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:18:17] [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 30021 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-06-01 00:18:45] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:18:46] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:18:46] [INFO ] Deduced a trap composed of 10 places in 88 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 30010 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 60251ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60891 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 16 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-06-01 00:18:51] [INFO ] Computed 59 invariants in 8 ms
[2024-06-01 00:18:51] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:18:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:18:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:18:52] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 324 ms
TRAPS : Iteration 1
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
TRAPS : Iteration 2
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
TRAPS : Iteration 3
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
TRAPS : Iteration 4
[2024-06-01 00:18:53] [INFO ] After 1687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:18:53] [INFO ] After 1943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2051 ms.
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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 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 12 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-06-01 00:18:54] [INFO ] Computed 58 invariants in 7 ms
[2024-06-01 00:18:54] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 00:18:54] [INFO ] Invariant cache hit.
[2024-06-01 00:18:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:18:54] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-06-01 00:18:54] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 00:18:54] [INFO ] Invariant cache hit.
[2024-06-01 00:18:54] [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 27659 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 57903ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 57906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58562 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 71 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1872 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (382 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1268490 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :0 out of 1
Probabilistic random walk after 1268490 steps, saw 178178 distinct states, run finished after 3001 ms. (steps per millisecond=422 ) properties seen :0
[2024-06-01 00:19:55] [INFO ] Invariant cache hit.
[2024-06-01 00:19:55] [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 475 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-06-01 00:19:57] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 21 places in 77 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 1388 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 1873ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 218 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 19 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 20 ms. Remains : 360/361 places, 307/309 transitions.
RANDOM walk for 40000 steps (1791 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (367 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1291614 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :0 out of 1
Probabilistic random walk after 1291614 steps, saw 177949 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
// Phase 1: matrix 307 rows 360 cols
[2024-06-01 00:20:01] [INFO ] Computed 59 invariants in 10 ms
[2024-06-01 00:20:01] [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 411 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-06-01 00:20:02] [INFO ] Deduced a trap composed of 17 places in 81 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 963 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 1392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 196 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 8 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 8 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-06-01 00:20:02] [INFO ] Invariant cache hit.
[2024-06-01 00:20:02] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 00:20:02] [INFO ] Invariant cache hit.
[2024-06-01 00:20:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:20:03] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-06-01 00:20:03] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-01 00:20:03] [INFO ] Invariant cache hit.
[2024-06-01 00:20:03] [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-06-01 00:20:29] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:20:29] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/667 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 304 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 667/667 variables, and 427 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30019 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-06-01 00:20:57] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 10 places in 91 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 30017 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 60239ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60909 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-06-01 00:21:03] [INFO ] Computed 59 invariants in 5 ms
[2024-06-01 00:21:03] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:21:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-06-01 00:21:03] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:21:03] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:21:04] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:21:04] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:21:04] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:21:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
TRAPS : Iteration 1
[2024-06-01 00:21:04] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:21:04] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:21:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
TRAPS : Iteration 2
[2024-06-01 00:21:04] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
TRAPS : Iteration 3
[2024-06-01 00:21:05] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
TRAPS : Iteration 4
[2024-06-01 00:21:05] [INFO ] After 1640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:21:05] [INFO ] After 1881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1971 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 56 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4685 reset in 240 ms.
Product exploration explored 100000 steps with 4688 reset in 256 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-06-01 00:21:06] [INFO ] Computed 58 invariants in 8 ms
[2024-06-01 00:21:06] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 00:21:06] [INFO ] Invariant cache hit.
[2024-06-01 00:21:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:21:06] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-06-01 00:21:06] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 00:21:06] [INFO ] Invariant cache hit.
[2024-06-01 00:21:06] [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 26584 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 30009 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 56826ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 56828ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57449 ms. Remains : 361/361 places, 309/309 transitions.
Treatment of property DES-PT-60b-LTLFireability-04 finished in 321517 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 17 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-06-01 00:22:03] [INFO ] Computed 62 invariants in 15 ms
[2024-06-01 00:22:04] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 00:22:04] [INFO ] Invariant cache hit.
[2024-06-01 00:22:04] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:22:04] [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-06-01 00:22:15] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:22:15] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:22:15] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:22:15] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:22:15] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:22:16] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:22:16] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:22:16] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:22:16] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:22:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:22:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:22:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:22:17] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:22:18] [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-06-01 00:22:32] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-06-01 00:22:32] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:22:32] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:22:34] [INFO ] Deduced a trap composed of 44 places in 113 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-06-01 00:22:38] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:22:38] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:22:38] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:22:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:22:39] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:22:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:22:40] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:22:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:22:40] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 00:22:40] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:22:42] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:22:42] [INFO ] Deduced a trap composed of 34 places in 29 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-06-01 00:22:42] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:22:42] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:22:46] [INFO ] Deduced a trap composed of 22 places in 44 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 30011 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 60218ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61077 ms. Remains : 473/478 places, 413/422 transitions.
Stuttering acceptance computed with spot in 212 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 884 reset in 189 ms.
Product exploration explored 100000 steps with 880 reset in 209 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.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 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 232 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 108 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 (351 resets) in 414 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (64 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (53 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (66 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (64 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 395090 steps, run timeout after 3005 ms. (steps per millisecond=131 ) properties seen :0 out of 6
Probabilistic random walk after 395090 steps, saw 70592 distinct states, run finished after 3005 ms. (steps per millisecond=131 ) properties seen :0
[2024-06-01 00:23:09] [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 1681 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-06-01 00:23:11] [INFO ] Deduced a trap composed of 9 places in 102 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-06-01 00:23:12] [INFO ] Deduced a trap composed of 34 places in 93 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-06-01 00:23:13] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 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 4907 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 6602ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 40992 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 1 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 41 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 41 ms. Remains : 359/473 places, 305/413 transitions.
RANDOM walk for 40000 steps (1775 resets) in 1404 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (354 resets) in 350 ms. (113 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (366 resets) in 338 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (334 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (363 resets) in 291 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (337 resets) in 291 ms. (136 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 589729 steps, run timeout after 3012 ms. (steps per millisecond=195 ) properties seen :0 out of 5
Probabilistic random walk after 589729 steps, saw 81914 distinct states, run finished after 3012 ms. (steps per millisecond=195 ) properties seen :0
// Phase 1: matrix 305 rows 359 cols
[2024-06-01 00:24:01] [INFO ] Computed 60 invariants in 5 ms
[2024-06-01 00:24:01] [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 1513 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-06-01 00:24:02] [INFO ] Deduced a trap composed of 10 places in 55 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-06-01 00:24:03] [INFO ] Deduced a trap composed of 14 places in 78 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-06-01 00:24:04] [INFO ] Deduced a trap composed of 15 places in 75 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 3746 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 5276ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 15667 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 5 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 5 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-06-01 00:24:22] [INFO ] Invariant cache hit.
[2024-06-01 00:24:22] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 00:24:22] [INFO ] Invariant cache hit.
[2024-06-01 00:24:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:24:22] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-06-01 00:24:22] [INFO ] Redundant transitions in 2 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-01 00:24:22] [INFO ] Invariant cache hit.
[2024-06-01 00:24:22] [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-06-01 00:24:36] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:24:37] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:24:37] [INFO ] Deduced a trap composed of 5 places in 43 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
At refinement iteration 13 (OVERLAPS) 0/664 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, 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-06-01 00:25:10] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:25:10] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:25:12] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:25:16] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
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 Int declared 663/664 variables, and 733 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30020 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 60252ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60839 ms. Remains : 359/359 places, 305/305 transitions.
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 223 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 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.0 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 1 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 1 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 35 ms. Remains 362 /473 variables (removed 111) and now considering 310/413 (removed 103) transitions.
// Phase 1: matrix 310 rows 362 cols
[2024-06-01 00:25:23] [INFO ] Computed 58 invariants in 8 ms
[2024-06-01 00:25:23] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 00:25:23] [INFO ] Invariant cache hit.
[2024-06-01 00:25:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:25:24] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-06-01 00:25:24] [INFO ] Redundant transitions in 2 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-01 00:25:24] [INFO ] Invariant cache hit.
[2024-06-01 00:25:24] [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-06-01 00:25:36] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:25:39] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 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-06-01 00:25:48] [INFO ] Deduced a trap composed of 16 places in 68 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
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 672/672 variables, and 429 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 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: 3/3 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, 3/47 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 2/361 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 310/672 variables, 362/423 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 307/736 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:26:17] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:26:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 739 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30026 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: 6/6 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
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 60894 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 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 (1869 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (365 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1284223 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :0 out of 1
Probabilistic random walk after 1284223 steps, saw 173161 distinct states, run finished after 3001 ms. (steps per millisecond=427 ) properties seen :0
[2024-06-01 00:26:27] [INFO ] Invariant cache hit.
[2024-06-01 00:26:27] [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 248 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 389 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 653ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 821 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 1 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 36 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 36 ms. Remains : 357/362 places, 304/310 transitions.
RANDOM walk for 40000 steps (2104 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (388 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1293365 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :0 out of 1
Probabilistic random walk after 1293365 steps, saw 195342 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
// Phase 1: matrix 304 rows 357 cols
[2024-06-01 00:26: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-06-01 00:26:32] [INFO ] Deduced a trap composed of 13 places in 67 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 339 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 334 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 691ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 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 5 ms. Remains 357 /357 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-01 00:26:32] [INFO ] Invariant cache hit.
[2024-06-01 00:26:33] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 00:26:33] [INFO ] Invariant cache hit.
[2024-06-01 00:26:33] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-06-01 00:26:33] [INFO ] Redundant transitions in 1 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-01 00:26:33] [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-06-01 00:26:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:26:41] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:26:43] [INFO ] Deduced a trap composed of 13 places in 68 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-06-01 00:26:45] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:26:46] [INFO ] Deduced a trap composed of 17 places in 60 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 25954 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 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: 5/5 constraints]
After SMT, in 56178ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 56181ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56781 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 11 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-06-01 00:27:29] [INFO ] Computed 59 invariants in 6 ms
[2024-06-01 00:27:29] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:27:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:27:29] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:27:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:27:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2024-06-01 00:27:30] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:27:30] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:27:30] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 373 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 203 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4597 reset in 218 ms.
Product exploration explored 100000 steps with 4543 reset in 232 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 10 ms. Remains 358 /362 variables (removed 4) and now considering 306/310 (removed 4) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-06-01 00:27:30] [INFO ] Computed 58 invariants in 9 ms
[2024-06-01 00:27:31] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 00:27:31] [INFO ] Invariant cache hit.
[2024-06-01 00:27:31] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-06-01 00:27:31] [INFO ] Redundant transitions in 1 ms returned []
Running 303 sub problems to find dead transitions.
[2024-06-01 00:27:31] [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-06-01 00:27:39] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-01 00:27:45] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 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-06-01 00:27:57] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/664 variables, 1/419 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 419 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: 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 60242ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
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 60835 ms. Remains : 358/362 places, 306/310 transitions.
Treatment of property DES-PT-60b-LTLFireability-06 finished in 388053 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 18 ms. Remains 476 /478 variables (removed 2) and now considering 418/422 (removed 4) transitions.
// Phase 1: matrix 418 rows 476 cols
[2024-06-01 00:28:31] [INFO ] Computed 62 invariants in 7 ms
[2024-06-01 00:28:32] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-01 00:28:32] [INFO ] Invariant cache hit.
[2024-06-01 00:28:32] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-06-01 00:28:32] [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-06-01 00:28:40] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:28:40] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:28:41] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:28:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:28:41] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-06-01 00:28:42] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:28:42] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:28:42] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-06-01 00:28:42] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-06-01 00:28:43] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:43] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-01 00:28:43] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-06-01 00:28:43] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-06-01 00:28:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:28:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:28:44] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:45] [INFO ] Deduced a trap composed of 21 places in 35 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-06-01 00:28:54] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 37 places in 97 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
At refinement iteration 8 (INCLUDED_ONLY) 0/894 variables, 0/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-06-01 00:29:06] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:29:06] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:29:06] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:29:06] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:29:07] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:29:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:29:07] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:29:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:29:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:29:07] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:29:08] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:29:08] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:29:08] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:29:08] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:29:08] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:29:08] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:29:11] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:29:11] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:29:11] [INFO ] Deduced a trap composed of 24 places in 35 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-06-01 00:29:11] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:29:11] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:29:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:29:12] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:29:12] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:29:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:29:12] [INFO ] Deduced a trap composed of 30 places in 47 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-06-01 00:29:15] [INFO ] Deduced a trap composed of 13 places in 48 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-06-01 00:29:20] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:29:20] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:29:20] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:29:20] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:29:20] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:29:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 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 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: 52/52 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 476/478 places, 418/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61164 ms. Remains : 476/478 places, 418/422 transitions.
Stuttering acceptance computed with spot in 186 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 510 steps with 4 reset in 5 ms.
FORMULA DES-PT-60b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-07 finished in 61373 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.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 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 1 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 64 ms. Remains 358 /478 variables (removed 120) and now considering 306/422 (removed 116) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-06-01 00:29:33] [INFO ] Computed 58 invariants in 8 ms
[2024-06-01 00:29:33] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 00:29:33] [INFO ] Invariant cache hit.
[2024-06-01 00:29:33] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-06-01 00:29:33] [INFO ] Redundant transitions in 1 ms returned []
Running 303 sub problems to find dead transitions.
[2024-06-01 00:29:33] [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-06-01 00:29:45] [INFO ] Deduced a trap composed of 17 places in 64 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-06-01 00:29:49] [INFO ] Deduced a trap composed of 11 places in 44 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-06-01 00:29:52] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:29:52] [INFO ] Deduced a trap composed of 15 places in 45 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-06-01 00:29:57] [INFO ] Deduced a trap composed of 15 places in 66 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: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 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 30018 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 30015 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 60229ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
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 60932 ms. Remains : 358/478 places, 306/422 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-08
Product exploration explored 100000 steps with 5167 reset in 221 ms.
Product exploration explored 100000 steps with 5195 reset in 235 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 87 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 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2116 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (395 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1362405 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1362405 steps, saw 187827 distinct states, run finished after 3002 ms. (steps per millisecond=453 ) properties seen :0
[2024-06-01 00:30:37] [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 241 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 531 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 781ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 849 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 (2022 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (409 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1362495 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 1
Probabilistic random walk after 1362495 steps, saw 187800 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
// Phase 1: matrix 304 rows 357 cols
[2024-06-01 00:30:42] [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 238 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 383 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 649ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 841 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 4 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 4 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-06-01 00:30:44] [INFO ] Invariant cache hit.
[2024-06-01 00:30:44] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-01 00:30:44] [INFO ] Invariant cache hit.
[2024-06-01 00:30:44] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-06-01 00:30:44] [INFO ] Redundant transitions in 1 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-01 00:30: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-06-01 00:30:55] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:30:56] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:30:56] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:30:56] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:30:56] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:30:57] [INFO ] Deduced a trap composed of 12 places in 78 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-06-01 00:31:02] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:31:06] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:31:06] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-01 00:31:08] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:31:08] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:31:08] [INFO ] Deduced a trap composed of 15 places in 41 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 30015 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 30013 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 60230ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60839 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-06-01 00:31:44] [INFO ] Computed 59 invariants in 6 ms
[2024-06-01 00:31:44] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:31:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:31:45] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:31:45] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:31:45] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:31:45] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 364 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 177 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 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 9 ms. Remains 358 /358 variables (removed 0) and now considering 306/306 (removed 0) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-06-01 00:31:45] [INFO ] Computed 58 invariants in 9 ms
[2024-06-01 00:31:45] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 00:31:45] [INFO ] Invariant cache hit.
[2024-06-01 00:31:46] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-06-01 00:31:46] [INFO ] Redundant transitions in 1 ms returned []
Running 303 sub problems to find dead transitions.
[2024-06-01 00:31: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-06-01 00:31:57] [INFO ] Deduced a trap composed of 17 places in 70 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-06-01 00:32:01] [INFO ] Deduced a trap composed of 11 places in 56 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-06-01 00:32:04] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 15 places in 47 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-06-01 00:32:08] [INFO ] Deduced a trap composed of 15 places in 72 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 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: 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 30015 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 60226ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60839 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 105 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 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2091 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (391 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1449382 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1449382 steps, saw 201264 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
[2024-06-01 00:32: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 216 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 530 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 751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 810 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 (2012 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (374 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1427619 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1427619 steps, saw 198141 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
// Phase 1: matrix 304 rows 357 cols
[2024-06-01 00:32:54] [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 229 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 368 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 609ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 807 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 8 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 8 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-06-01 00:32:55] [INFO ] Invariant cache hit.
[2024-06-01 00:32:55] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 00:32:55] [INFO ] Invariant cache hit.
[2024-06-01 00:32:56] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-06-01 00:32:56] [INFO ] Redundant transitions in 2 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-01 00:32: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-06-01 00:33:06] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:33:08] [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-06-01 00:33:13] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:33:16] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:33:16] [INFO ] Deduced a trap composed of 15 places in 64 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-06-01 00:33:18] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:33:19] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:33:19] [INFO ] Deduced a trap composed of 15 places in 43 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
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 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 30013 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 60223ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60829 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-06-01 00:33:56] [INFO ] Computed 59 invariants in 7 ms
[2024-06-01 00:33:56] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:33:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:33:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:33:56] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:33:56] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:33:56] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 375 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 78 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5192 reset in 207 ms.
Product exploration explored 100000 steps with 5156 reset in 221 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-06-01 00:33:57] [INFO ] Computed 58 invariants in 10 ms
[2024-06-01 00:33:57] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 00:33:57] [INFO ] Invariant cache hit.
[2024-06-01 00:33:58] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2024-06-01 00:33:58] [INFO ] Redundant transitions in 1 ms returned []
Running 303 sub problems to find dead transitions.
[2024-06-01 00:33:58] [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-06-01 00:34:09] [INFO ] Deduced a trap composed of 17 places in 64 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-06-01 00:34:13] [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-06-01 00:34:16] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:34:16] [INFO ] Deduced a trap composed of 15 places in 53 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-06-01 00:34:20] [INFO ] Deduced a trap composed of 15 places in 68 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 30014 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 30020 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 60281ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60909 ms. Remains : 358/358 places, 306/306 transitions.
Treatment of property DES-PT-60b-LTLFireability-08 finished in 325254 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 1 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 52 ms. Remains 361 /478 variables (removed 117) and now considering 309/422 (removed 113) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-06-01 00:34:58] [INFO ] Computed 58 invariants in 7 ms
[2024-06-01 00:34:58] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 00:34:58] [INFO ] Invariant cache hit.
[2024-06-01 00:34:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:34:59] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-06-01 00:34:59] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 00:34:59] [INFO ] Invariant cache hit.
[2024-06-01 00:34:59] [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-06-01 00:35:13] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:35:13] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:35:14] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:35:14] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:35:15] [INFO ] Deduced a trap composed of 10 places in 80 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 30015 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 30013 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 60282ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
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 60998 ms. Remains : 361/478 places, 309/422 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-09
Product exploration explored 100000 steps with 4761 reset in 223 ms.
Product exploration explored 100000 steps with 4719 reset in 239 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 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1941 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (400 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1278181 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :0 out of 1
Probabilistic random walk after 1278181 steps, saw 175688 distinct states, run finished after 3002 ms. (steps per millisecond=425 ) properties seen :0
[2024-06-01 00:36:03] [INFO ] Invariant cache hit.
[2024-06-01 00:36:03] [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 285 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 363 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 653ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 290 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 18 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 18 ms. Remains : 360/361 places, 307/309 transitions.
RANDOM walk for 40000 steps (1854 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (384 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1289107 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :0 out of 1
Probabilistic random walk after 1289107 steps, saw 177312 distinct states, run finished after 3002 ms. (steps per millisecond=429 ) properties seen :0
// Phase 1: matrix 307 rows 360 cols
[2024-06-01 00:36:07] [INFO ] Computed 59 invariants in 10 ms
[2024-06-01 00:36:07] [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 228 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 339 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 583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 265 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-06-01 00:36:08] [INFO ] Invariant cache hit.
[2024-06-01 00:36:08] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 00:36:08] [INFO ] Invariant cache hit.
[2024-06-01 00:36:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:36:08] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-06-01 00:36:08] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-01 00:36:08] [INFO ] Invariant cache hit.
[2024-06-01 00:36:08] [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-06-01 00:36:23] [INFO ] Deduced a trap composed of 17 places in 65 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-06-01 00:36:26] [INFO ] Deduced a trap composed of 12 places in 93 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-06-01 00:36:30] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:36:31] [INFO ] Deduced a trap composed of 14 places in 90 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 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: 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-06-01 00:37:02] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:37:02] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:37:02] [INFO ] Deduced a trap composed of 19 places in 50 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 30012 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 60280ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60907 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-06-01 00:37:09] [INFO ] Computed 59 invariants in 10 ms
[2024-06-01 00:37:09] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:37:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:37:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:37:09] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:37:09] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:37:09] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 375 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 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 12 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2024-06-01 00:37:09] [INFO ] Computed 58 invariants in 9 ms
[2024-06-01 00:37:09] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 00:37:09] [INFO ] Invariant cache hit.
[2024-06-01 00:37:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:37:10] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-06-01 00:37:10] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 00:37:10] [INFO ] Invariant cache hit.
[2024-06-01 00:37:10] [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-06-01 00:37:24] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:37:25] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:37:25] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:37:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:37:26] [INFO ] Deduced a trap composed of 10 places in 81 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 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 60261ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60921 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 82 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1895 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (401 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1430640 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1430640 steps, saw 196539 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
[2024-06-01 00:38:13] [INFO ] Invariant cache hit.
[2024-06-01 00:38:13] [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 285 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 362 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 658ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 280 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 17 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 17 ms. Remains : 360/361 places, 307/309 transitions.
RANDOM walk for 40000 steps (1869 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (388 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1399943 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :0 out of 1
Probabilistic random walk after 1399943 steps, saw 192815 distinct states, run finished after 3001 ms. (steps per millisecond=466 ) properties seen :0
// Phase 1: matrix 307 rows 360 cols
[2024-06-01 00:38:17] [INFO ] Computed 59 invariants in 9 ms
[2024-06-01 00:38:17] [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 231 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 345 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 598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 264 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 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 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-06-01 00:38:18] [INFO ] Invariant cache hit.
[2024-06-01 00:38:18] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 00:38:18] [INFO ] Invariant cache hit.
[2024-06-01 00:38:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:38:19] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-06-01 00:38:19] [INFO ] Redundant transitions in 2 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-01 00:38:19] [INFO ] Invariant cache hit.
[2024-06-01 00:38:19] [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-06-01 00:38:33] [INFO ] Deduced a trap composed of 17 places in 75 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-06-01 00:38:37] [INFO ] Deduced a trap composed of 12 places in 91 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-06-01 00:38:41] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:38:42] [INFO ] Deduced a trap composed of 14 places in 95 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 30008 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-06-01 00:39:13] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:39:13] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:39:13] [INFO ] Deduced a trap composed of 19 places in 47 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 30010 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 60281ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60908 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-06-01 00:39:19] [INFO ] Computed 59 invariants in 5 ms
[2024-06-01 00:39:19] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:39:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:39:19] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-06-01 00:39:19] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:39:19] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:39:19] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 386 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4822 reset in 218 ms.
Product exploration explored 100000 steps with 4813 reset in 237 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-06-01 00:39:20] [INFO ] Computed 58 invariants in 7 ms
[2024-06-01 00:39:21] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 00:39:21] [INFO ] Invariant cache hit.
[2024-06-01 00:39:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:39:21] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-06-01 00:39:21] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 00:39:21] [INFO ] Invariant cache hit.
[2024-06-01 00:39:21] [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-06-01 00:39:35] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:39:36] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-01 00:39:36] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:39:36] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:39:37] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 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 60243ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60902 ms. Remains : 361/361 places, 309/309 transitions.
Treatment of property DES-PT-60b-LTLFireability-09 finished in 323389 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 1 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 58 ms. Remains 358 /478 variables (removed 120) and now considering 306/422 (removed 116) transitions.
// Phase 1: matrix 306 rows 358 cols
[2024-06-01 00:40:21] [INFO ] Computed 58 invariants in 7 ms
[2024-06-01 00:40:22] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 00:40:22] [INFO ] Invariant cache hit.
[2024-06-01 00:40:22] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-06-01 00:40:22] [INFO ] Redundant transitions in 2 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-01 00:40:22] [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-06-01 00:40:35] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:40:35] [INFO ] Deduced a trap composed of 17 places in 68 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30013 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 30021 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 60247ms
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 60923 ms. Remains : 358/478 places, 306/422 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-10 finished in 61016 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 23 ms. Remains 473 /478 variables (removed 5) and now considering 413/422 (removed 9) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-06-01 00:41:22] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 00:41:23] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 00:41:23] [INFO ] Invariant cache hit.
[2024-06-01 00:41:23] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:41:23] [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-06-01 00:41:34] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:41:34] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 00:41:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:41:34] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:41:34] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:41:35] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:41:35] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2024-06-01 00:41:35] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:41:35] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:41:35] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:41:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:41:35] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:41:36] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:41:37] [INFO ] Deduced a trap composed of 34 places in 71 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-06-01 00:41:50] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 00:41:50] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-06-01 00:41:50] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:41:53] [INFO ] Deduced a trap composed of 44 places in 112 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 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: 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-06-01 00:41:57] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:41:57] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:41:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:41:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:41:57] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:41:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:41:59] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 00:41:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:42:01] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:42:01] [INFO ] Deduced a trap composed of 34 places in 25 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-06-01 00:42:01] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:42:01] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:42:04] [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 30018 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 60240ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Starting structural reductions in LTL mode, iteration 1 : 473/478 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61130 ms. Remains : 473/478 places, 413/422 transitions.
Stuttering acceptance computed with spot in 116 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 865 reset in 172 ms.
Product exploration explored 100000 steps with 877 reset in 188 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.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 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (349 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (49 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1189656 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :0 out of 1
Probabilistic random walk after 1189656 steps, saw 192338 distinct states, run finished after 3002 ms. (steps per millisecond=396 ) properties seen :0
[2024-06-01 00:42:27] [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 514 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-06-01 00:42:28] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 00:42:28] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:42:28] [INFO ] Deduced a trap composed of 14 places in 52 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-06-01 00:42:28] [INFO ] Deduced a trap composed of 21 places in 28 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 876 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 1395ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 318 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 34 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 35 ms. Remains : 358/473 places, 304/413 transitions.
RANDOM walk for 40000 steps (1771 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (334 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1382872 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :0 out of 1
Probabilistic random walk after 1382872 steps, saw 187331 distinct states, run finished after 3001 ms. (steps per millisecond=460 ) properties seen :0
// Phase 1: matrix 304 rows 358 cols
[2024-06-01 00:42:32] [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 323 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 306 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 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 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 7 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 8 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 13 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-01 00:42:33] [INFO ] Invariant cache hit.
[2024-06-01 00:42:33] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 00:42:33] [INFO ] Invariant cache hit.
[2024-06-01 00:42:33] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-06-01 00:42:33] [INFO ] Redundant transitions in 2 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-01 00:42:33] [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-06-01 00:42:45] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:42:47] [INFO ] Deduced a trap composed of 16 places in 71 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-06-01 00:42:49] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:42:50] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:42:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 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 27674 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-06-01 00:43:29] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:43:29] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 726 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30022 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: 7/7 constraints]
After SMT, in 57891ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 57895ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58471 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-06-01 00:43:31] [INFO ] Invariant cache hit.
[2024-06-01 00:43:31] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-06-01 00:43:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:43:31] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:43:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:43:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:43:32] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:43:32] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:43:32] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 372 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 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 11 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-06-01 00:43:32] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 00:43:32] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 00:43:32] [INFO ] Invariant cache hit.
[2024-06-01 00:43:33] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:43:33] [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-06-01 00:43:43] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:43:44] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-06-01 00:43:44] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:43:44] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:43:44] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:43:44] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:43:44] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:43:45] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:43:45] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:43:45] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:43:45] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:43:45] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:43:46] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:43:46] [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-06-01 00:43:59] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-06-01 00:44:00] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-06-01 00:44:00] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 3 ms to minimize.
[2024-06-01 00:44:02] [INFO ] Deduced a trap composed of 44 places in 108 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 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: 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-06-01 00:44:07] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:44:07] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:44:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:44:07] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:44:07] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:44:07] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:44:07] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:44:07] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:44:08] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 00:44:11] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:44:11] [INFO ] Deduced a trap composed of 34 places in 31 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-06-01 00:44:11] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:44:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:44:14] [INFO ] Deduced a trap composed of 22 places in 38 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 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: 41/41 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Finished structural reductions in LTL mode , in 1 iterations and 61129 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 91 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 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (350 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (49 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1132225 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 1
Probabilistic random walk after 1132225 steps, saw 183795 distinct states, run finished after 3002 ms. (steps per millisecond=377 ) properties seen :0
[2024-06-01 00:44:36] [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 547 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-06-01 00:44:37] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 00:44:38] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:44:38] [INFO ] Deduced a trap composed of 14 places in 56 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-06-01 00:44:38] [INFO ] Deduced a trap composed of 21 places in 29 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 897 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 1459ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12713 steps, including 87 resets, run visited all 1 properties in 46 ms. (steps per millisecond=276 )
Parikh walk visited 1 properties in 51 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 879 reset in 174 ms.
Product exploration explored 100000 steps with 888 reset in 182 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 114 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.1 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 0 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 0 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 1 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 1 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 0 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-06-01 00:44:39] [INFO ] Redundant transitions in 2 ms returned []
Running 421 sub problems to find dead transitions.
// Phase 1: matrix 422 rows 450 cols
[2024-06-01 00:44:39] [INFO ] Computed 59 invariants in 6 ms
[2024-06-01 00:44:39] [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 24212 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 30022 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 54491ms problems are : Problem set: 113 solved, 308 unsolved
Search for dead transitions found 113 dead transitions in 54495ms
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 7 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 54562 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 6 ms. Remains 473 /473 variables (removed 0) and now considering 413/413 (removed 0) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-06-01 00:45:34] [INFO ] Computed 62 invariants in 8 ms
[2024-06-01 00:45:34] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 00:45:34] [INFO ] Invariant cache hit.
[2024-06-01 00:45:34] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:45:34] [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-06-01 00:45:45] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:45:45] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-06-01 00:45:45] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:45:46] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:45:46] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-06-01 00:45:46] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:45:46] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-06-01 00:45:46] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:45:46] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:45:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:45:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:45:47] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:45:47] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:45:48] [INFO ] Deduced a trap composed of 34 places in 70 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-06-01 00:46:01] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-06-01 00:46:01] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-06-01 00:46:01] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:46:04] [INFO ] Deduced a trap composed of 44 places in 118 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 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: 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-06-01 00:46:08] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:46:08] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:46:10] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:46:10] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:46:10] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:46:10] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:46:10] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:46:10] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:46:10] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 00:46:10] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:46:12] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:46:12] [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-06-01 00:46:13] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:46:13] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:46:16] [INFO ] Deduced a trap composed of 22 places in 40 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 30020 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 60256ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Finished structural reductions in LTL mode , in 1 iterations and 61158 ms. Remains : 473/473 places, 413/413 transitions.
Treatment of property DES-PT-60b-LTLFireability-12 finished in 312441 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 0 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 55 ms. Remains 360 /478 variables (removed 118) and now considering 308/422 (removed 114) transitions.
// Phase 1: matrix 308 rows 360 cols
[2024-06-01 00:46:35] [INFO ] Computed 58 invariants in 7 ms
[2024-06-01 00:46:35] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 00:46:35] [INFO ] Invariant cache hit.
[2024-06-01 00:46:35] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-06-01 00:46:35] [INFO ] Redundant transitions in 1 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-01 00:46: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-06-01 00:46:43] [INFO ] Deduced a trap composed of 13 places in 51 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-06-01 00:46:50] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:46:51] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 00:46:54] [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
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 30013 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 60245ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
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 60878 ms. Remains : 360/478 places, 308/422 transitions.
Stuttering acceptance computed with spot in 41 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 5372 reset in 267 ms.
Product exploration explored 100000 steps with 5407 reset in 297 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 99 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 32 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 29059 steps (1594 resets) in 178 ms. (162 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 400 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 34 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 31 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 12 ms. Remains 360 /360 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-06-01 00:47:37] [INFO ] Invariant cache hit.
[2024-06-01 00:47:37] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 00:47:37] [INFO ] Invariant cache hit.
[2024-06-01 00:47:38] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 00:47:38] [INFO ] Redundant transitions in 2 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-01 00:47:38] [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-06-01 00:47:45] [INFO ] Deduced a trap composed of 13 places in 41 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-06-01 00:47:52] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:47:52] [INFO ] Deduced a trap composed of 18 places in 86 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-06-01 00:47:56] [INFO ] Deduced a trap composed of 19 places in 67 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 30008 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 30009 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 60238ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60864 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 39 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 29401 steps (1566 resets) in 382 ms. (76 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 387 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 45 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 5364 reset in 271 ms.
Product exploration explored 100000 steps with 5438 reset in 286 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 5 ms. Remains 360 /360 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-06-01 00:48:39] [INFO ] Invariant cache hit.
[2024-06-01 00:48:39] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 00:48:39] [INFO ] Invariant cache hit.
[2024-06-01 00:48:40] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 00:48:40] [INFO ] Redundant transitions in 1 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-01 00:48:40] [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-06-01 00:48:48] [INFO ] Deduced a trap composed of 13 places in 47 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-06-01 00:48:54] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:48:55] [INFO ] Deduced a trap composed of 18 places in 84 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-06-01 00:48:59] [INFO ] Deduced a trap composed of 19 places in 67 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
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 30013 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 60244ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60861 ms. Remains : 360/360 places, 308/308 transitions.
Treatment of property DES-PT-60b-LTLFireability-13 finished in 185352 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 1 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 1 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 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 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 0 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 51 ms. Remains 358 /478 variables (removed 120) and now considering 303/422 (removed 119) transitions.
// Phase 1: matrix 303 rows 358 cols
[2024-06-01 00:49:40] [INFO ] Computed 58 invariants in 4 ms
[2024-06-01 00:49:40] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 00:49:40] [INFO ] Invariant cache hit.
[2024-06-01 00:49:41] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-06-01 00:49:41] [INFO ] Redundant transitions in 1 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 00:49:41] [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-06-01 00:49:47] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:49:47] [INFO ] Deduced a trap composed of 16 places in 77 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-06-01 00:49:58] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:49:58] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:49:59] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:49:59] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:49:59] [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-06-01 00:50:10] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
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 30015 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 60246ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
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 60911 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 23822 reset in 285 ms.
Product exploration explored 100000 steps with 23832 reset in 231 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 108 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 28 ms :[(NOT p0)]
RANDOM walk for 14 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 104 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)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-06-01 00:50:42] [INFO ] Invariant cache hit.
[2024-06-01 00:50:42] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-06-01 00:50:42] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 22 ms returned sat
[2024-06-01 00:50:44] [INFO ] [Real]Absence check using state equation in 1555 ms returned sat
[2024-06-01 00:50:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:50:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-06-01 00:50:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2024-06-01 00:50:46] [INFO ] [Nat]Absence check using state equation in 2225 ms returned sat
[2024-06-01 00:50:46] [INFO ] Computed and/alt/rep : 293/478/293 causal constraints (skipped 7 transitions) in 18 ms.
[2024-06-01 00:50:49] [INFO ] Added : 258 causal constraints over 52 iterations in 2634 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-06-01 00:50:49] [INFO ] Invariant cache hit.
[2024-06-01 00:50:49] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 00:50:49] [INFO ] Invariant cache hit.
[2024-06-01 00:50:49] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-06-01 00:50:49] [INFO ] Redundant transitions in 1 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 00:50:49] [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-06-01 00:50:56] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:50:56] [INFO ] Deduced a trap composed of 16 places in 67 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-06-01 00:51:06] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:51:06] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:51:06] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:51:07] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:51:07] [INFO ] Deduced a trap composed of 14 places in 56 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-06-01 00:51:17] [INFO ] Deduced a trap composed of 13 places in 71 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 30016 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 60238ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60842 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 130 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 15 steps (0 resets) in 4 ms. (3 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 210 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 00:51:50] [INFO ] Invariant cache hit.
[2024-06-01 00:51:50] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-06-01 00:51:50] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 28 ms returned sat
[2024-06-01 00:51:52] [INFO ] [Real]Absence check using state equation in 1549 ms returned sat
[2024-06-01 00:51:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:51:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-06-01 00:51:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2024-06-01 00:51:54] [INFO ] [Nat]Absence check using state equation in 2214 ms returned sat
[2024-06-01 00:51:54] [INFO ] Computed and/alt/rep : 293/478/293 causal constraints (skipped 7 transitions) in 19 ms.
[2024-06-01 00:51:57] [INFO ] Added : 258 causal constraints over 52 iterations in 2596 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23775 reset in 178 ms.
Product exploration explored 100000 steps with 23791 reset in 198 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-06-01 00:51:57] [INFO ] Invariant cache hit.
[2024-06-01 00:51:57] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 00:51:57] [INFO ] Invariant cache hit.
[2024-06-01 00:51:58] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2024-06-01 00:51:58] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 00:51:58] [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-06-01 00:52:04] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:52:04] [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-06-01 00:52:14] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:52:14] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:52:15] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:52:15] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:52:15] [INFO ] Deduced a trap composed of 14 places in 56 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-06-01 00:52:26] [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 30017 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 60238ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60828 ms. Remains : 358/358 places, 303/303 transitions.
Treatment of property DES-PT-60b-LTLFireability-15 finished in 197970 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 117 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 1 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 1 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 0 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 66 ms. Remains 359 /478 variables (removed 119) and now considering 307/422 (removed 115) transitions.
// Phase 1: matrix 307 rows 359 cols
[2024-06-01 00:52:59] [INFO ] Computed 58 invariants in 7 ms
[2024-06-01 00:52:59] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 00:52:59] [INFO ] Invariant cache hit.
[2024-06-01 00:53:00] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-06-01 00:53:00] [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-06-01 00:53:11] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:53:12] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-01 00:53:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 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 30014 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 30020 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 60242ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
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 60874 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 5051 reset in 217 ms.
Product exploration explored 100000 steps with 5038 reset in 223 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 88 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 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2038 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (366 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1386439 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1386439 steps, saw 187797 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
[2024-06-01 00:54:03] [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 287 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 329 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 625ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 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 13 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 13 ms. Remains : 358/359 places, 305/307 transitions.
RANDOM walk for 40000 steps (1940 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (359 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1379524 steps, run timeout after 3001 ms. (steps per millisecond=459 ) properties seen :0 out of 1
Probabilistic random walk after 1379524 steps, saw 186994 distinct states, run finished after 3001 ms. (steps per millisecond=459 ) properties seen :0
// Phase 1: matrix 305 rows 358 cols
[2024-06-01 00:54:07] [INFO ] Computed 59 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) 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 255 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-06-01 00:54:08] [INFO ] Deduced a trap composed of 13 places in 51 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 409 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 680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 191 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-06-01 00:54:08] [INFO ] Invariant cache hit.
[2024-06-01 00:54:08] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 00:54:08] [INFO ] Invariant cache hit.
[2024-06-01 00:54:09] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-06-01 00:54:09] [INFO ] Redundant transitions in 1 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-01 00:54:09] [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-06-01 00:54:20] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:54:20] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:54:20] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:54:21] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:54:22] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:54:22] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:54:22] [INFO ] Deduced a trap composed of 15 places in 85 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-06-01 00:54:30] [INFO ] Deduced a trap composed of 13 places in 63 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 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]
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 30019 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 60235ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60818 ms. Remains : 358/358 places, 305/305 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 00:55:09] [INFO ] Invariant cache hit.
[2024-06-01 00:55:09] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-06-01 00:55:09] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:55:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:55:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-06-01 00:55:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:55:09] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:55:09] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:55:09] [INFO ] After 259ms 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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 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 3 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
// Phase 1: matrix 307 rows 359 cols
[2024-06-01 00:55:10] [INFO ] Computed 58 invariants in 5 ms
[2024-06-01 00:55:10] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 00:55:10] [INFO ] Invariant cache hit.
[2024-06-01 00:55:10] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-06-01 00:55: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-06-01 00:55:22] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:55:22] [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-06-01 00:55:27] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 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 28862 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 30019 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 59103ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 59107ms
Finished structural reductions in LTL mode , in 1 iterations and 59666 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 69 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 89 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2014 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (364 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1439517 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :0 out of 1
Probabilistic random walk after 1439517 steps, saw 194368 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
[2024-06-01 00:56:13] [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 271 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 318 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 594ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 138 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 11 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 (1988 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (356 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1437320 steps, run timeout after 3001 ms. (steps per millisecond=478 ) properties seen :0 out of 1
Probabilistic random walk after 1437320 steps, saw 194080 distinct states, run finished after 3001 ms. (steps per millisecond=478 ) properties seen :0
// Phase 1: matrix 305 rows 358 cols
[2024-06-01 00:56:16] [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 258 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-06-01 00:56:17] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 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 387 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 662ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 197 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-06-01 00:56:17] [INFO ] Invariant cache hit.
[2024-06-01 00:56:17] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 00:56:17] [INFO ] Invariant cache hit.
[2024-06-01 00:56:18] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-06-01 00:56:18] [INFO ] Redundant transitions in 2 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-01 00:56:18] [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-06-01 00:56:29] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:56:29] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:56:29] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:56:30] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:56:31] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:56:31] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:56:32] [INFO ] Deduced a trap composed of 15 places in 91 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-06-01 00:56:40] [INFO ] Deduced a trap composed of 13 places in 68 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/663 variables, and 425 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30015 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
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 Int declared 663/663 variables, and 727 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30021 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 60259ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60835 ms. Remains : 358/358 places, 305/305 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 358 /358 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 00:57:18] [INFO ] Invariant cache hit.
[2024-06-01 00:57:18] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:57:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:57:18] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:57:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:57:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:57:18] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:57:18] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:57:18] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 374 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5074 reset in 211 ms.
Product exploration explored 100000 steps with 5101 reset in 219 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 130 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 11 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-06-01 00:57:20] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
// Phase 1: matrix 307 rows 359 cols
[2024-06-01 00:57:20] [INFO ] Computed 58 invariants in 4 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-06-01 00:57:33] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:57:33] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:57:34] [INFO ] Deduced a trap composed of 4 places in 46 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 24229 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-06-01 00:58:12] [INFO ] Deduced a trap composed of 6 places in 47 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 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: 4/4 constraints]
After SMT, in 54512ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 54515ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54533 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 4 ms. Remains 359 /359 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-06-01 00:58:14] [INFO ] Invariant cache hit.
[2024-06-01 00:58:14] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 00:58:14] [INFO ] Invariant cache hit.
[2024-06-01 00:58:15] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-06-01 00:58:15] [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-06-01 00:58:26] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:58:26] [INFO ] Deduced a trap composed of 13 places in 72 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-06-01 00:58:31] [INFO ] Deduced a trap composed of 15 places in 60 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 28600 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 30014 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 58835ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 58837ms
Finished structural reductions in LTL mode , in 1 iterations and 59409 ms. Remains : 359/359 places, 307/307 transitions.
Treatment of property DES-PT-60b-LTLFireability-12 finished in 374895 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-06-01 00:59:14] [INFO ] Flatten gal took : 27 ms
[2024-06-01 00:59:14] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 00:59:14] [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 3391152 ms.
There are residual formulas that ITS could not solve within timeout
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
mcc2024
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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r480-tall-171624189900756"
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 ;