About the Execution of ITS-Tools for ShieldPPPs-PT-003B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16203.680 | 3497874.00 | 5897488.00 | 7761.70 | FFFFFF?TTTFFT?TF | 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.r356-tall-171683761000395.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 itstools
Input is ShieldPPPs-PT-003B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761000395
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 52K 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 ShieldPPPs-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716954416206
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 03:46:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:46:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:46:57] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-29 03:46:57] [INFO ] Transformed 207 places.
[2024-05-29 03:46:57] [INFO ] Transformed 192 transitions.
[2024-05-29 03:46:57] [INFO ] Found NUPN structural information;
[2024-05-29 03:46:57] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 190 transition count 175
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 190 transition count 175
Applied a total of 34 rules in 37 ms. Remains 190 /207 variables (removed 17) and now considering 175/192 (removed 17) transitions.
// Phase 1: matrix 175 rows 190 cols
[2024-05-29 03:46:57] [INFO ] Computed 34 invariants in 7 ms
[2024-05-29 03:46:57] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-29 03:46:57] [INFO ] Invariant cache hit.
[2024-05-29 03:46:58] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-29 03:46:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:46:59] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 10 ms to minimize.
[2024-05-29 03:46:59] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:46:59] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:46:59] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:46:59] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:46:59] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:47:00] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:47:01] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:47:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 4 ms to minimize.
[2024-05-29 03:47:02] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:47:02] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:47:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:47:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:47:02] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:47:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:47:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:04] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-29 03:47:04] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:47:04] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:47:05] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-05-29 03:47:06] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:06] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 3 ms to minimize.
[2024-05-29 03:47:06] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:07] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:47:07] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:47:07] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:47:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 175/365 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:09] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:47:09] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:47:09] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:47:09] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:47:09] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:47:10] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:47:10] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:47:10] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:47:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:47:10] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:47:10] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 11/297 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:47:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:47:11] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:47:12] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:47:12] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 5/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:12] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:47:13] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:47:14] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:47:14] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:47:14] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:16] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:47:17] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:47:17] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:47:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:47:17] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/365 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:18] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:47:18] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:47:18] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:47:18] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:47:18] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:20] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/365 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 21 (OVERLAPS) 0/365 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 319 constraints, problems are : Problem set: 0 solved, 174 unsolved in 25843 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:24] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:47:25] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:47:25] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:47:25] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:25] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:47:26] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:47:26] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:47:26] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:47:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:47:26] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:47:26] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:26] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:47:27] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:47:27] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:47:27] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:47:27] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/365 variables, 190/335 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 174/509 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:29] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:47:30] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:47:31] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-29 03:47:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:47:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:47:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:47:31] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 15/524 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:35] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:47:36] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:47:36] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:47:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:41] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:46] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:47:47] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-29 03:47:52] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 532 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 134/134 constraints]
After SMT, in 55934ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 55947ms
Starting structural reductions in LTL mode, iteration 1 : 190/207 places, 175/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56432 ms. Remains : 190/207 places, 175/192 transitions.
Support contains 18 out of 190 places after structural reductions.
[2024-05-29 03:47:54] [INFO ] Flatten gal took : 34 ms
[2024-05-29 03:47:54] [INFO ] Flatten gal took : 16 ms
[2024-05-29 03:47:54] [INFO ] Input system was already deterministic with 175 transitions.
RANDOM walk for 1309 steps (0 resets) in 126 ms. (10 steps per ms) remains 0/11 properties
Computed a total of 39 stabilizing places and 39 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(G(p0))))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 186 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 185 transition count 170
Applied a total of 10 rules in 14 ms. Remains 185 /190 variables (removed 5) and now considering 170/175 (removed 5) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 03:47:54] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 03:47:54] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 03:47:54] [INFO ] Invariant cache hit.
[2024-05-29 03:47:54] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:47:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:47:55] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:47:56] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:47:57] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:47:57] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:47:57] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:47:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:47:57] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:47:57] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:47:58] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:47:58] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:47:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-29 03:47:58] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-29 03:47:58] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:47:58] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:47:58] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:00] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:48:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:48:00] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:48:01] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:48:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:48:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:48:01] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:48:01] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:48:01] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:01] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:02] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:48:02] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:48:02] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:48:02] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:48:02] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:48:02] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:48:02] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:48:02] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:48:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:48:03] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:48:03] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:48:04] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:48:04] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:48:04] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:48:05] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:48:06] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:48:07] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:07] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:09] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:10] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:48:10] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:13] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:48:13] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21714 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:17] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:48:17] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:48:17] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:20] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:48:20] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:48:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:48:20] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:48:20] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:48:21] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:48:21] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:48:21] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:24] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:48:24] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:48:24] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:48:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:48:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:29] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:34] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:48:34] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:38] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:48:43] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:48:43] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51755ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51757ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 170/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51971 ms. Remains : 185/190 places, 170/175 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-01 finished in 52278 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 U p1)||F(p2)||(p0&&F(G(p3)))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 189 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 189 transition count 174
Applied a total of 2 rules in 13 ms. Remains 189 /190 variables (removed 1) and now considering 174/175 (removed 1) transitions.
// Phase 1: matrix 174 rows 189 cols
[2024-05-29 03:48:46] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 03:48:46] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 03:48:46] [INFO ] Invariant cache hit.
[2024-05-29 03:48:47] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-29 03:48:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:48:48] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:48:49] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
[2024-05-29 03:48:50] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:48:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:50] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:48:50] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:48:51] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 13/79 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:52] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:48:52] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:52] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:54] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 174/363 variables, 189/272 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 9/281 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:58] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:48:58] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:48:58] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:48:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:48:58] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:48:59] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:00] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:49:00] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:49:00] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:49:00] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:02] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:02] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:49:03] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:49:04] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:05] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:49:05] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/363 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:06] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:49:06] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:49:07] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:49:07] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/363 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:08] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:49:08] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/363 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:09] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:49:10] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/363 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:10] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:49:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:49:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:49:10] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/363 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:12] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/363 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/363 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 24 (OVERLAPS) 0/363 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 312 constraints, problems are : Problem set: 0 solved, 173 unsolved in 29111 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 89/123 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:17] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:49:17] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:49:17] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:49:17] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:49:17] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:17] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:49:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:49:18] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:49:18] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:49:18] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:49:18] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:49:18] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:49:18] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 174/363 variables, 189/325 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 173/498 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:49:21] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-29 03:49:21] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:49:21] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:27] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:49:27] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:49:27] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:49:27] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:49:27] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:49:28] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:49:28] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:49:28] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 8/510 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-29 03:49:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/363 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 173 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 363/363 variables, and 511 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 115/115 constraints]
After SMT, in 59144ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 59146ms
Starting structural reductions in LTL mode, iteration 1 : 189/190 places, 174/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59350 ms. Remains : 189/190 places, 174/175 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-06
Product exploration explored 100000 steps with 191 reset in 323 ms.
Product exploration explored 100000 steps with 188 reset in 275 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/189 stabilizing places and 38/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 126 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (70 resets) in 415 ms. (96 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
[2024-05-29 03:49:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/189 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/363 variables, 189/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/189 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:49:47] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:49:47] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 174/363 variables, 189/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:49:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:49:47] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:49:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:49:47] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:49:47] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 5/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 528ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 174/174 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 189 transition count 153
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 168 transition count 153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 168 transition count 137
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 151 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 76 place count 151 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 150 transition count 135
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 102 transition count 87
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 197 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 101 transition count 86
Applied a total of 198 rules in 36 ms. Remains 101 /189 variables (removed 88) and now considering 86/174 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 101/189 places, 86/174 transitions.
RANDOM walk for 40000 steps (8 resets) in 508 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2173286 steps, run timeout after 3001 ms. (steps per millisecond=724 ) properties seen :0 out of 1
Probabilistic random walk after 2173286 steps, saw 393386 distinct states, run finished after 3005 ms. (steps per millisecond=723 ) properties seen :0
// Phase 1: matrix 86 rows 101 cols
[2024-05-29 03:49:51] [INFO ] Computed 34 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/54 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/118 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/154 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/177 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/179 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/179 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/179 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/180 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/187 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/187 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/187 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/187 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/54 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:49:51] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/56 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/118 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 36/154 variables, 25/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/177 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:49:51] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:49:53] [INFO ] Deduced a trap composed of 5 places in 1509 ms of which 28 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/179 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/179 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/179 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/180 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/180 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/180 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/187 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/187 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/187 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/187 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1861ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-29 03:49:53] [INFO ] Invariant cache hit.
[2024-05-29 03:49:53] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-29 03:49:53] [INFO ] Invariant cache hit.
[2024-05-29 03:49:53] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-29 03:49:53] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-29 03:49:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:49:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 86/187 variables, 101/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:49:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:49:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:49:55] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:49:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:49:55] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:49:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:49:55] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:49:56] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/187 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:49:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:49:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2024-05-29 03:49:56] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:49:56] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:49:57] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/187 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:49:57] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:49:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:49:57] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:49:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 17 (OVERLAPS) 0/187 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 168 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5446 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 2/101 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 86/187 variables, 101/168 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 82/250 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 250 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3335 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 33/33 constraints]
After SMT, in 8799ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 8800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9130 ms. Remains : 101/101 places, 86/86 transitions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 403 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 188 transition count 153
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 168 transition count 153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 40 place count 168 transition count 137
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 152 transition count 137
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 162 place count 107 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 105 transition count 90
Applied a total of 164 rules in 48 ms. Remains 105 /189 variables (removed 84) and now considering 90/174 (removed 84) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 03:50:03] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:50:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 03:50:03] [INFO ] Invariant cache hit.
[2024-05-29 03:50:03] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-29 03:50:03] [INFO ] Redundant transitions in 2 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-29 03:50:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:03] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:50:03] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:50:03] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:50:03] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-29 03:50:03] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-05-29 03:50:03] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:50:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:50:03] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 90/195 variables, 105/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:50:04] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:50:05] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:50:05] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:50:05] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:06] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:50:06] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:50:07] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/195 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 166 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4404 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/105 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 90/195 variables, 105/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 86/252 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 252 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2690 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 27/27 constraints]
After SMT, in 7105ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 7107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/189 places, 90/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7376 ms. Remains : 105/189 places, 90/174 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p3), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 258 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (155 resets) in 126 ms. (314 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40003 steps (27 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
[2024-05-29 03:50:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/70 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/132 variables, 70/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/154 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/158 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/184 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/186 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/188 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/195 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/195 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/195 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/195 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/70 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:50:11] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:50:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:50:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:50:11] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/132 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/154 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:50:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/158 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 26/184 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/184 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/184 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/186 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/186 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/188 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/188 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/188 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/195 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/195 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 11 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 101/105 places, 86/90 transitions.
RANDOM walk for 40000 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2300701 steps, run timeout after 3001 ms. (steps per millisecond=766 ) properties seen :0 out of 1
Probabilistic random walk after 2300701 steps, saw 407960 distinct states, run finished after 3001 ms. (steps per millisecond=766 ) properties seen :0
// Phase 1: matrix 86 rows 101 cols
[2024-05-29 03:50:14] [INFO ] Computed 34 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/54 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/117 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 35/152 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/177 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/178 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/178 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/178 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/180 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/180 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/187 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/187 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/187 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/187 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/54 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:50:14] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/56 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 61/117 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/152 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:50:14] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:50:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:50:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/154 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/177 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/177 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/177 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/178 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/178 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/178 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/180 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/180 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/180 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 7/187 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/187 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:50:14] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/187 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/187 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/187 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-29 03:50:14] [INFO ] Invariant cache hit.
[2024-05-29 03:50:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 03:50:14] [INFO ] Invariant cache hit.
[2024-05-29 03:50:14] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-29 03:50:14] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-29 03:50:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:50:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:50:16] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:50:16] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 86/187 variables, 101/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:50:16] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:50:16] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:50:16] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:50:16] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:50:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:50:16] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:50:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/187 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 157 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3078 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 2/101 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 86/187 variables, 101/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 82/239 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:50:19] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:50:19] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:50:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:50:19] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:50:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/187 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:50:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:50:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:50:27] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:50:27] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/187 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 16 (OVERLAPS) 0/187 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 248 constraints, problems are : Problem set: 0 solved, 82 unsolved in 14605 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 31/31 constraints]
After SMT, in 17696ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 17697ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17856 ms. Remains : 101/101 places, 86/86 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p3), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 16 factoid took 537 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 422 reset in 199 ms.
Product exploration explored 100000 steps with 419 reset in 229 ms.
Built C files in :
/tmp/ltsmin7022216993829717206
[2024-05-29 03:50:34] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 03:50:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:50:34] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 03:50:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:50:34] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 03:50:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:50:34] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7022216993829717206
Running compilation step : cd /tmp/ltsmin7022216993829717206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 344 ms.
Running link step : cd /tmp/ltsmin7022216993829717206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7022216993829717206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17233783867683149416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 03:50:49] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:50:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 03:50:49] [INFO ] Invariant cache hit.
[2024-05-29 03:50:49] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-29 03:50:49] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-29 03:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:49] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 1 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 90/195 variables, 105/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:50] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:50:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:50:51] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:50:51] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:50:51] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:50:51] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:52] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:52] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:50:52] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:50:53] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:50:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/195 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 166 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4462 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/105 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 90/195 variables, 105/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 86/252 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 252 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2725 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 27/27 constraints]
After SMT, in 7196ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 7198ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7346 ms. Remains : 105/105 places, 90/90 transitions.
Built C files in :
/tmp/ltsmin9024484185369894225
[2024-05-29 03:50:56] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 03:50:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:50:56] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 03:50:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:50:56] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 03:50:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:50:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9024484185369894225
Running compilation step : cd /tmp/ltsmin9024484185369894225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin9024484185369894225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9024484185369894225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17536973326434808078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:51:11] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:51:11] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:51:11] [INFO ] Time to serialize gal into /tmp/LTL513687537679336188.gal : 2 ms
[2024-05-29 03:51:11] [INFO ] Time to serialize properties into /tmp/LTL6606937276094432084.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL513687537679336188.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8064024508801909146.hoa' '-atoms' '/tmp/LTL6606937276094432084.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6606937276094432084.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8064024508801909146.hoa
Detected timeout of ITS tools.
[2024-05-29 03:51:26] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:51:26] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:51:26] [INFO ] Time to serialize gal into /tmp/LTL17716278109637622067.gal : 4 ms
[2024-05-29 03:51:26] [INFO ] Time to serialize properties into /tmp/LTL7844333805766908476.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17716278109637622067.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7844333805766908476.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||((F(G("((p173==0)||(p3==1))")))&&("((p76==0)||(p31==1)...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
Detected timeout of ITS tools.
[2024-05-29 03:51:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:51:42] [INFO ] Applying decomposition
[2024-05-29 03:51:42] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12493228597561419676.txt' '-o' '/tmp/graph12493228597561419676.bin' '-w' '/tmp/graph12493228597561419676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12493228597561419676.bin' '-l' '-1' '-v' '-w' '/tmp/graph12493228597561419676.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:51:42] [INFO ] Decomposing Gal with order
[2024-05-29 03:51:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:51:42] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-29 03:51:42] [INFO ] Flatten gal took : 32 ms
[2024-05-29 03:51:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2024-05-29 03:51:42] [INFO ] Time to serialize gal into /tmp/LTL13974063614643046943.gal : 3 ms
[2024-05-29 03:51:42] [INFO ] Time to serialize properties into /tmp/LTL8542686431195062246.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13974063614643046943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8542686431195062246.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((i3.i0.u12.p76==0)||(i0.u7.p31==1))")U("((i2.u11.p66==0)||(i3.i0.u21.p114==1))"))||(F("(i3.i0.u13.p79==1)")))||((F(G("((i7...235
Formula 0 simplified : XF((!"((i3.i0.u12.p76==0)||(i0.u7.p31==1))" R !"((i2.u11.p66==0)||(i3.i0.u21.p114==1))") & G!"(i3.i0.u13.p79==1)" & (!"((i3.i0.u12.p...222
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-06 finished in 190374 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((X(p1)||p0))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 172
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 186 transition count 171
Applied a total of 8 rules in 4 ms. Remains 186 /190 variables (removed 4) and now considering 171/175 (removed 4) transitions.
// Phase 1: matrix 171 rows 186 cols
[2024-05-29 03:51:57] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:51:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 03:51:57] [INFO ] Invariant cache hit.
[2024-05-29 03:51:57] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-29 03:51:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:51:58] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:51:59] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:52:00] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:52:00] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:52:00] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:52:00] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:52:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/357 variables, 186/270 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:52:04] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:05] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:52:05] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:52:05] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:52:05] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:52:05] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:07] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:52:07] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:52:07] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:52:07] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:52:07] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/357 variables, 14/291 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:09] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:52:09] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:52:09] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:52:09] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:52:09] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:52:09] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:52:10] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:52:10] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:52:10] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:52:10] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:12] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:52:12] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:52:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:52:12] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/357 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:16] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:52:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/357 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:17] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 19 (OVERLAPS) 0/357 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 309 constraints, problems are : Problem set: 0 solved, 170 unsolved in 23429 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 89/123 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:22] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:52:22] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/357 variables, 186/312 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 170/482 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:52:25] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:52:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:52:26] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:52:26] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:52:26] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:52:26] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:52:26] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:52:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:52:26] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:52:27] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:52:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:52:28] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 13/495 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:34] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:52:34] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:52:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:52:35] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:52:36] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 5/500 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:52:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:52:46] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:52:46] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 503 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 113/113 constraints]
After SMT, in 53463ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 53464ms
Starting structural reductions in LTL mode, iteration 1 : 186/190 places, 171/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53711 ms. Remains : 186/190 places, 171/175 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-003B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-09 finished in 54108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0) U p1)))))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 186 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 185 transition count 170
Applied a total of 10 rules in 5 ms. Remains 185 /190 variables (removed 5) and now considering 170/175 (removed 5) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 03:52:51] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 03:52:51] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 03:52:51] [INFO ] Invariant cache hit.
[2024-05-29 03:52:51] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:52:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:52:54] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:52:54] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:52:54] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:52:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:52:55] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:52:55] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:52:55] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:52:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:52:55] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:52:55] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:52:57] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:52:57] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:52:57] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:52:57] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:52:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:52:57] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:52:57] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:52:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:52:58] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:52:58] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:52:58] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:52:58] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:52:59] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:52:59] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:52:59] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:52:59] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:52:59] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:52:59] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:00] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:53:00] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:53:00] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:53:00] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:53:00] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:53:00] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:53:00] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:01] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:53:02] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:03] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:53:03] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:53:03] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:04] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:05] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:07] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:53:07] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:09] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:53:09] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21654 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:14] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:53:14] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:53:14] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:16] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:53:16] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:53:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:53:17] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:53:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:53:17] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:53:17] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:53:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:53:18] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:21] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:53:21] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:53:21] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:53:21] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:53:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:26] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:30] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:53:30] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:35] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:40] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:53:40] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51677ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51678ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 170/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51856 ms. Remains : 185/190 places, 170/175 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-10 finished in 52127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(p1)))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 186 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 185 transition count 170
Applied a total of 10 rules in 14 ms. Remains 185 /190 variables (removed 5) and now considering 170/175 (removed 5) transitions.
[2024-05-29 03:53:43] [INFO ] Invariant cache hit.
[2024-05-29 03:53:43] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 03:53:43] [INFO ] Invariant cache hit.
[2024-05-29 03:53:43] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:53:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:53:44] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:53:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:53:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:53:44] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:53:45] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:46] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:53:46] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:53:46] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:53:46] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:53:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:53:46] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:47] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:53:47] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:53:47] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:53:47] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:53:47] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:53:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:53:47] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:49] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:53:49] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:53:49] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:53:49] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:53:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:53:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:53:50] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:53:50] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:53:50] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:50] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:53:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:53:51] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:53:51] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:53:51] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:53:51] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:53:51] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:53:51] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:53:51] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:53:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:53:52] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:53:52] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:53:52] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:53:52] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:53:52] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:54] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-29 03:53:54] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:55] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:53:55] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:53:55] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:56] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:58] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:53:59] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:53:59] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:54:01] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21446 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:05] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:54:05] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:54:06] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:08] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:54:08] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:54:08] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:54:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:54:09] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:54:09] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:54:09] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:54:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:54:10] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:13] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:54:13] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:13] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:54:13] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:54:13] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:22] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:54:22] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:27] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:32] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:54:32] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51475ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51477ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 170/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51660 ms. Remains : 185/190 places, 170/175 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-13
Product exploration explored 100000 steps with 24948 reset in 104 ms.
Product exploration explored 100000 steps with 25106 reset in 110 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 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 : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 2858 steps (4 resets) in 15 ms. (178 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-29 03:54:36] [INFO ] Invariant cache hit.
[2024-05-29 03:54:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 03:54:36] [INFO ] Invariant cache hit.
[2024-05-29 03:54:36] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:54:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:37] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:54:37] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:37] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:40] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:54:40] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-05-29 03:54:40] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:54:40] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:54:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:54:40] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:42] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:54:42] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:54:42] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:54:42] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:54:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:54:43] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:54:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:54:43] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:43] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:54:43] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:54:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:54:44] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:54:44] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:54:44] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:44] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:54:44] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:54:44] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:54:45] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:54:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:45] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:54:45] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:54:45] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:45] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:54:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:54:48] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:54:48] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:49] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:50] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:52] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:54:52] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:54:54] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21175 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:54:58] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:54:58] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:58] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:01] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:55:01] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:55:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:55:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:55:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:55:02] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:55:02] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:55:02] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:55:02] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:06] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:55:06] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:55:06] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:55:06] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:55:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:11] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:15] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:55:15] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:20] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:24] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 03:55:24] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51202ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51204ms
Finished structural reductions in LTL mode , in 1 iterations and 51382 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 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 : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 1610 steps (2 resets) in 18 ms. (84 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 24976 reset in 84 ms.
Product exploration explored 100000 steps with 24987 reset in 82 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 185 transition count 170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 88 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 111 place count 162 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 134 place count 162 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 134 rules in 28 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2024-05-29 03:55:29] [INFO ] Redundant transitions in 3 ms returned []
Running 147 sub problems to find dead transitions.
// Phase 1: matrix 148 rows 162 cols
[2024-05-29 03:55:29] [INFO ] Computed 34 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 5 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 TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/54 constraints. Problems are: Problem set: 59 solved, 88 unsolved
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 8/62 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/62 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 148/310 variables, 162/224 constraints. Problems are: Problem set: 66 solved, 81 unsolved
[2024-05-29 03:55:32] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:55:32] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/226 constraints. Problems are: Problem set: 66 solved, 81 unsolved
[2024-05-29 03:55:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/227 constraints. Problems are: Problem set: 66 solved, 81 unsolved
[2024-05-29 03:55:33] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/228 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/228 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/228 constraints. Problems are: Problem set: 66 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 228 constraints, problems are : Problem set: 66 solved, 81 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 66 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 66/162 variables, 34/34 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 32/66 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/66 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 148/310 variables, 162/228 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 81/309 constraints. Problems are: Problem set: 66 solved, 81 unsolved
[2024-05-29 03:55:36] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 1/310 constraints. Problems are: Problem set: 66 solved, 81 unsolved
[2024-05-29 03:55:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/311 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/311 constraints. Problems are: Problem set: 66 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/311 constraints. Problems are: Problem set: 66 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 311 constraints, problems are : Problem set: 66 solved, 81 unsolved in 14930 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 81/147 constraints, Known Traps: 34/34 constraints]
After SMT, in 19958ms problems are : Problem set: 66 solved, 81 unsolved
Search for dead transitions found 66 dead transitions in 19959ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/185 places, 82/170 transitions.
Graph (complete) has 249 edges and 162 vertex of which 97 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.4 ms
Discarding 65 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 97 /162 variables (removed 65) and now considering 82/82 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/185 places, 82/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20014 ms. Remains : 97/185 places, 82/170 transitions.
Built C files in :
/tmp/ltsmin18030701054668803559
[2024-05-29 03:55:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18030701054668803559
Running compilation step : cd /tmp/ltsmin18030701054668803559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin18030701054668803559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18030701054668803559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11331817187545245878.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 03:56:05] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 03:56:05] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 03:56:05] [INFO ] Invariant cache hit.
[2024-05-29 03:56:05] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:56:06] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:56:07] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:08] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:56:08] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:56:09] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-29 03:56:09] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:56:09] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:56:09] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:56:09] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:11] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:56:11] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:56:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:56:11] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:56:11] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:56:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:56:11] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:56:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:56:12] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:12] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:56:12] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:56:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:56:13] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:56:13] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:56:13] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:56:13] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:56:13] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:56:13] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:56:17] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:56:18] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:56:20] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:21] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:22] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:23] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:56:23] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:26] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:56:26] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 24504 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:30] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-29 03:56:30] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:56:30] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:33] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:56:33] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:56:33] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:56:33] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:56:38] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:56:38] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:56:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:56:38] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:43] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:47] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:56:47] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:52] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:57] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-29 03:56:57] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 54535ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 54536ms
Finished structural reductions in LTL mode , in 1 iterations and 54737 ms. Remains : 185/185 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin1185992960528703755
[2024-05-29 03:56:59] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1185992960528703755
Running compilation step : cd /tmp/ltsmin1185992960528703755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 309 ms.
Running link step : cd /tmp/ltsmin1185992960528703755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1185992960528703755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11683989617721680100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:57:14] [INFO ] Flatten gal took : 25 ms
[2024-05-29 03:57:14] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:57:14] [INFO ] Time to serialize gal into /tmp/LTL12899840415447741056.gal : 2 ms
[2024-05-29 03:57:14] [INFO ] Time to serialize properties into /tmp/LTL15663075432620959711.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12899840415447741056.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5832084705946599200.hoa' '-atoms' '/tmp/LTL15663075432620959711.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15663075432620959711.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5832084705946599200.hoa
Detected timeout of ITS tools.
[2024-05-29 03:57:30] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:57:30] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:57:30] [INFO ] Time to serialize gal into /tmp/LTL9919682245437903400.gal : 2 ms
[2024-05-29 03:57:30] [INFO ] Time to serialize properties into /tmp/LTL12127936549130404979.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9919682245437903400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12127936549130404979.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((p19==0)||(p16==1))"))U(X(X("((p153==0)||(p24==1))"))))))
Formula 0 simplified : F(G!"((p19==0)||(p16==1))" R XX!"((p153==0)||(p24==1))")
Detected timeout of ITS tools.
[2024-05-29 03:57:45] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:57:45] [INFO ] Applying decomposition
[2024-05-29 03:57:45] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2338063412267077754.txt' '-o' '/tmp/graph2338063412267077754.bin' '-w' '/tmp/graph2338063412267077754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2338063412267077754.bin' '-l' '-1' '-v' '-w' '/tmp/graph2338063412267077754.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:57:45] [INFO ] Decomposing Gal with order
[2024-05-29 03:57:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:57:45] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 03:57:45] [INFO ] Flatten gal took : 23 ms
[2024-05-29 03:57:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:57:45] [INFO ] Time to serialize gal into /tmp/LTL2083546703492550036.gal : 3 ms
[2024-05-29 03:57:45] [INFO ] Time to serialize properties into /tmp/LTL252293517249862357.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2083546703492550036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL252293517249862357.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G((F("((i4.i0.u7.p19==0)||(i4.i1.u5.p16==1))"))U(X(X("((i10.i2.u55.p153==0)||(i3.i0.u9.p24==1))"))))))
Formula 0 simplified : F(G!"((i4.i0.u7.p19==0)||(i4.i1.u5.p16==1))" R XX!"((i10.i2.u55.p153==0)||(i3.i0.u9.p24==1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-13 finished in 256820 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 U p1)||F(p2)||(p0&&F(G(p3)))))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-003B-LTLCardinality-06
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 189 transition count 154
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 169 transition count 154
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 40 place count 169 transition count 138
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 153 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 152 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 152 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 74 place count 152 transition count 136
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 151 transition count 136
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 164 place count 107 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 105 transition count 90
Applied a total of 166 rules in 22 ms. Remains 105 /190 variables (removed 85) and now considering 90/175 (removed 85) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 03:58:00] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:58:00] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 03:58:00] [INFO ] Invariant cache hit.
[2024-05-29 03:58:00] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-29 03:58:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:58:01] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 90/195 variables, 105/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:02] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:58:02] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:58:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:58:02] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:58:02] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:02] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:58:02] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:58:02] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 162 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3317 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/105 variables, 22/43 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 90/195 variables, 105/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 86/248 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:05] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:06] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 250 constraints, problems are : Problem set: 0 solved, 86 unsolved in 10101 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 25/25 constraints]
After SMT, in 13428ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 13429ms
Starting structural reductions in LI_LTL mode, iteration 1 : 105/190 places, 90/175 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13588 ms. Remains : 105/190 places, 90/175 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-06
Product exploration explored 100000 steps with 426 reset in 185 ms.
Product exploration explored 100000 steps with 422 reset in 203 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 248 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (155 resets) in 124 ms. (320 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2024-05-29 03:58:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/70 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/132 variables, 70/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/154 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/158 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/184 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/186 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/188 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/195 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/195 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/195 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/195 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/70 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:58:15] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:58:15] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:58:15] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/132 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/154 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:15] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/158 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 26/184 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/184 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/184 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/186 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/186 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/188 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/188 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/188 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/195 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/195 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 9 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 101/105 places, 86/90 transitions.
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2297271 steps, run timeout after 3001 ms. (steps per millisecond=765 ) properties seen :0 out of 1
Probabilistic random walk after 2297271 steps, saw 401934 distinct states, run finished after 3002 ms. (steps per millisecond=765 ) properties seen :0
// Phase 1: matrix 86 rows 101 cols
[2024-05-29 03:58:18] [INFO ] Computed 34 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/54 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/117 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 35/152 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/177 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/178 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/178 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/178 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/180 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/180 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/187 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/187 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/187 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/187 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/54 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/56 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 61/117 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/152 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/154 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/177 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/177 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/177 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/178 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/178 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/178 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/180 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/180 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/180 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 7/187 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/187 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/187 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/187 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-29 03:58:18] [INFO ] Invariant cache hit.
[2024-05-29 03:58:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 03:58:19] [INFO ] Invariant cache hit.
[2024-05-29 03:58:19] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-29 03:58:19] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-29 03:58:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 86/187 variables, 101/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:21] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:58:21] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:58:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 157 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2847 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 2/101 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 86/187 variables, 101/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 82/239 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:22] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:58:22] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:58:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:24] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:58:24] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 246 constraints, problems are : Problem set: 0 solved, 82 unsolved in 8978 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 29/29 constraints]
After SMT, in 11838ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 11839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11988 ms. Remains : 101/101 places, 86/86 transitions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 492 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 03:58:31] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:58:31] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 03:58:31] [INFO ] Invariant cache hit.
[2024-05-29 03:58:31] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-29 03:58:31] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-29 03:58:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 1 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 1 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 90/195 variables, 105/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:33] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:58:33] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:58:33] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:58:33] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:58:33] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:33] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:58:33] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 1 ms to minimize.
[2024-05-29 03:58:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 162 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3183 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/105 variables, 22/43 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 90/195 variables, 105/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 86/248 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:58:37] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 250 constraints, problems are : Problem set: 0 solved, 86 unsolved in 10126 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 25/25 constraints]
After SMT, in 13319ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 13319ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13450 ms. Remains : 105/105 places, 90/90 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p3), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 336 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (151 resets) in 117 ms. (338 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40002 steps (29 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-29 03:58:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/70 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/132 variables, 70/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/154 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/158 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/184 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/186 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/188 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/195 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/195 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/195 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/195 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/70 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:45] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:58:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:58:46] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:58:46] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/132 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/154 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:46] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/158 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 26/184 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/184 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/184 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/186 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/186 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/188 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/188 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/188 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/195 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/195 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 6 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/105 places, 86/90 transitions.
RANDOM walk for 40000 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2366545 steps, run timeout after 3001 ms. (steps per millisecond=788 ) properties seen :0 out of 1
Probabilistic random walk after 2366545 steps, saw 414390 distinct states, run finished after 3001 ms. (steps per millisecond=788 ) properties seen :0
// Phase 1: matrix 86 rows 101 cols
[2024-05-29 03:58:49] [INFO ] Computed 34 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/54 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/117 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 35/152 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/177 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/178 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/178 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/178 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/180 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/180 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/187 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/187 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/187 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/187 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/54 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:49] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/56 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 61/117 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/152 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:49] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:58:49] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:58:49] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/154 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/177 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/177 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:49] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/177 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/178 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/178 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:58:49] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/178 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/180 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/180 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/180 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 7/187 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/187 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/187 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/187 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-29 03:58:49] [INFO ] Invariant cache hit.
[2024-05-29 03:58:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 03:58:49] [INFO ] Invariant cache hit.
[2024-05-29 03:58:49] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-29 03:58:49] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-29 03:58:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:58:50] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 86/187 variables, 101/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:58:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:58:51] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 03:58:51] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:51] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:58:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:58:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 157 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2842 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 2/101 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 86/187 variables, 101/157 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 82/239 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:53] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:58:53] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:58:53] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:58:54] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:58:55] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 03:58:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 246 constraints, problems are : Problem set: 0 solved, 82 unsolved in 8881 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 29/29 constraints]
After SMT, in 11735ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 11736ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11888 ms. Remains : 101/101 places, 86/86 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p3), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 16 factoid took 515 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 420 reset in 206 ms.
Product exploration explored 100000 steps with 422 reset in 221 ms.
Built C files in :
/tmp/ltsmin2408940876785916212
[2024-05-29 03:59:03] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 03:59:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:59:03] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 03:59:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:59:03] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 03:59:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:59:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2408940876785916212
Running compilation step : cd /tmp/ltsmin2408940876785916212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin2408940876785916212;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2408940876785916212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6110157190843926406.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 14 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 03:59:18] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:59:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 03:59:18] [INFO ] Invariant cache hit.
[2024-05-29 03:59:18] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-29 03:59:18] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-29 03:59:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 90/195 variables, 105/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:59:20] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:59:20] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:59:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:59:20] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 162 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3270 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/105 variables, 22/43 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 90/195 variables, 105/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 86/248 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:59:22] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-29 03:59:24] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 250 constraints, problems are : Problem set: 0 solved, 86 unsolved in 10322 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 25/25 constraints]
After SMT, in 13602ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 13603ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13768 ms. Remains : 105/105 places, 90/90 transitions.
Built C files in :
/tmp/ltsmin2078217999372432362
[2024-05-29 03:59:31] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 03:59:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:59:31] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 03:59:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:59:31] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 03:59:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:59:31] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2078217999372432362
Running compilation step : cd /tmp/ltsmin2078217999372432362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin2078217999372432362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2078217999372432362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13379163658486738149.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:59:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 03:59:47] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:59:47] [INFO ] Time to serialize gal into /tmp/LTL12417289099761315794.gal : 1 ms
[2024-05-29 03:59:47] [INFO ] Time to serialize properties into /tmp/LTL16158347215278968498.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12417289099761315794.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7314124278480077952.hoa' '-atoms' '/tmp/LTL16158347215278968498.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16158347215278968498.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7314124278480077952.hoa
Detected timeout of ITS tools.
[2024-05-29 04:00:02] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:00:02] [INFO ] Flatten gal took : 3 ms
[2024-05-29 04:00:02] [INFO ] Time to serialize gal into /tmp/LTL15279203245080603208.gal : 1 ms
[2024-05-29 04:00:02] [INFO ] Time to serialize properties into /tmp/LTL17684238287357384226.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15279203245080603208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17684238287357384226.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||((F(G("((p173==0)||(p3==1))")))&&("((p76==0)||(p31==1)...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
Detected timeout of ITS tools.
[2024-05-29 04:00:17] [INFO ] Flatten gal took : 10 ms
[2024-05-29 04:00:17] [INFO ] Applying decomposition
[2024-05-29 04:00:17] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6257640521631317057.txt' '-o' '/tmp/graph6257640521631317057.bin' '-w' '/tmp/graph6257640521631317057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6257640521631317057.bin' '-l' '-1' '-v' '-w' '/tmp/graph6257640521631317057.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:00:17] [INFO ] Decomposing Gal with order
[2024-05-29 04:00:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:00:17] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-29 04:00:17] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:00:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 1 ms.
[2024-05-29 04:00:17] [INFO ] Time to serialize gal into /tmp/LTL9516973905933532606.gal : 1 ms
[2024-05-29 04:00:17] [INFO ] Time to serialize properties into /tmp/LTL9063949161180821117.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9516973905933532606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9063949161180821117.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((i3.i0.u12.p76==0)||(i2.u6.p31==1))")U("((i2.u11.p66==0)||(i3.i1.u22.p114==1))"))||(F("(i3.i0.u13.p79==1)")))||((F(G("((i7...235
Formula 0 simplified : XF((!"((i3.i0.u12.p76==0)||(i2.u6.p31==1))" R !"((i2.u11.p66==0)||(i3.i1.u22.p114==1))") & G!"(i3.i0.u13.p79==1)" & (!"((i3.i0.u12.p...222
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-06 finished in 151964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(p1)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-003B-LTLCardinality-13
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 189 transition count 152
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 167 transition count 152
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 167 transition count 136
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 151 transition count 136
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 147 transition count 132
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 147 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 84 place count 147 transition count 129
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 90 place count 144 transition count 129
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 182 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 96 transition count 81
Applied a total of 184 rules in 17 ms. Remains 96 /190 variables (removed 94) and now considering 81/175 (removed 94) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-29 04:00:32] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 04:00:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 04:00:32] [INFO ] Invariant cache hit.
[2024-05-29 04:00:32] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-29 04:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 130 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 78/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 208 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4353 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 5593ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5593ms
Starting structural reductions in LI_LTL mode, iteration 1 : 96/190 places, 81/175 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5747 ms. Remains : 96/190 places, 81/175 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-13
Product exploration explored 100000 steps with 24981 reset in 107 ms.
Product exploration explored 100000 steps with 24969 reset in 120 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 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 : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 3224 steps (12 resets) in 16 ms. (189 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 04:00:39] [INFO ] Invariant cache hit.
[2024-05-29 04:00:39] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 04:00:39] [INFO ] Invariant cache hit.
[2024-05-29 04:00:39] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-29 04:00:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 130 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 78/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 208 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4301 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 5571ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5573ms
Finished structural reductions in LTL mode , in 1 iterations and 5697 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 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 : []
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 568 steps (0 resets) in 7 ms. (71 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25010 reset in 121 ms.
Product exploration explored 100000 steps with 24969 reset in 130 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 04:00:47] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-29 04:00:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 130 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 78/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 208 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4252 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 5528ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5538 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin10760648439639770373
[2024-05-29 04:00:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10760648439639770373
Running compilation step : cd /tmp/ltsmin10760648439639770373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin10760648439639770373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10760648439639770373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14407229444909323579.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 04:01:07] [INFO ] Invariant cache hit.
[2024-05-29 04:01:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 04:01:08] [INFO ] Invariant cache hit.
[2024-05-29 04:01:08] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-29 04:01:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 130 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 78/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 208 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4331 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 5558ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5559ms
Finished structural reductions in LTL mode , in 1 iterations and 5711 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin12451126292285410454
[2024-05-29 04:01:13] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12451126292285410454
Running compilation step : cd /tmp/ltsmin12451126292285410454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 192 ms.
Running link step : cd /tmp/ltsmin12451126292285410454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12451126292285410454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16077777214125286905.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:01:28] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:01:28] [INFO ] Flatten gal took : 3 ms
[2024-05-29 04:01:28] [INFO ] Time to serialize gal into /tmp/LTL3268695128567466202.gal : 1 ms
[2024-05-29 04:01:28] [INFO ] Time to serialize properties into /tmp/LTL9550006036204319964.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3268695128567466202.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1220520535638208071.hoa' '-atoms' '/tmp/LTL9550006036204319964.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9550006036204319964.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1220520535638208071.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t119, t2.t113, t4, t5, t7, t8, t10, t12, t13.t92, t14.t89, t15.t86, t17, t18, t20, t21, t2...521
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:01:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:01:43] [INFO ] Flatten gal took : 3 ms
[2024-05-29 04:01:43] [INFO ] Time to serialize gal into /tmp/LTL15478080788516625626.gal : 1 ms
[2024-05-29 04:01:43] [INFO ] Time to serialize properties into /tmp/LTL645510439036985260.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15478080788516625626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL645510439036985260.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((p19==0)||(p16==1))"))U(X(X("((p153==0)||(p24==1))"))))))
Formula 0 simplified : F(G!"((p19==0)||(p16==1))" R XX!"((p153==0)||(p24==1))")
Reverse transition relation is NOT exact ! Due to transitions t0.t119, t2.t113, t4, t5, t7, t8, t10, t12, t13.t92, t14.t89, t15.t86, t17, t18, t20, t21, t2...521
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:01:58] [INFO ] Flatten gal took : 10 ms
[2024-05-29 04:01:58] [INFO ] Applying decomposition
[2024-05-29 04:01:58] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3510902726022701352.txt' '-o' '/tmp/graph3510902726022701352.bin' '-w' '/tmp/graph3510902726022701352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3510902726022701352.bin' '-l' '-1' '-v' '-w' '/tmp/graph3510902726022701352.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:01:58] [INFO ] Decomposing Gal with order
[2024-05-29 04:01:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:01:58] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-29 04:01:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:01:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 2 ms.
[2024-05-29 04:01:58] [INFO ] Time to serialize gal into /tmp/LTL11060296945217261719.gal : 2 ms
[2024-05-29 04:01:58] [INFO ] Time to serialize properties into /tmp/LTL11068088166097612093.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11060296945217261719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11068088166097612093.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.i1.u2.p19==0)||(i0.i0.u1.p16==1))"))U(X(X("((i7.i0.u26.p153==0)||(i0.i2.u5.p24==1))"))))))
Formula 0 simplified : F(G!"((i0.i1.u2.p19==0)||(i0.i0.u1.p16==1))" R XX!"((i7.i0.u26.p153==0)||(i0.i2.u5.p24==1))")
Reverse transition relation is NOT exact ! Due to transitions t2_t113, t13_t92, t14_t89, t15_t86, t26_t61, t1_t116, t52_t53_t54_t136, t161_t6, t27_t58_t122...799
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-13 finished in 101710 ms.
[2024-05-29 04:02:13] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6293369654279428618
[2024-05-29 04:02:13] [INFO ] Applying decomposition
[2024-05-29 04:02:13] [INFO ] Computing symmetric may disable matrix : 175 transitions.
[2024-05-29 04:02:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:02:13] [INFO ] Computing symmetric may enable matrix : 175 transitions.
[2024-05-29 04:02:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:02:13] [INFO ] Flatten gal took : 4 ms
[2024-05-29 04:02:13] [INFO ] Computing Do-Not-Accords matrix : 175 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13491006254665314091.txt' '-o' '/tmp/graph13491006254665314091.bin' '-w' '/tmp/graph13491006254665314091.weights'
[2024-05-29 04:02:13] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:02:13] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6293369654279428618
Running compilation step : cd /tmp/ltsmin6293369654279428618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13491006254665314091.bin' '-l' '-1' '-v' '-w' '/tmp/graph13491006254665314091.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:02:13] [INFO ] Decomposing Gal with order
[2024-05-29 04:02:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:02:13] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 04:02:13] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 04:02:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality3405793733149869769.gal : 3 ms
[2024-05-29 04:02:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality8042211301396684225.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3405793733149869769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8042211301396684225.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(G(((("((i3.i0.u26.p76==0)||(i2.i0.u12.p31==1))")U("((i1.i1.u23.p66==0)||(i6.i1.u38.p114==1))"))||(F("(i3.i0.u27.p79==1)")))||(("(...247
Formula 0 simplified : XF((!"((i3.i0.u26.p76==0)||(i2.i0.u12.p31==1))" R !"((i1.i1.u23.p66==0)||(i6.i1.u38.p114==1))") & G!"(i3.i0.u27.p79==1)" & (!"((i3.i...234
Compilation finished in 355 ms.
Running link step : cd /tmp/ltsmin6293369654279428618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6293369654279428618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t56, t59, t62, t84, t87, t90, t111, t114, i0.t117, i0.i0.u5.t120, i0.i1.u6.t119, i0.i2.u15.t1...982
Computing Next relation with stutter on 7758 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: LTL layer: formula: X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.004: "X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.137: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 0.303: There are 182 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.303: State length is 191, there are 190 groups
pins2lts-mc-linux64( 0/ 8), 0.303: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.303: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.303: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.303: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.337: [Blue] ~120 levels ~960 states ~4776 transitions
pins2lts-mc-linux64( 6/ 8), 0.367: [Blue] ~240 levels ~1920 states ~10808 transitions
pins2lts-mc-linux64( 6/ 8), 0.419: [Blue] ~472 levels ~3840 states ~19720 transitions
pins2lts-mc-linux64( 6/ 8), 0.472: [Blue] ~565 levels ~7680 states ~30808 transitions
pins2lts-mc-linux64( 6/ 8), 0.531: [Blue] ~565 levels ~15360 states ~61856 transitions
pins2lts-mc-linux64( 6/ 8), 0.644: [Blue] ~565 levels ~30720 states ~125552 transitions
pins2lts-mc-linux64( 6/ 8), 0.871: [Blue] ~565 levels ~61440 states ~267688 transitions
pins2lts-mc-linux64( 6/ 8), 1.380: [Blue] ~567 levels ~122880 states ~551040 transitions
pins2lts-mc-linux64( 6/ 8), 2.213: [Blue] ~571 levels ~245760 states ~1182888 transitions
pins2lts-mc-linux64( 6/ 8), 3.585: [Blue] ~571 levels ~491520 states ~2526416 transitions
pins2lts-mc-linux64( 5/ 8), 5.626: [Blue] ~1942 levels ~983040 states ~3336320 transitions
pins2lts-mc-linux64( 6/ 8), 9.476: [Blue] ~571 levels ~1966080 states ~11486376 transitions
pins2lts-mc-linux64( 2/ 8), 17.154: [Blue] ~837 levels ~3932160 states ~23766776 transitions
pins2lts-mc-linux64( 1/ 8), 32.278: [Blue] ~2162 levels ~7864320 states ~34034608 transitions
pins2lts-mc-linux64( 5/ 8), 63.646: [Blue] ~1942 levels ~15728640 states ~72826016 transitions
pins2lts-mc-linux64( 5/ 8), 125.418: [Blue] ~1942 levels ~31457280 states ~147016728 transitions
pins2lts-mc-linux64( 5/ 8), 252.446: [Blue] ~1942 levels ~62914560 states ~307745792 transitions
pins2lts-mc-linux64( 5/ 8), 514.190: [Blue] ~1942 levels ~125829120 states ~639454056 transitions
pins2lts-mc-linux64( 2/ 8), 640.943: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 641.004:
pins2lts-mc-linux64( 0/ 8), 641.004: Explored 137388749 states 1051306253 transitions, fanout: 7.652
pins2lts-mc-linux64( 0/ 8), 641.004: Total exploration time 640.670 sec (640.620 sec minimum, 640.641 sec on average)
pins2lts-mc-linux64( 0/ 8), 641.004: States per second: 214445, Transitions per second: 1640948
pins2lts-mc-linux64( 0/ 8), 641.004:
pins2lts-mc-linux64( 0/ 8), 641.004: State space has 134217404 states, 7095058 are accepting
pins2lts-mc-linux64( 0/ 8), 641.004: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 641.004: blue states: 137388749 (102.36%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 641.004: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 641.004: all-red states: 34672088 (25.83%), bogus 37230 (0.03%)
pins2lts-mc-linux64( 0/ 8), 641.004:
pins2lts-mc-linux64( 0/ 8), 641.004: Total memory used for local state coloring: 1.0MB
pins2lts-mc-linux64( 0/ 8), 641.004:
pins2lts-mc-linux64( 0/ 8), 641.004: Queue width: 8B, total height: 68137, memory: 0.52MB
pins2lts-mc-linux64( 0/ 8), 641.005: Tree memory: 1073.1MB, 8.4 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 641.005: Tree fill ratio (roots/leafs): 99.0%/19.0%
pins2lts-mc-linux64( 0/ 8), 641.005: Stored 175 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 641.005: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 641.005: Est. total memory use: 1073.6MB (~1024.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6293369654279428618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6293369654279428618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-29 04:27:19] [INFO ] Applying decomposition
[2024-05-29 04:27:19] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:27:19] [INFO ] Decomposing Gal with order
[2024-05-29 04:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:27:19] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 04:27:19] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 2 ms.
[2024-05-29 04:27:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality15964846758125915111.gal : 2 ms
[2024-05-29 04:27:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality6693643370772845467.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15964846758125915111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6693643370772845467.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(G(((("((i0.i1.i0.i0.u98.p76==0)||(i0.i0.i1.i0.i0.i0.i0.i1.u87.p31==1))")U("((i0.i0.i1.u24.p66==0)||(i0.i1.i0.i0.i0.u42.p114==1))"...333
Formula 0 simplified : XF((!"((i0.i1.i0.i0.u98.p76==0)||(i0.i0.i1.i0.i0.i0.i0.i1.u87.p31==1))" R !"((i0.i0.i1.u24.p66==0)||(i0.i1.i0.i0.i0.u42.p114==1))") ...320
ITS-tools command line returned an error code 137
[2024-05-29 04:34:33] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:34:33] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-29 04:34:33] [INFO ] Transformed 190 places.
[2024-05-29 04:34:33] [INFO ] Transformed 175 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 04:34:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality7422261023984611561.gal : 1 ms
[2024-05-29 04:34:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality828640207896950393.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7422261023984611561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality828640207896950393.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||(("((p76==0)||(p31==1))")&&(F(G("((p173==0)||(p3==1))"...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
ITS-tools command line returned an error code 137
Total runtime 3496695 ms.
BK_STOP 1716957914080
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ShieldPPPs-PT-003B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPs-PT-003B, 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 r356-tall-171683761000395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-003B.tgz
mv ShieldPPPs-PT-003B 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 ;