About the Execution of GreatSPN+red for ShieldIIPs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13016.500 | 3600000.00 | 9678294.00 | 5461.10 | ?TTTTF?T?F?FFTFF | 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.r355-tall-171683758000091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldIIPs-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758000091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 164K May 18 16:43 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 ShieldIIPs-PT-010B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716890883015
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:08:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 10:08:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:08:04] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-28 10:08:04] [INFO ] Transformed 603 places.
[2024-05-28 10:08:04] [INFO ] Transformed 593 transitions.
[2024-05-28 10:08:04] [INFO ] Found NUPN structural information;
[2024-05-28 10:08:04] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 593/593 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 538 transition count 528
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 538 transition count 528
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 537 transition count 527
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 537 transition count 527
Applied a total of 132 rules in 129 ms. Remains 537 /603 variables (removed 66) and now considering 527/593 (removed 66) transitions.
// Phase 1: matrix 527 rows 537 cols
[2024-05-28 10:08:04] [INFO ] Computed 91 invariants in 31 ms
[2024-05-28 10:08:05] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-28 10:08:05] [INFO ] Invariant cache hit.
[2024-05-28 10:08:05] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 526 sub problems to find dead transitions.
[2024-05-28 10:08:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (OVERLAPS) 1/537 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-05-28 10:08:14] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 14 ms to minimize.
[2024-05-28 10:08:14] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:08:14] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-28 10:08:15] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-28 10:08:15] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-28 10:08:15] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-28 10:08:15] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-28 10:08:16] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-28 10:08:16] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 3 ms to minimize.
[2024-05-28 10:08:16] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-28 10:08:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:08:16] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-05-28 10:08:16] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:08:16] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:08:16] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:08:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:08:17] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-05-28 10:08:17] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 4 ms to minimize.
[2024-05-28 10:08:17] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 4 ms to minimize.
[2024-05-28 10:08:17] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-05-28 10:08:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:08:19] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:08:19] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:08:19] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:08:19] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:08:19] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-28 10:08:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2024-05-28 10:08:20] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 6 ms to minimize.
[2024-05-28 10:08:21] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-05-28 10:08:21] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-05-28 10:08:26] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 5 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-05-28 10:08:29] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2024-05-28 10:08:30] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-05-28 10:08:30] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-28 10:08:30] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:08:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:08:31] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:08:31] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-28 10:08:31] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-28 10:08:31] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:08:31] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-05-28 10:08:34] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 3 ms to minimize.
[2024-05-28 10:08:34] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-28 10:08:34] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-28 10:08:34] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:08:35] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:08:35] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:08:35] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-28 10:08:35] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:08:35] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-28 10:08:35] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:08:35] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 30154ms, After SMT, problems are : Problem set: 0 solved, 526 unsolved
Search for dead transitions found 0 dead transitions in 30173ms
Starting structural reductions in LTL mode, iteration 1 : 537/603 places, 527/593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31207 ms. Remains : 537/603 places, 527/593 transitions.
Support contains 31 out of 537 places after structural reductions.
[2024-05-28 10:08:36] [INFO ] Flatten gal took : 66 ms
[2024-05-28 10:08:36] [INFO ] Flatten gal took : 32 ms
[2024-05-28 10:08:36] [INFO ] Input system was already deterministic with 527 transitions.
Support contains 30 out of 537 places (down from 31) after GAL structural reductions.
RANDOM walk for 9271 steps (4 resets) in 615 ms. (15 steps per ms) remains 0/15 properties
Computed a total of 123 stabilizing places and 123 stable transitions
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(p0)||F((p1&&G(F(p1))))))))'
Support contains 6 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 527/527 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 534 transition count 524
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 534 transition count 524
Applied a total of 6 rules in 30 ms. Remains 534 /537 variables (removed 3) and now considering 524/527 (removed 3) transitions.
// Phase 1: matrix 524 rows 534 cols
[2024-05-28 10:08:36] [INFO ] Computed 91 invariants in 4 ms
[2024-05-28 10:08:36] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-28 10:08:36] [INFO ] Invariant cache hit.
[2024-05-28 10:08:37] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 523 sub problems to find dead transitions.
[2024-05-28 10:08:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/534 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:08:45] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:08:45] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:08:45] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-28 10:08:46] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-28 10:08:46] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-28 10:08:46] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-05-28 10:08:46] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-28 10:08:47] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 3 ms to minimize.
[2024-05-28 10:08:47] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
[2024-05-28 10:08:47] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-05-28 10:08:47] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:08:47] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:08:47] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:08:47] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-05-28 10:08:48] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:08:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:08:48] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-05-28 10:08:48] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
[2024-05-28 10:08:48] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-05-28 10:08:48] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:08:50] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
[2024-05-28 10:08:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:08:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:08:50] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 4 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 4 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:08:52] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-05-28 10:08:52] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 3 ms to minimize.
[2024-05-28 10:08:52] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 4 ms to minimize.
[2024-05-28 10:08:52] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-28 10:08:52] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:08:52] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:08:58] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:08:59] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-28 10:08:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
[2024-05-28 10:08:59] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-05-28 10:08:59] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-05-28 10:08:59] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2024-05-28 10:08:59] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2024-05-28 10:08:59] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-28 10:08:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:09:00] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:09:00] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:09:00] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:02] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:09:02] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:09:02] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:09:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:09:03] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:09:04] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:09:04] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-05-28 10:09:04] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:06] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:09:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:09:06] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:09:07] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-28 10:09:07] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:09:07] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:09:07] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:09:07] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1058 variables, and 179 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/534 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 88/179 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:13] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:09:13] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:09:13] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 3 ms to minimize.
[2024-05-28 10:09:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:09:14] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-05-28 10:09:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:09:14] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:09:14] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 3 ms to minimize.
[2024-05-28 10:09:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:09:15] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:16] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:09:16] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-28 10:09:17] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-28 10:09:17] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:09:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:09:18] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:09:18] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:09:18] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 4 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:09:19] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:09:20] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:09:20] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:21] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:09:21] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-28 10:09:21] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:09:21] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:09:21] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:09:22] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-05-28 10:09:22] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-28 10:09:22] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:09:22] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-28 10:09:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:09:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:09:23] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2024-05-28 10:09:23] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 4 ms to minimize.
[2024-05-28 10:09:24] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 4 ms to minimize.
[2024-05-28 10:09:24] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-28 10:09:24] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 3 ms to minimize.
[2024-05-28 10:09:24] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 3 ms to minimize.
[2024-05-28 10:09:25] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 4 ms to minimize.
[2024-05-28 10:09:25] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-05-28 10:09:25] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:28] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-28 10:09:28] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:09:28] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:09:29] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 3 ms to minimize.
[2024-05-28 10:09:29] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 10:09:29] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2024-05-28 10:09:30] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:09:30] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 4 ms to minimize.
[2024-05-28 10:09:30] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 3 ms to minimize.
[2024-05-28 10:09:30] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 4 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 5 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 4 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 3 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 3 ms to minimize.
[2024-05-28 10:09:33] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:36] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1058 variables, and 260 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 0/523 constraints, Known Traps: 169/169 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 534/537 places, 524/527 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60740 ms. Remains : 534/537 places, 524/527 transitions.
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-00
Product exploration explored 100000 steps with 25000 reset in 385 ms.
Product exploration explored 100000 steps with 25000 reset in 250 ms.
Computed a total of 121 stabilizing places and 121 stable transitions
Computed a total of 121 stabilizing places and 121 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 269 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 2520 steps (0 resets) in 65 ms. (38 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 524/524 transitions.
Applied a total of 0 rules in 10 ms. Remains 534 /534 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-05-28 10:09:39] [INFO ] Invariant cache hit.
[2024-05-28 10:09:39] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-28 10:09:39] [INFO ] Invariant cache hit.
[2024-05-28 10:09:40] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 523 sub problems to find dead transitions.
[2024-05-28 10:09:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/534 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:48] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-05-28 10:09:48] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:09:48] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-28 10:09:48] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-28 10:09:49] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-28 10:09:49] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-28 10:09:49] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-28 10:09:49] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 3 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:09:50] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 3 ms to minimize.
[2024-05-28 10:09:51] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:09:51] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-05-28 10:09:51] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:09:53] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:09:53] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:09:53] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:09:53] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 3 ms to minimize.
[2024-05-28 10:09:53] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-05-28 10:09:53] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:09:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 3 ms to minimize.
[2024-05-28 10:09:54] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 4 ms to minimize.
[2024-05-28 10:09:55] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 4 ms to minimize.
[2024-05-28 10:09:55] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-28 10:09:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:09:55] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:10:01] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-28 10:10:02] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:10:02] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-28 10:10:02] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-05-28 10:10:02] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:10:02] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-28 10:10:02] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-05-28 10:10:02] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-28 10:10:02] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:10:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:10:03] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:10:05] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:10:05] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:10:05] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-28 10:10:05] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-28 10:10:05] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 2 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:10:06] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:10:07] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:10:07] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:10:07] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2024-05-28 10:10:07] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:10:09] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:10:09] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:10:09] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 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 Real declared 534/1058 variables, and 179 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/534 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 88/179 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 3 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:10:19] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:10:19] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-28 10:10:20] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-28 10:10:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:10:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:10:20] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:10:21] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-28 10:10:21] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:10:21] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:10:21] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:10:21] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:10:21] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:10:21] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:10:22] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:10:22] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:10:22] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:10:22] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:10:22] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:10:22] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:10:22] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:10:23] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:10:23] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:10:23] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:10:23] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:10:24] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:10:24] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-28 10:10:24] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-28 10:10:25] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:10:25] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-05-28 10:10:25] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:10:25] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:10:26] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 4 ms to minimize.
[2024-05-28 10:10:26] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-05-28 10:10:26] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-05-28 10:10:26] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 4 ms to minimize.
[2024-05-28 10:10:27] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-28 10:10:27] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 3 ms to minimize.
[2024-05-28 10:10:27] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 4 ms to minimize.
[2024-05-28 10:10:27] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 3 ms to minimize.
[2024-05-28 10:10:27] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:10:30] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-05-28 10:10:30] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:10:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:10:31] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 3 ms to minimize.
[2024-05-28 10:10:31] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-28 10:10:32] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-05-28 10:10:32] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-05-28 10:10:32] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-28 10:10:32] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-05-28 10:10:32] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
[2024-05-28 10:10:33] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-28 10:10:33] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 3 ms to minimize.
[2024-05-28 10:10:33] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-28 10:10:33] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-28 10:10:33] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-05-28 10:10:34] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-05-28 10:10:34] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-28 10:10:34] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-05-28 10:10:34] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-28 10:10:35] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:10:38] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-05-28 10:10:40] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-28 10:10:40] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
SMT process timed out in 60257ms, After SMT, problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in LTL mode , in 1 iterations and 60828 ms. Remains : 534/534 places, 524/524 transitions.
Computed a total of 121 stabilizing places and 121 stable transitions
Computed a total of 121 stabilizing places and 121 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 8533 steps (4 resets) in 88 ms. (95 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 534/534 places, 524/524 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 534 transition count 524
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 48 place count 534 transition count 528
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 71 place count 534 transition count 528
Performed 206 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 277 places in 1 ms
Iterating global reduction 1 with 206 rules applied. Total rules applied 277 place count 534 transition count 528
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 344 place count 467 transition count 461
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 411 place count 467 transition count 461
Deduced a syphon composed of 210 places in 1 ms
Applied a total of 411 rules in 110 ms. Remains 467 /534 variables (removed 67) and now considering 461/524 (removed 63) transitions.
[2024-05-28 10:10:42] [INFO ] Redundant transitions in 79 ms returned [460]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 459 sub problems to find dead transitions.
// Phase 1: matrix 460 rows 467 cols
[2024-05-28 10:10:42] [INFO ] Computed 91 invariants in 7 ms
[2024-05-28 10:10:42] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-28 10:10:49] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD427 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 20/111 constraints. Problems are: Problem set: 85 solved, 374 unsolved
[2024-05-28 10:10:50] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-05-28 10:10:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 20/131 constraints. Problems are: Problem set: 142 solved, 317 unsolved
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/151 constraints. Problems are: Problem set: 178 solved, 281 unsolved
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
Problem TDEAD140 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:10:56] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD192 is UNSAT
[2024-05-28 10:10:57] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:10:57] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
[2024-05-28 10:10:57] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-05-28 10:10:57] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/171 constraints. Problems are: Problem set: 206 solved, 253 unsolved
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD273 is UNSAT
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD301 is UNSAT
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD328 is UNSAT
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD380 is UNSAT
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD407 is UNSAT
[2024-05-28 10:11:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD433 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 19/190 constraints. Problems are: Problem set: 214 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/190 constraints. Problems are: Problem set: 214 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 460/927 variables, 467/657 constraints. Problems are: Problem set: 214 solved, 245 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 3/660 constraints. Problems are: Problem set: 214 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/660 constraints. Problems are: Problem set: 214 solved, 245 unsolved
[2024-05-28 10:11:09] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/927 variables, 1/661 constraints. Problems are: Problem set: 214 solved, 245 unsolved
[2024-05-28 10:11:13] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 214 solved, 245 unsolved
Search for dead transitions found 214 dead transitions in 30134ms
Found 214 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 214 transitions
Dead transitions reduction (with SMT) removed 214 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 467/534 places, 246/524 transitions.
Graph (complete) has 885 edges and 467 vertex of which 257 are kept as prefixes of interest. Removing 210 places using SCC suffix rule.2 ms
Discarding 210 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 257 /467 variables (removed 210) and now considering 246/246 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/534 places, 246/524 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30353 ms. Remains : 257/534 places, 246/524 transitions.
Support contains 6 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 524/524 transitions.
Applied a total of 0 rules in 9 ms. Remains 534 /534 variables (removed 0) and now considering 524/524 (removed 0) transitions.
// Phase 1: matrix 524 rows 534 cols
[2024-05-28 10:11:13] [INFO ] Computed 91 invariants in 8 ms
[2024-05-28 10:11:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 10:11:13] [INFO ] Invariant cache hit.
[2024-05-28 10:11:13] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 523 sub problems to find dead transitions.
[2024-05-28 10:11:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/534 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:11:21] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:11:21] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:11:22] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-28 10:11:22] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-28 10:11:22] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-28 10:11:22] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-28 10:11:22] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-28 10:11:23] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-28 10:11:23] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2024-05-28 10:11:23] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-05-28 10:11:23] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:11:23] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:11:23] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:11:24] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 3 ms to minimize.
[2024-05-28 10:11:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:11:24] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:11:24] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2024-05-28 10:11:24] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
[2024-05-28 10:11:24] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-05-28 10:11:25] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:11:28] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-05-28 10:11:28] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-05-28 10:11:28] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 3 ms to minimize.
[2024-05-28 10:11:28] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-28 10:11:28] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:11:28] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:11:34] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 2 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-05-28 10:11:36] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:11:36] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:11:36] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:11:36] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:11:38] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-28 10:11:38] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:11:38] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:11:39] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:11:40] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:11:40] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:11:40] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2024-05-28 10:11:40] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:11:42] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:11:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:11:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:11:43] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-28 10:11:43] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:11:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:11:43] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:11:43] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:11:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:11:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 30081ms
Finished structural reductions in LTL mode , in 1 iterations and 30610 ms. Remains : 534/534 places, 524/524 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-00 finished in 187141 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)||X(F((p1||G(F(p2))))))))'
Support contains 5 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 527/527 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 534 transition count 524
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 534 transition count 524
Applied a total of 6 rules in 15 ms. Remains 534 /537 variables (removed 3) and now considering 524/527 (removed 3) transitions.
// Phase 1: matrix 524 rows 534 cols
[2024-05-28 10:11:43] [INFO ] Computed 91 invariants in 10 ms
[2024-05-28 10:11:43] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-28 10:11:43] [INFO ] Invariant cache hit.
[2024-05-28 10:11:44] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 523 sub problems to find dead transitions.
[2024-05-28 10:11:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/534 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:11:52] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:11:52] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 2 ms to minimize.
[2024-05-28 10:11:52] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-05-28 10:11:53] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-28 10:11:53] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-28 10:11:53] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-28 10:11:53] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 3 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 3 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 6 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:11:54] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:11:55] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:11:55] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:11:55] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 3 ms to minimize.
[2024-05-28 10:11:55] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:11:57] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 3 ms to minimize.
[2024-05-28 10:11:57] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
[2024-05-28 10:11:57] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:11:59] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:11:59] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:11:59] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:12:04] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-28 10:12:04] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-28 10:12:05] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 4 ms to minimize.
[2024-05-28 10:12:05] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-05-28 10:12:05] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 3 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-28 10:12:07] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:12:07] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-28 10:12:07] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:12:07] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:12:07] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:12:07] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:12:08] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-05-28 10:12:09] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 3 ms to minimize.
[2024-05-28 10:12:09] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:12:10] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-28 10:12:10] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-28 10:12:10] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:12:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:12:10] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 3 ms to minimize.
[2024-05-28 10:12:10] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:12:10] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 3 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:12:13] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2024-05-28 10:12:13] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-05-28 10:12:14] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-28 10:12:14] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
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 1.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 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)timeout
(s339 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1058 variables, and 175 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/534 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 84/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:12:19] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:12:20] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:12:20] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:12:20] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-28 10:12:20] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-28 10:12:21] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:12:21] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-28 10:12:21] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:12:21] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:12:21] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:12:22] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:12:23] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:12:26] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 3 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-28 10:12:27] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:12:30] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:12:31] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:12:31] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:12:31] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:12:31] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-28 10:12:31] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-28 10:12:31] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-28 10:12:31] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-28 10:12:33] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:12:35] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:12:36] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-28 10:12:36] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-28 10:12:36] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:12:36] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 3 ms to minimize.
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 10:12:40] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:12:43] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-28 10:12:43] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-28 10:12:43] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-28 10:12:43] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-28 10:12:43] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-28 10:12:43] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-28 10:12:43] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-28 10:12:44] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:12:44] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-28 10:12:44] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:12:44] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1058 variables, and 271 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 0/523 constraints, Known Traps: 180/180 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 534/537 places, 524/527 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60666 ms. Remains : 534/537 places, 524/527 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-01 finished in 61187 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(G(p0)))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 527/527 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 532 transition count 522
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 532 transition count 522
Applied a total of 10 rules in 22 ms. Remains 532 /537 variables (removed 5) and now considering 522/527 (removed 5) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 10:12:44] [INFO ] Computed 91 invariants in 5 ms
[2024-05-28 10:12:45] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-28 10:12:45] [INFO ] Invariant cache hit.
[2024-05-28 10:12:45] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 10:12:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:12:53] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:12:53] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
[2024-05-28 10:12:54] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-28 10:12:54] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-28 10:12:54] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-28 10:12:54] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-28 10:12:54] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-28 10:12:55] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-05-28 10:12:55] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 3 ms to minimize.
[2024-05-28 10:12:55] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-28 10:12:55] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2024-05-28 10:12:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:12:55] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:12:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:12:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:12:56] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-28 10:12:56] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 4 ms to minimize.
[2024-05-28 10:12:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:12:56] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:12:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:12:58] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:12:58] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:12:58] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:12:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:12:58] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:12:58] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:12:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 4 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:12:59] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:13:00] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:13:00] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:13:05] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2024-05-28 10:13:05] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-28 10:13:06] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-05-28 10:13:06] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 4 ms to minimize.
[2024-05-28 10:13:06] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-28 10:13:06] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:13:06] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:13:06] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:13:07] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:13:07] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-28 10:13:07] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:13:07] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:13:07] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-28 10:13:07] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-28 10:13:07] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:13:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:13:08] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:13:08] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:13:08] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:13:08] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:13:10] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2024-05-28 10:13:10] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:13:11] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:12] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-05-28 10:13:12] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-28 10:13:12] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:13:12] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-28 10:13:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:13:12] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:13:12] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-28 10:13:12] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-28 10:13:13] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-05-28 10:13:13] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 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 1.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 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.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 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1054 variables, and 171 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:13:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:13:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:13:21] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 3 ms to minimize.
[2024-05-28 10:13:21] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-28 10:13:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:13:21] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2024-05-28 10:13:22] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2024-05-28 10:13:22] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:13:22] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:22] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-28 10:13:22] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-28 10:13:23] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-28 10:13:23] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:13:23] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:13:23] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:13:23] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-28 10:13:23] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:13:23] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:13:23] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-28 10:13:24] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:13:25] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-28 10:13:25] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:13:25] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-28 10:13:26] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:28] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:13:28] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:13:28] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:13:28] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:28] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:13:28] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:13:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:13:31] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-28 10:13:31] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:31] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 3 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:13:32] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-28 10:13:33] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-28 10:13:33] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-28 10:13:33] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-28 10:13:33] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-28 10:13:33] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-28 10:13:33] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:13:35] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-28 10:13:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:13:36] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:13:36] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:37] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-28 10:13:37] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:13:37] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:13:37] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-28 10:13:37] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-28 10:13:37] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-28 10:13:38] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-28 10:13:39] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:13:41] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:13:41] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-28 10:13:42] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:13:42] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:13:42] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:13:43] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-28 10:13:43] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-28 10:13:43] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-28 10:13:43] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:13:43] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-28 10:13:43] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:13:43] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-28 10:13:44] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-28 10:13:44] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-28 10:13:44] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:13:44] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:44] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:13:44] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:13:44] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:13:44] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 521 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 532/1054 variables, and 271 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/521 constraints, Known Traps: 180/180 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 522/527 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60650 ms. Remains : 532/537 places, 522/527 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 242 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-05 finished in 60766 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 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 527/527 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 536 transition count 475
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 485 transition count 475
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 485 transition count 424
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 434 transition count 424
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 429 transition count 419
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 429 transition count 419
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 214 place count 429 transition count 416
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 426 transition count 416
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 560 place count 256 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 254 transition count 244
Applied a total of 562 rules in 83 ms. Remains 254 /537 variables (removed 283) and now considering 244/527 (removed 283) transitions.
// Phase 1: matrix 244 rows 254 cols
[2024-05-28 10:13:45] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 10:13:45] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 10:13:45] [INFO ] Invariant cache hit.
[2024-05-28 10:13:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 10:13:46] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-28 10:13:46] [INFO ] Redundant transitions in 36 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 243 rows 254 cols
[2024-05-28 10:13:46] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 10:13:46] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:13:47] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:13:48] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:13:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:13:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:13:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:13:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:13:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:13:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:13:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:13:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:13:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:13:50] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:13:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:13:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:13:53] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:13:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:13:54] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:13:54] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:13:54] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:13:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:13:54] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:13:54] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:13:55] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:13:56] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 243/497 variables, 254/390 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:02] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:14:02] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:14:02] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:14:02] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:14:02] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:14:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:14:03] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:14:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/497 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:07] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:14:09] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:14:10] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:12] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:14:12] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:14:12] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:14:12] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/497 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:13] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:14:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/497 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 412 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 62/139 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:16] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 2/254 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 243/497 variables, 254/410 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 241/654 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:30] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/497 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:14:42] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 657 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 68/68 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in SI_LTL mode, iteration 1 : 254/537 places, 243/527 transitions.
Applied a total of 0 rules in 14 ms. Remains 254 /254 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60592 ms. Remains : 254/537 places, 243/527 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-06
Product exploration explored 100000 steps with 377 reset in 380 ms.
Product exploration explored 100000 steps with 424 reset in 495 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/254 stabilizing places and 4/243 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 : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 3 factoid took 166 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 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 506 steps (1 resets) in 6 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 243/243 transitions.
Applied a total of 0 rules in 12 ms. Remains 254 /254 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:14:47] [INFO ] Invariant cache hit.
[2024-05-28 10:14:48] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 10:14:48] [INFO ] Invariant cache hit.
[2024-05-28 10:14:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 10:14:48] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-28 10:14:48] [INFO ] Redundant transitions in 32 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-28 10:14:48] [INFO ] Invariant cache hit.
[2024-05-28 10:14:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:14:49] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:14:50] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:14:51] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:14:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:14:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:14:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:14:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:14:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:14:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:14:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:52] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:14:52] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:14:52] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:14:52] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:14:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:14:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:14:52] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:14:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:55] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:14:55] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:14:55] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:14:56] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:14:56] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:14:56] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:14:56] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:14:56] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:14:57] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:14:57] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:14:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:14:57] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:14:58] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:14:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:14:58] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:14:58] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:14:58] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 243/497 variables, 254/400 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:15:03] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:15:04] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:15:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:15:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:15:04] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 6/409 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:15:04] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:15:04] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:15:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:15:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:15:05] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:15:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:15:05] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 8/417 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:09] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:09] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:15:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:15:09] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:15:10] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:15:10] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:15:10] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:15:10] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:15:11] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:12] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:15:12] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/497 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 241 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 497/497 variables, and 428 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 74/151 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:18] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 2/254 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:21] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 243/497 variables, 254/427 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 241/671 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:15:28] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:15:29] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:15:30] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:15:30] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:15:31] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 6/677 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:15:45] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:15:45] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:15:47] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 681 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 92/92 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60491 ms. Remains : 254/254 places, 243/243 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/254 stabilizing places and 4/243 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 : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 3 factoid took 177 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 187 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 397 reset in 367 ms.
Product exploration explored 100000 steps with 406 reset in 409 ms.
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 243/243 transitions.
Applied a total of 0 rules in 6 ms. Remains 254 /254 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:15:49] [INFO ] Invariant cache hit.
[2024-05-28 10:15:50] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-28 10:15:50] [INFO ] Invariant cache hit.
[2024-05-28 10:15:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 10:15:50] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-28 10:15:50] [INFO ] Redundant transitions in 35 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-28 10:15:50] [INFO ] Invariant cache hit.
[2024-05-28 10:15:50] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:51] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:15:51] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:15:51] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-28 10:15:51] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 10:15:51] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:15:51] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 10:15:51] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:15:52] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:15:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:15:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:15:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:15:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:15:58] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:15:58] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:15:58] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 10:15:58] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:15:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:15:58] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:15:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:15:59] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:15:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:15:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:00] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:16:00] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:16:00] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:16:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:16:00] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 243/497 variables, 254/400 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:16:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:16:06] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:16:06] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:16:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:16:06] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 6/409 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:06] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 8/417 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:11] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:11] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:16:13] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:16:14] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/497 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 428 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 74/151 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:20] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 2/254 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:23] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 243/497 variables, 254/427 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 241/671 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:16:30] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:16:31] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:16:32] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:16:32] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:16:34] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 6/677 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 10:16:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:16:48] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:16:48] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:16:49] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 681 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 92/92 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60619 ms. Remains : 254/254 places, 243/243 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-06 finished in 184793 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((F(p0)||X(p1))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 527/527 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 532 transition count 522
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 532 transition count 522
Applied a total of 10 rules in 18 ms. Remains 532 /537 variables (removed 5) and now considering 522/527 (removed 5) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 10:16:50] [INFO ] Computed 91 invariants in 4 ms
[2024-05-28 10:16:50] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-28 10:16:50] [INFO ] Invariant cache hit.
[2024-05-28 10:16:51] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 10:16:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:16:59] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:16:59] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:16:59] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:16:59] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 3 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-28 10:17:02] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 4 ms to minimize.
[2024-05-28 10:17:02] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:17:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:17:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:17:03] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:17:03] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:17:04] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:17:05] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:17:11] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-05-28 10:17:11] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-28 10:17:11] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-05-28 10:17:11] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 3 ms to minimize.
[2024-05-28 10:17:11] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 4 ms to minimize.
[2024-05-28 10:17:12] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-28 10:17:12] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:17:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:17:12] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:17:12] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-28 10:17:12] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:17:12] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:17:13] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-28 10:17:13] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-28 10:17:13] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:17:13] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:17:13] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:17:13] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:17:13] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:17:13] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:17:16] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 4 ms to minimize.
[2024-05-28 10:17:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:17:16] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-28 10:17:16] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:17:16] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:17:16] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:17:16] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 10:17:16] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:17:17] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:17:17] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:17:17] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-28 10:17:17] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-28 10:17:17] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:17:17] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-28 10:17:17] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:17:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:17:18] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-28 10:17:18] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-28 10:17:18] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-05-28 10:17:18] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:17:20] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:17:21] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-28 10:17:21] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-28 10:17:21] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30096ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 522/527 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30656 ms. Remains : 532/537 places, 522/527 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-07 finished in 31312 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 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 527/527 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 536 transition count 476
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 486 transition count 476
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 100 place count 486 transition count 425
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 202 place count 435 transition count 425
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 206 place count 431 transition count 421
Iterating global reduction 2 with 4 rules applied. Total rules applied 210 place count 431 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 210 place count 431 transition count 419
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 214 place count 429 transition count 419
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 560 place count 256 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 254 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 253 transition count 244
Applied a total of 563 rules in 51 ms. Remains 253 /537 variables (removed 284) and now considering 244/527 (removed 283) transitions.
// Phase 1: matrix 244 rows 253 cols
[2024-05-28 10:17:21] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 10:17:22] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 10:17:22] [INFO ] Invariant cache hit.
[2024-05-28 10:17:22] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-28 10:17:22] [INFO ] Redundant transitions in 36 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 240 sub problems to find dead transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 10:17:22] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:17:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:17:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:17:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:17:24] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:17:24] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:17:24] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:17:24] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:17:24] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:17:24] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:25] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:17:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:17:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:17:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:17:26] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:17:26] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:17:26] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:26] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:28] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 2/253 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:31] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:17:31] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:17:31] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:17:31] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:17:31] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:17:32] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:17:33] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:17:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:17:33] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:33] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:17:33] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:17:33] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:17:33] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:17:34] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:17:34] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:17:34] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 243/496 variables, 253/399 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:37] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:17:37] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:17:37] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:17:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:17:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:17:37] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:17:37] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 9/408 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:39] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:17:39] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:17:39] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:17:40] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:17:40] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:17:41] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 6/414 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:43] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:17:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:17:46] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:17:46] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 13/429 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:46] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:17:47] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:17:47] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:17:47] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:17:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:17:47] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:17:47] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:17:48] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:17:50] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:17:50] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:17:50] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:17:50] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:17:51] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 443 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 97/181 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 2/253 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:53] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:17:54] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/445 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 240/685 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:17:59] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:17:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:17:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/688 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 688 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 105/105 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 253/537 places, 243/527 transitions.
Applied a total of 0 rules in 6 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60473 ms. Remains : 253/537 places, 243/527 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-08
Product exploration explored 100000 steps with 501 reset in 378 ms.
Product exploration explored 100000 steps with 485 reset in 417 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/253 stabilizing places and 4/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 202 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 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 558 steps (1 resets) in 8 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 228 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 11 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:18:23] [INFO ] Invariant cache hit.
[2024-05-28 10:18:24] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 10:18:24] [INFO ] Invariant cache hit.
[2024-05-28 10:18:24] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-28 10:18:24] [INFO ] Redundant transitions in 33 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-28 10:18:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:18:25] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:18:26] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:18:26] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:18:26] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:18:26] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:18:26] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:18:26] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:18:26] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:18:26] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:18:27] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:27] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:18:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:18:28] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:18:28] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:18:28] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:18:28] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:18:28] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:28] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:30] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 2/253 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:33] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:18:33] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:18:33] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:18:34] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:18:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:18:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:18:35] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:18:35] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:18:35] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:18:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:18:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:18:36] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:18:36] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:37] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 243/496 variables, 253/399 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:18:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:18:40] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:18:40] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:18:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:18:41] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:18:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:18:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:18:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:18:41] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 10/409 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:44] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:18:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:18:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:18:44] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:18:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:18:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:46] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:18:46] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:18:46] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:18:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:18:48] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:18:48] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:18:48] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:53] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:18:53] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:18:53] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:18:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:18:53] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:18:53] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:18:53] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 430 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 86/170 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:18:54] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 2/253 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/431 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 240/671 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:00] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:19:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 673 constraints, problems are : Problem set: 0 solved, 240 unsolved in 28682 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 90/90 constraints]
After SMT, in 58728ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 58730ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59120 ms. Remains : 253/253 places, 243/243 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/253 stabilizing places and 4/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 213 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)]
RANDOM walk for 559 steps (1 resets) in 7 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 190 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 445 reset in 344 ms.
Product exploration explored 100000 steps with 540 reset in 387 ms.
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:19:24] [INFO ] Invariant cache hit.
[2024-05-28 10:19:24] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 10:19:24] [INFO ] Invariant cache hit.
[2024-05-28 10:19:24] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-28 10:19:24] [INFO ] Redundant transitions in 32 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-28 10:19:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:19:26] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:19:27] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:19:27] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:19:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:19:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:27] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:19:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:19:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:19:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:19:28] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:19:28] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:19:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:29] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:31] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 2/253 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:34] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:19:34] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:19:34] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:19:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:19:34] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-28 10:19:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:36] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:19:36] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:19:36] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:19:36] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:19:36] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:19:36] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:37] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 243/496 variables, 253/399 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:40] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:19:41] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 10:19:41] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:19:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:19:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:19:41] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:19:41] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:19:42] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:19:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:19:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 10/409 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:19:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:19:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:19:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:19:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:19:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:46] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:19:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:19:47] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:19:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:48] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:19:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:19:49] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:19:49] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:19:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:19:53] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:19:53] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:19:53] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:19:53] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:19:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:19:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 431 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 87/171 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:19:55] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 2/253 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/432 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 240/672 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:20:02] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:20:05] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 240 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 496/496 variables, and 674 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 91/91 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60462 ms. Remains : 253/253 places, 243/243 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-08 finished in 183184 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 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 527/527 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 536 transition count 475
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 485 transition count 475
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 102 place count 485 transition count 425
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 202 place count 435 transition count 425
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 207 place count 430 transition count 420
Iterating global reduction 2 with 5 rules applied. Total rules applied 212 place count 430 transition count 420
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 212 place count 430 transition count 417
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 218 place count 427 transition count 417
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 564 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 566 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 567 place count 251 transition count 242
Applied a total of 567 rules in 47 ms. Remains 251 /537 variables (removed 286) and now considering 242/527 (removed 285) transitions.
// Phase 1: matrix 242 rows 251 cols
[2024-05-28 10:20:25] [INFO ] Computed 90 invariants in 2 ms
[2024-05-28 10:20:25] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 10:20:25] [INFO ] Invariant cache hit.
[2024-05-28 10:20:25] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-28 10:20:25] [INFO ] Redundant transitions in 31 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 239 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 10:20:25] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 10:20:26] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:20:27] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:20:28] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:28] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:20:28] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:20:28] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:20:28] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:20:29] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:20:30] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:20:30] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 1/251 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:33] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:20:33] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:20:34] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:20:34] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 241/492 variables, 251/382 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:37] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:20:37] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:20:37] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:20:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:20:38] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:20:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 6/388 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:40] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:20:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:20:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:20:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:20:40] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:20:41] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 6/394 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:20:42] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:20:42] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:20:42] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:20:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:44] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:20:44] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:20:44] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:20:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:20:45] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:20:45] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 6/405 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:47] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:20:48] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:50] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:20:51] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:20:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:20:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/492 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:20:54] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:20:54] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 414 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 68/157 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:20:57] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 241/492 variables, 251/415 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 239/654 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:01] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:13] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:21:19] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 657 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 77/77 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/537 places, 241/527 transitions.
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60507 ms. Remains : 251/537 places, 241/527 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-10
Product exploration explored 100000 steps with 2416 reset in 295 ms.
Product exploration explored 100000 steps with 2367 reset in 339 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 188 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)]
RANDOM walk for 27 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 204 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 10:21:26] [INFO ] Invariant cache hit.
[2024-05-28 10:21:27] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 10:21:27] [INFO ] Invariant cache hit.
[2024-05-28 10:21:27] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-28 10:21:27] [INFO ] Redundant transitions in 32 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-28 10:21:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:21:28] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:21:29] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 10:21:30] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:30] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:21:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:21:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:21:30] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:21:30] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:21:30] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 10:21:31] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:21:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:21:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:21:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:21:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:21:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:21:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:31] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:21:32] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:21:32] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:21:34] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 1/251 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:37] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:21:38] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:38] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:21:38] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:21:39] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (OVERLAPS) 241/492 variables, 251/384 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:42] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:21:42] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:21:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:21:42] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:21:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:21:43] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:21:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:44] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 10:21:44] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:21:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:21:44] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:21:44] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:21:44] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:21:44] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:21:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:21:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:21:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:21:45] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 11/402 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:47] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:21:48] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:21:48] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:21:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:49] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:21:50] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:21:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:51] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:21:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:21:55] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:21:57] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:21:57] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:21:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 417 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 71/160 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:21:57] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-28 10:21:57] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 1/251 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 241/492 variables, 251/419 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 239/658 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:22:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:22:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 3/661 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:17] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 662 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 82/82 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60470 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 205 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 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2408 reset in 299 ms.
Product exploration explored 100000 steps with 2391 reset in 332 ms.
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 11 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 10:22:28] [INFO ] Invariant cache hit.
[2024-05-28 10:22:28] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 10:22:28] [INFO ] Invariant cache hit.
[2024-05-28 10:22:29] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-28 10:22:29] [INFO ] Redundant transitions in 29 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-28 10:22:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:22:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:31] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:22:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:22:32] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:22:32] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:22:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:22:32] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:22:32] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:22:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:22:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:22:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:22:33] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:22:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:22:33] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:33] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:22:33] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:22:34] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:36] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:22:36] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 1/251 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:39] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:22:40] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:40] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:22:40] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:22:40] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (OVERLAPS) 241/492 variables, 251/384 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:44] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:22:44] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:22:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:22:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:22:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:22:45] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:22:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:22:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:22:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:22:47] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 11/402 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:49] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:22:50] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:22:50] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:22:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:51] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:22:52] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:22:52] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:56] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:22:57] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:22:57] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 10:22:58] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:22:59] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:22:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:22:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
SMT process timed out in 30042ms, After SMT, problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 30045ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30440 ms. Remains : 251/251 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-10 finished in 154274 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((X(p0) U p0))||G(p1)))||!(p2 U p3)))'
Support contains 7 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 527/527 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 532 transition count 522
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 532 transition count 522
Applied a total of 10 rules in 19 ms. Remains 532 /537 variables (removed 5) and now considering 522/527 (removed 5) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-05-28 10:22:59] [INFO ] Computed 91 invariants in 5 ms
[2024-05-28 10:22:59] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-28 10:22:59] [INFO ] Invariant cache hit.
[2024-05-28 10:22:59] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-05-28 10:22:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:23:08] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:23:08] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:23:08] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-28 10:23:08] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-28 10:23:08] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-28 10:23:09] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-28 10:23:09] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-28 10:23:09] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-28 10:23:09] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
[2024-05-28 10:23:10] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-28 10:23:10] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 3 ms to minimize.
[2024-05-28 10:23:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:23:10] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:23:10] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:23:10] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:23:10] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-28 10:23:11] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2024-05-28 10:23:11] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:23:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:23:11] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:23:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-28 10:23:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:23:13] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:23:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:23:14] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:23:14] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:23:14] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:23:14] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:23:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:23:14] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:23:14] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:23:19] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-28 10:23:20] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-28 10:23:20] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 3 ms to minimize.
[2024-05-28 10:23:20] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 3 ms to minimize.
[2024-05-28 10:23:20] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 4 ms to minimize.
[2024-05-28 10:23:21] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:23:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:23:21] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:23:21] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:23:21] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-28 10:23:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:23:21] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:23:22] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-28 10:23:22] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 10:23:22] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:23:22] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:23:22] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:23:22] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-28 10:23:22] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:23:22] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:23:25] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-28 10:23:25] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 10:23:25] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 3 ms to minimize.
[2024-05-28 10:23:25] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:23:25] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:23:25] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-28 10:23:25] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 10:23:25] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-28 10:23:26] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:23:26] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:23:26] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-28 10:23:26] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 3 ms to minimize.
[2024-05-28 10:23:26] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:23:26] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-28 10:23:26] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:23:26] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:23:27] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-28 10:23:27] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-28 10:23:27] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 3 ms to minimize.
[2024-05-28 10:23:27] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-05-28 10:23:30] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30117ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 522/527 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30701 ms. Remains : 532/537 places, 522/527 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-15
Stuttering criterion allowed to conclude after 5425 steps with 3 reset in 34 ms.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-15 finished in 30918 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(p0)||F((p1&&G(F(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' '!(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' '!(G(F(p0)))'
[2024-05-28 10:23:30] [INFO ] Flatten gal took : 31 ms
[2024-05-28 10:23:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-28 10:23:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 537 places, 527 transitions and 1654 arcs took 5 ms.
Total runtime 926415 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldIIPs-PT-010B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 537
TRANSITIONS: 527
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 7316
MODEL NAME: /home/mcc/execution/411/model
537 places, 527 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-010B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-010B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758000091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010B.tgz
mv ShieldIIPs-PT-010B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;