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.r528-tall-171683761100444.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761100444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 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 24K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 11:56 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 172K 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-010B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717243678075

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:07:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:07:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:07:59] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-01 12:07:59] [INFO ] Transformed 683 places.
[2024-06-01 12:07:59] [INFO ] Transformed 633 transitions.
[2024-06-01 12:07:59] [INFO ] Found NUPN structural information;
[2024-06-01 12:07:59] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-010B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 633/633 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 619 transition count 569
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 619 transition count 569
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 618 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 618 transition count 568
Applied a total of 130 rules in 126 ms. Remains 618 /683 variables (removed 65) and now considering 568/633 (removed 65) transitions.
// Phase 1: matrix 568 rows 618 cols
[2024-06-01 12:07:59] [INFO ] Computed 111 invariants in 29 ms
[2024-06-01 12:08:00] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 12:08:00] [INFO ] Invariant cache hit.
[2024-06-01 12:08:00] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Running 567 sub problems to find dead transitions.
[2024-06-01 12:08:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (OVERLAPS) 1/618 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 9 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 5 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 4 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 4 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 4 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 4 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 3 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 4 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:16] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 4 ms to minimize.
[2024-06-01 12:08:16] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 3 ms to minimize.
[2024-06-01 12:08:16] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 4 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 4 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 4 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-06-01 12:08:19] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:25] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:08:25] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:26] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:08:26] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:08:26] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:08:26] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:08:26] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:08:26] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:08:26] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1186 variables, and 183 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/618 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (OVERLAPS) 1/618 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 72/183 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 3 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 4 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:45] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:52] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:08:52] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:08:52] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:08:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 3 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-06-01 12:08:56] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:08:57] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:08:57] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:08:58] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:58] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:58] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1186 variables, and 283 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/618 constraints, PredecessorRefiner: 0/567 constraints, Known Traps: 172/172 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 567 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 618/683 places, 568/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61244 ms. Remains : 618/683 places, 568/633 transitions.
Support contains 44 out of 618 places after structural reductions.
[2024-06-01 12:09:01] [INFO ] Flatten gal took : 71 ms
[2024-06-01 12:09:01] [INFO ] Flatten gal took : 36 ms
[2024-06-01 12:09:01] [INFO ] Input system was already deterministic with 568 transitions.
Support contains 42 out of 618 places (down from 44) after GAL structural reductions.
RANDOM walk for 16123 steps (7 resets) in 853 ms. (18 steps per ms) remains 0/30 properties
Computed a total of 124 stabilizing places and 124 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(F(p0)))'
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 39 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-06-01 12:09:01] [INFO ] Computed 111 invariants in 8 ms
[2024-06-01 12:09:02] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 12:09:02] [INFO ] Invariant cache hit.
[2024-06-01 12:09:02] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-06-01 12:09:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 4 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 3 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:09:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 3 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 4 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:09:19] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-06-01 12:09:19] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2024-06-01 12:09:19] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:09:19] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:09:25] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:25] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:09:25] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:26] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 4 ms to minimize.
[2024-06-01 12:09:26] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:26] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 3 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:09:29] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
SMT process timed out in 30138ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30151ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30828 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-00
Stuttering criterion allowed to conclude after 18446 steps with 37 reset in 151 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-00 finished in 31238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((p0&&F(p1)))&&(G(!p1) U p2))))'
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 546 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 490 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 254 place count 490 transition count 435
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 264 place count 485 transition count 435
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 604 place count 315 transition count 265
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 606 place count 313 transition count 263
Applied a total of 606 rules in 108 ms. Remains 313 /618 variables (removed 305) and now considering 263/568 (removed 305) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-06-01 12:09:33] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:09:33] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 12:09:33] [INFO ] Invariant cache hit.
[2024-06-01 12:09:33] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 12:09:33] [INFO ] Redundant transitions in 10 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:09:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:37] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:37] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/313 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 4 ms to minimize.
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 116 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 130 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:09:42] [INFO ] Deduced a trap composed of 143 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:44] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:09:44] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:09:44] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:47] [INFO ] Deduced a trap composed of 115 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:48] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 263/576 variables, 313/443 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:59] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:09:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:10:00] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:10:00] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:10:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:10:00] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/576 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:10:01] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/576 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 452 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:10:06] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:10:06] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:10:06] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/455 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 260/715 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 716 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 32/32 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/618 places, 263/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60566 ms. Remains : 313/618 places, 263/568 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-01
Stuttering criterion allowed to conclude after 1071 steps with 1 reset in 7 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-01 finished in 60818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 617 transition count 495
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 250 place count 489 transition count 439
Iterating global reduction 2 with 6 rules applied. Total rules applied 256 place count 489 transition count 439
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 256 place count 489 transition count 434
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 266 place count 484 transition count 434
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 608 place count 313 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 311 transition count 261
Applied a total of 610 rules in 104 ms. Remains 311 /618 variables (removed 307) and now considering 261/568 (removed 307) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:10:34] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:10:34] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-06-01 12:10:34] [INFO ] Invariant cache hit.
[2024-06-01 12:10:34] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 12:10:34] [INFO ] Redundant transitions in 2 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:10:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:10:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 261/572 variables, 311/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 427 constraints, problems are : Problem set: 0 solved, 259 unsolved in 9936 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:10:45] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:10:45] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 688 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 7/7 constraints]
After SMT, in 39994ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 39998ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/618 places, 261/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40726 ms. Remains : 311/618 places, 261/568 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-03
Product exploration explored 100000 steps with 142 reset in 417 ms.
Product exploration explored 100000 steps with 140 reset in 618 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 1116 steps (0 resets) in 11 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:11:16] [INFO ] Invariant cache hit.
[2024-06-01 12:11:16] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 12:11:16] [INFO ] Invariant cache hit.
[2024-06-01 12:11:16] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-06-01 12:11:16] [INFO ] Redundant transitions in 2 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:11:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:11:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 261/572 variables, 311/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 427 constraints, problems are : Problem set: 0 solved, 259 unsolved in 9663 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:11:27] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:11:27] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 688 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 7/7 constraints]
After SMT, in 39699ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 39701ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40159 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 1126 steps (0 resets) in 21 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 141 reset in 354 ms.
Product exploration explored 100000 steps with 140 reset in 452 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:11:57] [INFO ] Invariant cache hit.
[2024-06-01 12:11:57] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 12:11:57] [INFO ] Invariant cache hit.
[2024-06-01 12:11:58] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-06-01 12:11:58] [INFO ] Redundant transitions in 3 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:11:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:00] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:12:00] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:12:00] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:12:00] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:12:00] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 261/572 variables, 311/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 427 constraints, problems are : Problem set: 0 solved, 259 unsolved in 9578 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:08] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:12:09] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 688 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 7/7 constraints]
After SMT, in 39629ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 39634ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40031 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-03 finished in 123938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 546 transition count 496
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 142 place count 546 transition count 447
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 240 place count 497 transition count 447
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 491 transition count 441
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 491 transition count 441
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 252 place count 491 transition count 436
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 262 place count 486 transition count 436
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 49 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-06-01 12:12:37] [INFO ] Computed 111 invariants in 4 ms
[2024-06-01 12:12:38] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-01 12:12:38] [INFO ] Invariant cache hit.
[2024-06-01 12:12:38] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2024-06-01 12:12:38] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:12:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:12:40] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:12:40] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:12:40] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:45] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:12:45] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:12:45] [INFO ] Deduced a trap composed of 104 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:12:45] [INFO ] Deduced a trap composed of 119 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:12:45] [INFO ] Deduced a trap composed of 133 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:12:45] [INFO ] Deduced a trap composed of 145 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:47] [INFO ] Deduced a trap composed of 119 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:12:47] [INFO ] Deduced a trap composed of 115 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:12:47] [INFO ] Deduced a trap composed of 115 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:48] [INFO ] Deduced a trap composed of 88 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 103 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 116 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 26150 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 700 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
After SMT, in 56202ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 56205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56716 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-04
Product exploration explored 100000 steps with 139 reset in 365 ms.
Product exploration explored 100000 steps with 140 reset in 427 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 12:13:35] [INFO ] Invariant cache hit.
[2024-06-01 12:13:36] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 12:13:36] [INFO ] Invariant cache hit.
[2024-06-01 12:13:36] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-06-01 12:13:36] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:13:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:13:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:13:38] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:13:38] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:13:38] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:13:43] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:13:43] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:13:43] [INFO ] Deduced a trap composed of 104 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:13:43] [INFO ] Deduced a trap composed of 119 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:13:43] [INFO ] Deduced a trap composed of 133 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:13:43] [INFO ] Deduced a trap composed of 145 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:13:45] [INFO ] Deduced a trap composed of 119 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:13:45] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:13:45] [INFO ] Deduced a trap composed of 115 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:13:46] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:13:49] [INFO ] Deduced a trap composed of 103 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:13:49] [INFO ] Deduced a trap composed of 116 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:13:53] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:13:55] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 27284 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 700 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
After SMT, in 57325ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 57329ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57772 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 7 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 139 reset in 359 ms.
Product exploration explored 100000 steps with 139 reset in 410 ms.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 12:14:34] [INFO ] Invariant cache hit.
[2024-06-01 12:14:35] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 12:14:35] [INFO ] Invariant cache hit.
[2024-06-01 12:14:35] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-06-01 12:14:35] [INFO ] Redundant transitions in 0 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:14:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:14:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:14:37] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:14:37] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:14:37] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:14:42] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:14:42] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:14:42] [INFO ] Deduced a trap composed of 104 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:14:42] [INFO ] Deduced a trap composed of 119 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:14:42] [INFO ] Deduced a trap composed of 133 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:14:42] [INFO ] Deduced a trap composed of 145 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:14:44] [INFO ] Deduced a trap composed of 119 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:14:44] [INFO ] Deduced a trap composed of 115 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:14:44] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:14:45] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:14:48] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:14:48] [INFO ] Deduced a trap composed of 116 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:14:52] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:14:54] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 26619 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 700 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
After SMT, in 56662ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 56665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57053 ms. Remains : 312/312 places, 262/262 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-04 finished in 174105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 617 transition count 495
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 249 place count 490 transition count 440
Iterating global reduction 2 with 5 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 254 place count 490 transition count 436
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 262 place count 486 transition count 436
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 1 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 69 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-06-01 12:15:32] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:15:32] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 12:15:32] [INFO ] Invariant cache hit.
[2024-06-01 12:15:32] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-01 12:15:32] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:15:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:15:34] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:15:34] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:15:34] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:15:35] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:15:35] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 12:15:35] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:15:35] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:15:35] [INFO ] Deduced a trap composed of 118 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:15:36] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:15:36] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:15:36] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 262/574 variables, 312/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:15:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 435 constraints, problems are : Problem set: 0 solved, 260 unsolved in 14704 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/695 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:15:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:15:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 697 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 14/14 constraints]
After SMT, in 44745ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 44748ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45218 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-05
Stuttering criterion allowed to conclude after 711 steps with 0 reset in 6 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-05 finished in 45312 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((X(p1)||(!p2 U p3)||p0)))'
Support contains 7 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 14 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-06-01 12:16:17] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:16:17] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 12:16:17] [INFO ] Invariant cache hit.
[2024-06-01 12:16:17] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-06-01 12:16:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:16:28] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:16:28] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:16:28] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:16:28] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 3 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 4 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 4 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 4 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:16:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:16:34] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 4 ms to minimize.
[2024-06-01 12:16:34] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-06-01 12:16:34] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:16:34] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:16:40] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:16:40] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:16:40] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:16:41] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 3 ms to minimize.
[2024-06-01 12:16:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 3 ms to minimize.
[2024-06-01 12:16:42] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:16:43] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:16:43] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:16:43] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:16:43] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:16:43] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:16:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:16:45] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:16:46] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:16:46] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:16:46] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:16:46] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:16:46] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:16:46] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:16:46] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:16:46] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 3 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:16:57] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:16:57] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:16:57] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:16:57] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:16:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:16:58] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:16:59] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:16:59] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:16:59] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:16:59] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:17:00] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:17:00] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:17:00] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 3 ms to minimize.
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:17:02] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:17:02] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:17:02] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:17:02] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:17:04] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:17:04] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:17:05] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:17:05] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:17:05] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:17:05] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:17:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:17:06] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:17:06] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:17:06] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:17:07] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:17:09] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:17:10] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:17:10] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 5 ms to minimize.
[2024-06-01 12:17:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:17:10] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:17:10] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:17:10] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:17:10] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-06-01 12:17:11] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 3 ms to minimize.
[2024-06-01 12:17:11] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:17:11] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:17:11] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:17:11] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:17:11] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:17:12] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:17:12] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:17:12] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:17:12] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:17:13] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:17:13] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:17:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:17:15] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:17:15] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:17:15] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:17:16] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:17:16] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:17:16] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:17:17] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:17:17] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:17:17] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:17:18] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
SMT process timed out in 60132ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60834 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 550 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-06 finished in 61051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(F(p1)))) U G(p2)))'
Support contains 5 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 546 transition count 496
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 546 transition count 446
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 496 transition count 446
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 247 place count 491 transition count 441
Iterating global reduction 2 with 5 rules applied. Total rules applied 252 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 252 place count 491 transition count 437
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 260 place count 487 transition count 437
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 602 place count 316 transition count 266
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 314 transition count 264
Applied a total of 604 rules in 44 ms. Remains 314 /618 variables (removed 304) and now considering 264/568 (removed 304) transitions.
// Phase 1: matrix 264 rows 314 cols
[2024-06-01 12:17:18] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:17:18] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 12:17:18] [INFO ] Invariant cache hit.
[2024-06-01 12:17:18] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-01 12:17:18] [INFO ] Redundant transitions in 0 ms returned []
Running 262 sub problems to find dead transitions.
[2024-06-01 12:17:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 118 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:17:21] [INFO ] Deduced a trap composed of 133 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/314 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 264/578 variables, 314/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 434 constraints, problems are : Problem set: 0 solved, 262 unsolved in 12413 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/314 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 264/578 variables, 314/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 262/696 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 696 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 42461ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 42464ms
Starting structural reductions in SI_LTL mode, iteration 1 : 314/618 places, 264/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42885 ms. Remains : 314/618 places, 264/568 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-07
Product exploration explored 100000 steps with 664 reset in 365 ms.
Product exploration explored 100000 steps with 689 reset in 444 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
RANDOM walk for 3523 steps (4 resets) in 57 ms. (60 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 13 factoid took 338 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
[2024-06-01 12:18:03] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 13 factoid took 408 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010B-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010B-LTLFireability-07 finished in 45439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 546 transition count 496
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 546 transition count 446
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 496 transition count 446
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 247 place count 491 transition count 441
Iterating global reduction 2 with 5 rules applied. Total rules applied 252 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 252 place count 491 transition count 437
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 260 place count 487 transition count 437
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 44 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-06-01 12:18:03] [INFO ] Computed 111 invariants in 3 ms
[2024-06-01 12:18:03] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 12:18:03] [INFO ] Invariant cache hit.
[2024-06-01 12:18:04] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-01 12:18:04] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:18:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:06] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:18:06] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:18:06] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:18:06] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:18:06] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:18:06] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:10] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:18:10] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:18:10] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:18:11] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:18:11] [INFO ] Deduced a trap composed of 115 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:18:11] [INFO ] Deduced a trap composed of 130 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:18:11] [INFO ] Deduced a trap composed of 147 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 114 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 117 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 115 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 114 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 117 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 115 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:18:14] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:18:14] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:18:14] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:15] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:18:15] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:18:15] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:18:15] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:18:15] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:18:15] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:18] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:18:18] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:18:18] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:18:18] [INFO ] Deduced a trap composed of 126 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:19] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:21] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:18:22] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:25] [INFO ] Deduced a trap composed of 129 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 115 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 114 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 114 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 117 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 115 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 116 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:27] [INFO ] Deduced a trap composed of 115 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:27] [INFO ] Deduced a trap composed of 112 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:27] [INFO ] Deduced a trap composed of 146 places in 61 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:28] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:31] [INFO ] Deduced a trap composed of 133 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:18:31] [INFO ] Deduced a trap composed of 132 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:18:31] [INFO ] Deduced a trap composed of 135 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:18:31] [INFO ] Deduced a trap composed of 129 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:18:31] [INFO ] Deduced a trap composed of 132 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:18:32] [INFO ] Deduced a trap composed of 129 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:18:32] [INFO ] Deduced a trap composed of 133 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:18:32] [INFO ] Deduced a trap composed of 128 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:18:32] [INFO ] Deduced a trap composed of 133 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:18:32] [INFO ] Deduced a trap composed of 128 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:18:32] [INFO ] Deduced a trap composed of 129 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:18:32] [INFO ] Deduced a trap composed of 127 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:33] [INFO ] Deduced a trap composed of 117 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:18:34] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:18:34] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:18:34] [INFO ] Deduced a trap composed of 115 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:18:34] [INFO ] Deduced a trap composed of 114 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:34] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
SMT process timed out in 30047ms, After SMT, problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 30049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30448 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-08
Product exploration explored 100000 steps with 22283 reset in 208 ms.
Product exploration explored 100000 steps with 22058 reset in 255 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/312 stabilizing places and 2/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-06-01 12:18:35] [INFO ] Invariant cache hit.
[2024-06-01 12:18:35] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-06-01 12:18:35] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2024-06-01 12:18:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:18:35] [INFO ] [Nat]Absence check using 111 positive place invariants in 33 ms returned sat
[2024-06-01 12:18:35] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-06-01 12:18:36] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-06-01 12:18:36] [INFO ] Computed and/alt/rep : 259/498/259 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 12:18:37] [INFO ] Added : 223 causal constraints over 45 iterations in 1664 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 12:18:37] [INFO ] Invariant cache hit.
[2024-06-01 12:18:37] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 12:18:37] [INFO ] Invariant cache hit.
[2024-06-01 12:18:38] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-01 12:18:38] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:18:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:40] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:18:40] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:18:40] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:18:40] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:18:40] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:18:40] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:44] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:18:44] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:18:44] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:18:45] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:18:45] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:18:45] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:18:45] [INFO ] Deduced a trap composed of 147 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 114 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 117 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 114 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 115 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 115 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 98 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:18:47] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:18:48] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:48] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:18:48] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:18:48] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:18:48] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:49] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:18:49] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:18:49] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:18:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:18:49] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:18:50] [INFO ] Deduced a trap composed of 99 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:52] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:18:52] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:18:52] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:18:53] [INFO ] Deduced a trap composed of 126 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:53] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:55] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:18:56] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:18:59] [INFO ] Deduced a trap composed of 129 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 115 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 114 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 114 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 117 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 115 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 115 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 116 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:19:01] [INFO ] Deduced a trap composed of 112 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:19:01] [INFO ] Deduced a trap composed of 146 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:02] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:05] [INFO ] Deduced a trap composed of 133 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:19:05] [INFO ] Deduced a trap composed of 132 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:19:05] [INFO ] Deduced a trap composed of 135 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:19:05] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:19:05] [INFO ] Deduced a trap composed of 132 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:06] [INFO ] Deduced a trap composed of 129 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:19:06] [INFO ] Deduced a trap composed of 133 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:19:06] [INFO ] Deduced a trap composed of 128 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:06] [INFO ] Deduced a trap composed of 133 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:19:06] [INFO ] Deduced a trap composed of 128 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:19:06] [INFO ] Deduced a trap composed of 129 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:19:06] [INFO ] Deduced a trap composed of 127 places in 51 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:08] [INFO ] Deduced a trap composed of 117 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:19:08] [INFO ] Deduced a trap composed of 115 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:19:08] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
SMT process timed out in 30039ms, After SMT, problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 30043ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30419 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/312 stabilizing places and 2/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 31 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-06-01 12:19:08] [INFO ] Invariant cache hit.
[2024-06-01 12:19:08] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-06-01 12:19:09] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-06-01 12:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:19:09] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-06-01 12:19:09] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-06-01 12:19:09] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-01 12:19:09] [INFO ] Computed and/alt/rep : 259/498/259 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 12:19:11] [INFO ] Added : 223 causal constraints over 45 iterations in 1583 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22140 reset in 223 ms.
Product exploration explored 100000 steps with 22295 reset in 268 ms.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 12:19:11] [INFO ] Invariant cache hit.
[2024-06-01 12:19:11] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 12:19:11] [INFO ] Invariant cache hit.
[2024-06-01 12:19:12] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-06-01 12:19:12] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:19:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:14] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:19:14] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:19:14] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:19:14] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:19:14] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:19:14] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:18] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:19:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:19:18] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:19:19] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:19] [INFO ] Deduced a trap composed of 115 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:19:19] [INFO ] Deduced a trap composed of 130 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:19:19] [INFO ] Deduced a trap composed of 147 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 114 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 117 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 115 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 114 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 117 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:19:22] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:19:22] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:22] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:19:22] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:19:22] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:23] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:19:23] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:19:23] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:19:23] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:19:23] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:19:24] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:26] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:19:26] [INFO ] Deduced a trap composed of 84 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:19:26] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:27] [INFO ] Deduced a trap composed of 126 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:27] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:30] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:19:30] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:33] [INFO ] Deduced a trap composed of 129 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 115 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 114 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 114 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 117 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 115 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 116 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 115 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 112 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 146 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:36] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:39] [INFO ] Deduced a trap composed of 133 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:19:39] [INFO ] Deduced a trap composed of 132 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:19:39] [INFO ] Deduced a trap composed of 135 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 129 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 132 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 129 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 133 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 128 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 133 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 128 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 129 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 127 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/574 variables, and 181 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 70/180 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:43] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:19:43] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 1/312 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:45] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:19:47] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:48] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 262/574 variables, 312/498 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 259/757 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:19:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 758 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 76/76 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60460 ms. Remains : 312/312 places, 262/262 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-08 finished in 128336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((X(p1) U ((X(p1)&&(p2||F(!p0)))||X(G(p1))))))))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 19 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-06-01 12:20:12] [INFO ] Computed 111 invariants in 4 ms
[2024-06-01 12:20:12] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 12:20:12] [INFO ] Invariant cache hit.
[2024-06-01 12:20:12] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-06-01 12:20:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:20:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:20:23] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:20:23] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:20:23] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 4 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 4 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:20:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 4 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:20:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:20:27] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:20:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:20:27] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:20:27] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 4 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 4 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:20:28] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:20:29] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:20:29] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 3 ms to minimize.
[2024-06-01 12:20:29] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-06-01 12:20:29] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
[2024-06-01 12:20:29] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:20:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:20:36] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:20:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:20:36] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 4 ms to minimize.
[2024-06-01 12:20:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:20:37] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:20:37] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:20:37] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:20:37] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:20:37] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:20:37] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:20:37] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:20:38] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:20:38] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:20:38] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:20:38] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:20:38] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:20:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:20:38] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:20:38] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:20:40] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:20:41] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:20:41] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:20:42] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 184 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 73/184 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:20:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:20:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:20:49] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:20:50] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:20:50] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:20:50] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:20:50] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:20:50] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:20:50] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:20:51] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:20:51] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:20:51] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:20:51] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:20:51] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:20:51] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:20:51] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:20:52] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:20:52] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:20:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:20:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:20:54] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:20:54] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:20:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:20:55] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-06-01 12:20:55] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:20:57] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:20:57] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:20:57] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:20:57] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 3 ms to minimize.
[2024-06-01 12:20:57] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:20:59] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:20:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:20:59] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:21:00] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:21:00] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:21:00] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:21:00] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:21:00] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:21:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:21:00] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:21:01] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:21:01] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2024-06-01 12:21:01] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:21:02] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:21:02] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:21:02] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:21:02] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:21:02] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:21:02] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:21:02] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:21:04] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:21:04] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:21:04] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:21:04] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:21:04] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:21:04] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:21:04] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:21:04] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:21:06] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:21:06] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:21:06] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:21:06] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:21:07] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:21:08] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:21:08] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:21:09] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:21:10] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:21:10] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:21:10] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:21:10] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:21:10] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:21:11] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:21:11] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:21:11] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 3 ms to minimize.
[2024-06-01 12:21:11] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1174 variables, and 284 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 173/173 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 591 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Product exploration explored 100000 steps with 25000 reset in 136 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/612 stabilizing places and 119/562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 270 steps (0 resets) in 6 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 612 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 612 /612 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-06-01 12:21:14] [INFO ] Invariant cache hit.
[2024-06-01 12:21:14] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 12:21:14] [INFO ] Invariant cache hit.
[2024-06-01 12:21:15] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-06-01 12:21:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:21:25] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:21:25] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:21:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:21:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 4 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 3 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 4 ms to minimize.
[2024-06-01 12:21:27] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 3 ms to minimize.
[2024-06-01 12:21:27] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:21:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:21:27] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:21:27] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:21:27] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:21:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:21:31] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-06-01 12:21:31] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-06-01 12:21:31] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:21:31] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:21:37] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:21:37] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:21:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:21:38] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 4 ms to minimize.
[2024-06-01 12:21:38] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:21:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:21:40] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:21:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:21:40] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:21:40] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:21:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:21:42] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:21:43] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:21:43] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-06-01 12:21:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:21:43] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:21:43] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:21:43] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:21:43] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:21:44] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:21:44] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-06-01 12:21:44] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:21:44] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:21:44] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:21:44] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:21:44] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:21:44] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:21:45] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:21:45] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:21:45] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:21:52] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:21:52] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:21:52] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:21:52] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:21:52] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:21:52] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:21:53] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:21:53] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:21:53] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-06-01 12:21:53] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:21:53] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:21:54] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:21:56] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:21:57] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:21:57] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:21:57] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:21:57] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:21:57] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:21:57] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:21:58] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-01 12:21:59] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:22:02] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-06-01 12:22:02] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:22:02] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:22:02] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:22:02] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:22:02] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:22:02] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:22:03] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:22:04] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:22:05] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:22:05] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:22:05] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:22:07] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:22:07] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:22:07] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:22:07] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:22:07] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:22:07] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:22:07] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:22:08] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:22:08] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-06-01 12:22:08] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:22:08] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:22:08] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:22:08] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:22:09] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:22:09] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:22:09] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:22:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:22:11] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:22:11] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:22:14] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:22:14] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:22:14] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1174 variables, and 281 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 170/170 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 60729 ms. Remains : 612/612 places, 562/562 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 289 steps (0 resets) in 6 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 562/562 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 612 transition count 562
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 70 place count 612 transition count 563
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 612 transition count 563
Performed 208 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 299 places in 1 ms
Iterating global reduction 1 with 208 rules applied. Total rules applied 299 place count 612 transition count 563
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 369 place count 542 transition count 493
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 439 place count 542 transition count 493
Deduced a syphon composed of 229 places in 0 ms
Applied a total of 439 rules in 85 ms. Remains 542 /612 variables (removed 70) and now considering 493/562 (removed 69) transitions.
[2024-06-01 12:22:16] [INFO ] Redundant transitions in 2 ms returned []
Running 492 sub problems to find dead transitions.
// Phase 1: matrix 493 rows 542 cols
[2024-06-01 12:22:16] [INFO ] Computed 111 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/542 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 12:22:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 12:22:24] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 12:22:24] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 12:22:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD465 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 20/131 constraints. Problems are: Problem set: 83 solved, 409 unsolved
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-06-01 12:22:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 20/151 constraints. Problems are: Problem set: 145 solved, 347 unsolved
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-06-01 12:22:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/171 constraints. Problems are: Problem set: 195 solved, 297 unsolved
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD164 is UNSAT
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD312 is UNSAT
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD335 is UNSAT
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD358 is UNSAT
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD381 is UNSAT
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD404 is UNSAT
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD424 is UNSAT
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 20/191 constraints. Problems are: Problem set: 229 solved, 263 unsolved
[2024-06-01 12:22:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD469 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/192 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/192 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 493/1035 variables, 542/734 constraints. Problems are: Problem set: 230 solved, 262 unsolved
[2024-06-01 12:22:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:22:43] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:22:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:22:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:22:43] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:22:43] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:22:43] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:22:43] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:22:43] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:22:44] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:22:44] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:22:45] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:22:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:22:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/1035 variables, 14/748 constraints. Problems are: Problem set: 230 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1035/1035 variables, and 748 constraints, problems are : Problem set: 230 solved, 262 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 230 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 230/542 variables, 111/111 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 95/206 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 0/206 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 493/1035 variables, 542/748 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1035 variables, 262/1010 constraints. Problems are: Problem set: 230 solved, 262 unsolved
[2024-06-01 12:23:11] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:23:11] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1035 variables, 2/1012 constraints. Problems are: Problem set: 230 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1035/1035 variables, and 1012 constraints, problems are : Problem set: 230 solved, 262 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 262/492 constraints, Known Traps: 97/97 constraints]
After SMT, in 60129ms problems are : Problem set: 230 solved, 262 unsolved
Search for dead transitions found 230 dead transitions in 60134ms
Found 230 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 230 transitions
Dead transitions reduction (with SMT) removed 230 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 542/612 places, 263/562 transitions.
Graph (complete) has 824 edges and 542 vertex of which 313 are kept as prefixes of interest. Removing 229 places using SCC suffix rule.2 ms
Discarding 229 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 313 /542 variables (removed 229) and now considering 263/263 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 313/612 places, 263/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60242 ms. Remains : 313/612 places, 263/562 transitions.
Support contains 1 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 612 /612 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-06-01 12:23:17] [INFO ] Computed 111 invariants in 6 ms
[2024-06-01 12:23:17] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 12:23:17] [INFO ] Invariant cache hit.
[2024-06-01 12:23:17] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-06-01 12:23:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:23:28] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:23:28] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:28] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:23:28] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 4 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 4 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:30] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 4 ms to minimize.
[2024-06-01 12:23:30] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 3 ms to minimize.
[2024-06-01 12:23:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:23:30] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:23:30] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:23:30] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:23:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:23:32] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:23:32] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:23:32] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:23:32] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:23:32] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:23:32] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:23:33] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:23:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:23:40] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:23:41] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:23:41] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 4 ms to minimize.
[2024-06-01 12:23:41] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:23:43] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:23:43] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:23:43] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:23:43] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:23:43] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:23:43] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:23:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:23:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:23:46] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:23:46] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:23:46] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:23:46] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:23:46] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:23:46] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:23:47] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:23:47] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:23:47] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:23:47] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:23:47] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:23:47] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:23:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:23:47] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
SMT process timed out in 30070ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30076ms
Finished structural reductions in LTL mode , in 1 iterations and 30726 ms. Remains : 612/612 places, 562/562 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-09 finished in 215739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 613 transition count 563
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 613 transition count 563
Applied a total of 10 rules in 22 ms. Remains 613 /618 variables (removed 5) and now considering 563/568 (removed 5) transitions.
// Phase 1: matrix 563 rows 613 cols
[2024-06-01 12:23:47] [INFO ] Computed 111 invariants in 4 ms
[2024-06-01 12:23:48] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 12:23:48] [INFO ] Invariant cache hit.
[2024-06-01 12:23:48] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 562 sub problems to find dead transitions.
[2024-06-01 12:23:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 4 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 3 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:24:00] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-06-01 12:24:01] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:24:10] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:24:10] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:24:11] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:24:11] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:24:11] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:24:11] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 3 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:24:12] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:24:17] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1176 variables, and 191 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 3 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:24:29] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:24:29] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:24:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:29] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:24:30] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:24:35] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:24:35] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:24:35] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:24:35] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:24:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:24:36] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:24:36] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:24:36] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 3 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:24:40] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:24:42] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:24:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:24:42] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:24:42] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:24:42] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:24:42] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:24:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:24:43] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:24:43] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:24:43] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:24:43] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:24:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:24:43] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:24:43] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-06-01 12:24:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:24:46] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:24:46] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:24:47] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:24:47] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-06-01 12:24:47] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:24:47] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:24:48] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:24:48] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 60147ms, After SMT, problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 613/618 places, 563/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60815 ms. Remains : 613/618 places, 563/568 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-10
Product exploration explored 100000 steps with 300 reset in 264 ms.
Product exploration explored 100000 steps with 300 reset in 297 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5559 steps (2 resets) in 47 ms. (115 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:24:50] [INFO ] Invariant cache hit.
[2024-06-01 12:24:50] [INFO ] [Real]Absence check using 111 positive place invariants in 43 ms returned sat
[2024-06-01 12:24:51] [INFO ] [Real]Absence check using state equation in 985 ms returned sat
[2024-06-01 12:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:24:51] [INFO ] [Nat]Absence check using 111 positive place invariants in 43 ms returned sat
[2024-06-01 12:24:52] [INFO ] [Nat]Absence check using state equation in 1104 ms returned sat
[2024-06-01 12:24:53] [INFO ] Computed and/alt/rep : 562/993/562 causal constraints (skipped 0 transitions) in 38 ms.
[2024-06-01 12:25:02] [INFO ] Added : 534 causal constraints over 108 iterations in 9400 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 490
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 490
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 540 transition count 440
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 490 transition count 440
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 598 place count 313 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 311 transition count 261
Applied a total of 600 rules in 32 ms. Remains 311 /613 variables (removed 302) and now considering 261/563 (removed 302) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:25:02] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:25:02] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 12:25:02] [INFO ] Invariant cache hit.
[2024-06-01 12:25:02] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-06-01 12:25:02] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:25:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:25:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:25:05] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:25:05] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:25:05] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:25:05] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:25:05] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:25:05] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:25:05] [INFO ] Deduced a trap composed of 116 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:25:06] [INFO ] Deduced a trap composed of 129 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:25:06] [INFO ] Deduced a trap composed of 148 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:25:07] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 103 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 101 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/437 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:25:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:25:18] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/572 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/572 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 28716 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/130 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 103 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 98 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:25:33] [INFO ] Deduced a trap composed of 82 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/461 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/720 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 720 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints]
After SMT, in 58779ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 58781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/613 places, 261/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59206 ms. Remains : 311/613 places, 261/563 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 184 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1606 steps (1 resets) in 17 ms. (89 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 357 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:26:02] [INFO ] Invariant cache hit.
[2024-06-01 12:26:02] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-06-01 12:26:03] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-06-01 12:26:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:26:03] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-06-01 12:26:03] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2024-06-01 12:26:03] [INFO ] Computed and/alt/rep : 259/494/259 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:26:04] [INFO ] Added : 209 causal constraints over 42 iterations in 1389 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1213 reset in 284 ms.
Product exploration explored 100000 steps with 1218 reset in 328 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 30 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:26:05] [INFO ] Invariant cache hit.
[2024-06-01 12:26:05] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 12:26:05] [INFO ] Invariant cache hit.
[2024-06-01 12:26:06] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-06-01 12:26:06] [INFO ] Redundant transitions in 0 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:26:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:26:08] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:26:08] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:26:08] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:26:08] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:26:08] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:26:08] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:26:08] [INFO ] Deduced a trap composed of 104 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:26:09] [INFO ] Deduced a trap composed of 116 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:26:09] [INFO ] Deduced a trap composed of 129 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:26:09] [INFO ] Deduced a trap composed of 148 places in 70 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:26:10] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:26:12] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:26:12] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:26:12] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:26:12] [INFO ] Deduced a trap composed of 101 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/437 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:26:21] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:26:25] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/572 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:26:27] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/572 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 28253 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/130 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:26:35] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:26:35] [INFO ] Deduced a trap composed of 102 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:35] [INFO ] Deduced a trap composed of 103 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:26:35] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 102 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 100 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 102 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 100 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 100 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 100 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 98 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 103 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 102 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 103 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/461 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/720 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 720 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints]
After SMT, in 58288ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 58290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58691 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-10 finished in 196529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 546 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 490 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 254 place count 490 transition count 436
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 262 place count 486 transition count 436
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 36 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-06-01 12:27:04] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:27:04] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 12:27:04] [INFO ] Invariant cache hit.
[2024-06-01 12:27:04] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-06-01 12:27:04] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:27:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 116 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:27:07] [INFO ] Deduced a trap composed of 130 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:27:08] [INFO ] Deduced a trap composed of 144 places in 66 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:27:14] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:27:23] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 436 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24745 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:27:54] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:27:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 698 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 15/15 constraints]
After SMT, in 54786ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 54788ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55211 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-11
Product exploration explored 100000 steps with 644 reset in 307 ms.
Product exploration explored 100000 steps with 664 reset in 353 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 519 steps (0 resets) in 7 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:28:00] [INFO ] Invariant cache hit.
[2024-06-01 12:28:00] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-06-01 12:28:01] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-06-01 12:28:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:28:01] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-06-01 12:28:01] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2024-06-01 12:28:01] [INFO ] Computed and/alt/rep : 260/495/260 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 12:28:03] [INFO ] Added : 220 causal constraints over 44 iterations in 1512 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 312 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 12:28:03] [INFO ] Invariant cache hit.
[2024-06-01 12:28:03] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 12:28:03] [INFO ] Invariant cache hit.
[2024-06-01 12:28:03] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-01 12:28:03] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:28:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:28:05] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:28:05] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:28:05] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:28:06] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:28:06] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:28:06] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:28:06] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:28:06] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:28:06] [INFO ] Deduced a trap composed of 130 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:28:06] [INFO ] Deduced a trap composed of 144 places in 62 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:28:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:28:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 436 constraints, problems are : Problem set: 0 solved, 260 unsolved in 25313 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 698 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 15/15 constraints]
After SMT, in 55358ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 55361ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55734 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 557 steps (0 resets) in 6 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:28:59] [INFO ] Invariant cache hit.
[2024-06-01 12:28:59] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-06-01 12:28:59] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-06-01 12:28:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:28:59] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-06-01 12:28:59] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2024-06-01 12:29:00] [INFO ] Computed and/alt/rep : 260/495/260 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 12:29:01] [INFO ] Added : 220 causal constraints over 44 iterations in 1591 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 648 reset in 322 ms.
Product exploration explored 100000 steps with 647 reset in 359 ms.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 261
Applied a total of 2 rules in 7 ms. Remains 311 /312 variables (removed 1) and now considering 261/262 (removed 1) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:29:02] [INFO ] Computed 111 invariants in 3 ms
[2024-06-01 12:29:02] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 12:29:02] [INFO ] Invariant cache hit.
[2024-06-01 12:29:02] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-01 12:29:02] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:29:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 104 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 130 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 143 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/433 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:29:11] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:11] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:29:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 436 constraints, problems are : Problem set: 0 solved, 259 unsolved in 16776 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:29:20] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:20] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/697 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 697 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
After SMT, in 46837ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 46841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/312 places, 261/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47217 ms. Remains : 311/312 places, 261/262 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-11 finished in 165217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 19 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-06-01 12:29:49] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:29:49] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 12:29:49] [INFO ] Invariant cache hit.
[2024-06-01 12:29:50] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-06-01 12:29:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:30:01] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:30:01] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:01] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:30:01] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 3 ms to minimize.
[2024-06-01 12:30:01] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 3 ms to minimize.
[2024-06-01 12:30:01] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:30:01] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 3 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:02] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:30:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:04] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 4 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-06-01 12:30:06] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-06-01 12:30:06] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:30:06] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:30:06] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:30:06] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:30:06] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:30:06] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:06] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 3 ms to minimize.
[2024-06-01 12:30:07] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 4 ms to minimize.
[2024-06-01 12:30:07] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:30:07] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:13] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:30:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:30:13] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 4 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:30:16] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:30:16] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:30:16] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:30:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:17] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 185 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 74/185 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:27] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:30:27] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:30:27] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:30:27] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:30:27] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:30:27] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:30:28] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:30:28] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:30:28] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:30:28] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:30:29] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:31] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:30:50] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:30:50] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:30:50] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:30:50] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:30:50] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:30:50] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
SMT process timed out in 60118ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-12 finished in 60981 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((G(p0)||(p1 U (p2||G(p1)))))))'
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 21 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
[2024-06-01 12:30:50] [INFO ] Invariant cache hit.
[2024-06-01 12:30:50] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 12:30:50] [INFO ] Invariant cache hit.
[2024-06-01 12:30:51] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-06-01 12:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 3 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 3 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 4 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 3 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:31:07] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-06-01 12:31:07] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 3 ms to minimize.
[2024-06-01 12:31:07] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:31:07] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:13] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:31:13] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:31:13] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:31:14] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 4 ms to minimize.
[2024-06-01 12:31:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:31:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:31:14] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:31:15] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:31:16] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:31:16] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:31:16] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:16] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:31:18] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:31:19] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:31:19] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:31:19] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:31:19] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:31:19] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:31:19] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:19] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:31:19] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:20] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:31:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:31:28] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:31:28] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:31:28] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:31:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:29] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:31:29] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:31:29] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 3 ms to minimize.
[2024-06-01 12:31:29] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:31:29] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:31:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:31:29] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:31:29] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:31:30] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:31:30] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:31:30] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:31:30] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:31:30] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:31:30] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:31:32] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:31:32] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:31:32] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:31:33] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:31:33] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:31:33] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:31:33] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:31:34] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:31:34] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:31:34] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:34] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-01 12:31:35] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:37] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:37] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:31:38] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:31:38] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:31:38] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:31:38] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:31:38] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:42] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:31:42] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:31:42] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:31:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:31:43] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:31:43] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:31:43] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:31:43] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-06-01 12:31:43] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 3 ms to minimize.
[2024-06-01 12:31:44] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:31:44] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:31:44] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:31:44] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:31:44] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:31:44] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:31:45] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:31:45] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-06-01 12:31:45] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:31:46] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:31:46] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:31:48] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:48] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:31:48] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:48] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:31:48] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:31:49] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:31:49] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:31:49] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:31:50] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:31:50] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:31:50] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:31:51] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1174 variables, and 283 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 172/172 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60725 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 182 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-13 finished in 60934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 546 transition count 496
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 546 transition count 446
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 496 transition count 446
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 248 place count 490 transition count 440
Iterating global reduction 2 with 6 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 254 place count 490 transition count 435
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 264 place count 485 transition count 435
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 42 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-06-01 12:31:51] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:31:51] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 12:31:51] [INFO ] Invariant cache hit.
[2024-06-01 12:31:51] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-01 12:31:51] [INFO ] Redundant transitions in 3 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:31:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:31:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:31:54] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:31:54] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:31:54] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:31:54] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:31:54] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:31:58] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:31:58] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:31:58] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:31:59] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:31:59] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:31:59] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/435 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:32:03] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:32:05] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:32:06] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:32:09] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:32:10] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:32:13] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/574 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 14 (OVERLAPS) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 29350 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:32:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 701 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 19/19 constraints]
After SMT, in 59395ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 59401ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59811 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-14
Stuttering criterion allowed to conclude after 25324 steps with 104 reset in 98 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-14 finished in 59977 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((F(p0)||p1))) U p1))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 20 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-06-01 12:32:51] [INFO ] Computed 111 invariants in 4 ms
[2024-06-01 12:32:51] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 12:32:51] [INFO ] Invariant cache hit.
[2024-06-01 12:32:52] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-06-01 12:32:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:33:02] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:33:02] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:33:02] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 4 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 4 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 4 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 3 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:33:06] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:33:06] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:33:06] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:33:06] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 3 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:33:07] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:33:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:33:08] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:33:08] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-06-01 12:33:08] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-06-01 12:33:08] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
[2024-06-01 12:33:08] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 3 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-01 12:33:19] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:33:21] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:33:22] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:33:22] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
SMT process timed out in 30071ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30076ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30705 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), true, p0, (OR p1 p0), true]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-15 finished in 30923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((X(p1) U ((X(p1)&&(p2||F(!p0)))||X(G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010B-LTLFireability-10
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 617 transition count 495
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 249 place count 490 transition count 440
Iterating global reduction 2 with 5 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 254 place count 490 transition count 436
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 262 place count 486 transition count 436
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 608 place count 313 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 311 transition count 261
Applied a total of 610 rules in 40 ms. Remains 311 /618 variables (removed 307) and now considering 261/568 (removed 307) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:33:23] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:33:23] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 12:33:23] [INFO ] Invariant cache hit.
[2024-06-01 12:33:23] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-06-01 12:33:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:33:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:33:25] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:33:25] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:33:26] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:33:26] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:33:26] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:33:26] [INFO ] Deduced a trap composed of 104 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:33:26] [INFO ] Deduced a trap composed of 116 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:33:26] [INFO ] Deduced a trap composed of 129 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:33:26] [INFO ] Deduced a trap composed of 148 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:33:28] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:33:29] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:33:29] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 102 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 101 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 438 constraints, problems are : Problem set: 0 solved, 259 unsolved in 15063 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 102 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 101 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 100 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 99 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:33:40] [INFO ] Deduced a trap composed of 117 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/450 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 709 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 28/28 constraints]
After SMT, in 45105ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 45107ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/618 places, 261/568 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 45527 ms. Remains : 311/618 places, 261/568 transitions.
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-10
Product exploration explored 100000 steps with 1211 reset in 278 ms.
Product exploration explored 100000 steps with 1206 reset in 323 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 853 steps (0 resets) in 14 ms. (56 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:34:10] [INFO ] Invariant cache hit.
[2024-06-01 12:34:10] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-06-01 12:34:10] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-06-01 12:34:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:34:10] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-06-01 12:34:10] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-06-01 12:34:10] [INFO ] Computed and/alt/rep : 259/494/259 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 12:34:12] [INFO ] Added : 216 causal constraints over 44 iterations in 1545 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:34:12] [INFO ] Invariant cache hit.
[2024-06-01 12:34:12] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 12:34:12] [INFO ] Invariant cache hit.
[2024-06-01 12:34:12] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-01 12:34:12] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:34:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 104 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 116 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:34:15] [INFO ] Deduced a trap composed of 129 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:34:16] [INFO ] Deduced a trap composed of 148 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:34:17] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:34:18] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:34:18] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:34:21] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:34:21] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:34:21] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 438 constraints, problems are : Problem set: 0 solved, 259 unsolved in 14860 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 102 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 100 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 100 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 99 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:34:29] [INFO ] Deduced a trap composed of 117 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/450 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 709 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 28/28 constraints]
After SMT, in 44899ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 44902ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45273 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 132 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2602 steps (2 resets) in 36 ms. (70 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 385 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:34:58] [INFO ] Invariant cache hit.
[2024-06-01 12:34:59] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-06-01 12:34:59] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-06-01 12:34:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:34:59] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-06-01 12:34:59] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-06-01 12:34:59] [INFO ] Computed and/alt/rep : 259/494/259 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 12:35:01] [INFO ] Added : 216 causal constraints over 44 iterations in 1413 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1228 reset in 289 ms.
Product exploration explored 100000 steps with 1226 reset in 325 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:35:01] [INFO ] Invariant cache hit.
[2024-06-01 12:35:01] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 12:35:01] [INFO ] Invariant cache hit.
[2024-06-01 12:35:02] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-06-01 12:35:02] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-06-01 12:35:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:35:04] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:35:04] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:35:04] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:35:04] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:35:04] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:35:04] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:35:05] [INFO ] Deduced a trap composed of 104 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:35:05] [INFO ] Deduced a trap composed of 116 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:35:05] [INFO ] Deduced a trap composed of 129 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:35:05] [INFO ] Deduced a trap composed of 148 places in 84 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:35:06] [INFO ] Deduced a trap composed of 102 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:35:08] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:35:08] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:35:10] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:35:10] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:35:11] [INFO ] Deduced a trap composed of 101 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 438 constraints, problems are : Problem set: 0 solved, 259 unsolved in 14816 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 102 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 0 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 103 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 102 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 100 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 100 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:35:18] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:35:19] [INFO ] Deduced a trap composed of 99 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:35:19] [INFO ] Deduced a trap composed of 117 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/450 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 709 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 28/28 constraints]
After SMT, in 44870ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 44872ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45274 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-10 finished in 144270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
[2024-06-01 12:35:47] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:35:47] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 12:35:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 618 places, 568 transitions and 1616 arcs took 5 ms.
Total runtime 1668094 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldPPPs-PT-010B-LTLFireability-03
Could not compute solution for formula : ShieldPPPs-PT-010B-LTLFireability-04
FORMULA ShieldPPPs-PT-010B-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-010B-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPs-PT-010B-LTLFireability-10
Could not compute solution for formula : ShieldPPPs-PT-010B-LTLFireability-11

BK_STOP 1717247085580

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPs-PT-010B-LTLFireability-03
ltl formula formula --ltl=/tmp/8689/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 618 places, 568 transitions and 1616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.030 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8689/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8689/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8689/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8689/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 619 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 619, there are 578 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1448 levels ~10000 states ~50760 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~20000 states ~91928 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~40000 states ~173328 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~80000 states ~374784 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~160000 states ~826232 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~320000 states ~1797256 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~640000 states ~3722684 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~1280000 states ~8091072 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~2560000 states ~17219348 transitions
pnml2lts-mc( 1/ 4): ~1448 levels ~5120000 states ~36885444 transitions
pnml2lts-mc( 2/ 4): ~1190 levels ~10240000 states ~97092208 transitions
pnml2lts-mc( 2/ 4): ~1190 levels ~20480000 states ~208010124 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 27590980
pnml2lts-mc( 0/ 4): unique states count: 27596182
pnml2lts-mc( 0/ 4): unique transitions count: 261145564
pnml2lts-mc( 0/ 4): - self-loop count: 239
pnml2lts-mc( 0/ 4): - claim dead count: 233490974
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 27596191
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5322
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 27596191 states 261145601 transitions, fanout: 9.463
pnml2lts-mc( 0/ 4): Total exploration time 367.810 sec (367.800 sec minimum, 367.802 sec on average)
pnml2lts-mc( 0/ 4): States per second: 75028, Transitions per second: 710001
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 274.8MB, 10.4 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 82.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 580 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 274.8MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010B-LTLFireability-04
ltl formula formula --ltl=/tmp/8689/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 618 places, 568 transitions and 1616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8689/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8689/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8689/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8689/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 619 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 619, there are 574 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1514 levels ~10000 states ~63248 transitions
pnml2lts-mc( 1/ 4): ~1514 levels ~20000 states ~105080 transitions
pnml2lts-mc( 1/ 4): ~1514 levels ~40000 states ~195388 transitions
pnml2lts-mc( 1/ 4): ~1581 levels ~80000 states ~372164 transitions
pnml2lts-mc( 1/ 4): ~1581 levels ~160000 states ~808600 transitions
pnml2lts-mc( 1/ 4): ~1581 levels ~320000 states ~1822040 transitions
pnml2lts-mc( 3/ 4): ~1522 levels ~640000 states ~3693980 transitions
pnml2lts-mc( 3/ 4): ~1522 levels ~1280000 states ~7175452 transitions
pnml2lts-mc( 1/ 4): ~1581 levels ~2560000 states ~17503724 transitions
pnml2lts-mc( 1/ 4): ~1582 levels ~5120000 states ~37126108 transitions
pnml2lts-mc( 1/ 4): ~1582 levels ~10240000 states ~77150444 transitions
pnml2lts-mc( 1/ 4): ~1582 levels ~20480000 states ~160215796 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33293190
pnml2lts-mc( 0/ 4): unique states count: 33299176
pnml2lts-mc( 0/ 4): unique transitions count: 255585821
pnml2lts-mc( 0/ 4): - self-loop count: 265
pnml2lts-mc( 0/ 4): - claim dead count: 222240041
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33299188
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6109
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33299188 states 255585851 transitions, fanout: 7.675
pnml2lts-mc( 0/ 4): Total exploration time 479.950 sec (479.950 sec minimum, 479.950 sec on average)
pnml2lts-mc( 0/ 4): States per second: 69381, Transitions per second: 532526
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 318.4MB, 10.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 580 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 318.4MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010B-LTLFireability-08
ltl formula formula --ltl=/tmp/8689/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 618 places, 568 transitions and 1616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8689/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8689/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8689/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8689/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 620 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 619, there are 570 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1343 levels ~10000 states ~51060 transitions
pnml2lts-mc( 1/ 4): ~1343 levels ~20000 states ~73448 transitions
pnml2lts-mc( 0/ 4): ~1238 levels ~40000 states ~119368 transitions
pnml2lts-mc( 0/ 4): ~1238 levels ~80000 states ~225536 transitions
pnml2lts-mc( 0/ 4): ~1238 levels ~160000 states ~457372 transitions
pnml2lts-mc( 0/ 4): ~1238 levels ~320000 states ~950408 transitions
pnml2lts-mc( 1/ 4): ~1348 levels ~640000 states ~1935200 transitions
pnml2lts-mc( 1/ 4): ~1348 levels ~1280000 states ~4020696 transitions
pnml2lts-mc( 0/ 4): ~1257 levels ~2560000 states ~8734440 transitions
pnml2lts-mc( 0/ 4): ~1257 levels ~5120000 states ~18616364 transitions
pnml2lts-mc( 0/ 4): ~1269 levels ~10240000 states ~39657208 transitions
pnml2lts-mc( 0/ 4): ~1270 levels ~20480000 states ~77262308 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33510035
pnml2lts-mc( 0/ 4): unique states count: 33515165
pnml2lts-mc( 0/ 4): unique transitions count: 132756196
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 99201808
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33515176
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5243
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33515176 states 132756222 transitions, fanout: 3.961
pnml2lts-mc( 0/ 4): Total exploration time 416.480 sec (416.480 sec minimum, 416.480 sec on average)
pnml2lts-mc( 0/ 4): States per second: 80472, Transitions per second: 318758
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.6MB, 8.2 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/8.0%
pnml2lts-mc( 0/ 4): Stored 580 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.6MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010B-LTLFireability-09
ltl formula formula --ltl=/tmp/8689/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 618 places, 568 transitions and 1616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8689/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8689/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8689/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8689/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 15 states
pnml2lts-mc( 0/ 4): There are 619 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 619, there are 623 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 8
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 36 transitions, fanout: 1.286
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 88.0 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 580 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010B-LTLFireability-10
ltl formula formula --ltl=/tmp/8689/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 618 places, 568 transitions and 1616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.030 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8689/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8689/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8689/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8689/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 620 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 619, there are 574 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~660 levels ~10000 states ~30312 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~20000 states ~49208 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~40000 states ~89040 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~80000 states ~170740 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~160000 states ~345836 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~320000 states ~717808 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~640000 states ~1455312 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~1280000 states ~3034920 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~2560000 states ~6437856 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~5120000 states ~13376540 transitions
pnml2lts-mc( 3/ 4): ~622 levels ~10240000 states ~26011868 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17963901
pnml2lts-mc( 0/ 4): unique states count: 17966230
pnml2lts-mc( 0/ 4): unique transitions count: 50171456
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 32185887
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 17966240
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2475
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17966240 states 50171477 transitions, fanout: 2.793
pnml2lts-mc( 0/ 4): Total exploration time 250.050 sec (250.030 sec minimum, 250.037 sec on average)
pnml2lts-mc( 0/ 4): States per second: 71851, Transitions per second: 200646
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 201.2MB, 11.7 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 53.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 580 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 201.2MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010B-LTLFireability-11
ltl formula formula --ltl=/tmp/8689/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 618 places, 568 transitions and 1616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8689/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8689/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8689/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8689/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 620 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 619, there are 586 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~849 levels ~10000 states ~38208 transitions
pnml2lts-mc( 1/ 4): ~849 levels ~20000 states ~63840 transitions
pnml2lts-mc( 1/ 4): ~849 levels ~40000 states ~118568 transitions
pnml2lts-mc( 3/ 4): ~800 levels ~80000 states ~222132 transitions
pnml2lts-mc( 3/ 4): ~800 levels ~160000 states ~447320 transitions
pnml2lts-mc( 3/ 4): ~800 levels ~320000 states ~928064 transitions
pnml2lts-mc( 3/ 4): ~800 levels ~640000 states ~1943452 transitions
pnml2lts-mc( 3/ 4): ~801 levels ~1280000 states ~3951980 transitions
pnml2lts-mc( 3/ 4): ~801 levels ~2560000 states ~8264908 transitions
pnml2lts-mc( 1/ 4): ~850 levels ~5120000 states ~18076540 transitions
pnml2lts-mc( 1/ 4): ~850 levels ~10240000 states ~38699188 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17190478
pnml2lts-mc( 0/ 4): unique states count: 17193690
pnml2lts-mc( 0/ 4): unique transitions count: 65834936
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 48616918
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 17193700
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3328
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17193700 states 65834959 transitions, fanout: 3.829
pnml2lts-mc( 0/ 4): Total exploration time 220.530 sec (220.500 sec minimum, 220.513 sec on average)
pnml2lts-mc( 0/ 4): States per second: 77965, Transitions per second: 298531
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 195.4MB, 11.9 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 51.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 580 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 195.4MB (~256.0MB paged-in)

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-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-010B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761100444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010B.tgz
mv ShieldPPPs-PT-010B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;