About the Execution of ITS-Tools for ShieldPPPs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14687.140 | 3600000.00 | 9200382.00 | 4452.70 | T?FFFFFFFFFT???F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761100443.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldPPPs-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761100443
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716968778209
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 07:46:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 07:46:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 07:46:19] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-29 07:46:19] [INFO ] Transformed 683 places.
[2024-05-29 07:46:19] [INFO ] Transformed 633 transitions.
[2024-05-29 07:46:19] [INFO ] Found NUPN structural information;
[2024-05-29 07:46:19] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 633/633 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 617 transition count 567
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 617 transition count 567
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 133 place count 616 transition count 566
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 616 transition count 566
Applied a total of 134 rules in 121 ms. Remains 616 /683 variables (removed 67) and now considering 566/633 (removed 67) transitions.
// Phase 1: matrix 566 rows 616 cols
[2024-05-29 07:46:19] [INFO ] Computed 111 invariants in 29 ms
[2024-05-29 07:46:20] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-29 07:46:20] [INFO ] Invariant cache hit.
[2024-05-29 07:46:20] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 565 sub problems to find dead transitions.
[2024-05-29 07:46:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/616 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:46:31] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 11 ms to minimize.
[2024-05-29 07:46:31] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 4 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 4 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:46:32] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:46:33] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:46:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
[2024-05-29 07:46:33] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 3 ms to minimize.
[2024-05-29 07:46:33] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 4 ms to minimize.
[2024-05-29 07:46:33] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-29 07:46:33] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:46:33] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:46:34] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:46:34] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:46:36] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 3 ms to minimize.
[2024-05-29 07:46:37] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 3 ms to minimize.
[2024-05-29 07:46:37] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 3 ms to minimize.
[2024-05-29 07:46:37] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:46:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:46:37] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:46:37] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:46:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:46:37] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 3 ms to minimize.
[2024-05-29 07:46:38] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/616 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:46:44] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:46:44] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 07:46:44] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 4 ms to minimize.
[2024-05-29 07:46:44] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:46:44] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:46:44] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:46:44] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:46:45] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:46:45] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:46:45] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:46:45] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:46:45] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:46:45] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:46:45] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 3 ms to minimize.
[2024-05-29 07:46:46] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 3 ms to minimize.
[2024-05-29 07:46:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:46:46] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:46:46] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:46:46] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:46:46] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:46:48] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:46:48] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:46:48] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:46:48] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2024-05-29 07:46:49] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 2 ms to minimize.
[2024-05-29 07:46:49] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-29 07:46:49] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2024-05-29 07:46:49] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:46:49] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:46:49] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:46:50] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1182 variables, and 191 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 565 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/616 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:46:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:46:57] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:46:58] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:46:59] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:46:59] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:46:59] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-29 07:46:59] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-29 07:46:59] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:46:59] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:46:59] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/616 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:47:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:47:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:47:02] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:47:02] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:47:03] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-29 07:47:03] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:47:03] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:47:03] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:47:03] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 3 ms to minimize.
[2024-05-29 07:47:03] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 3 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:47:04] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:47:07] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:47:07] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:07] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:47:07] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:47:07] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:47:08] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:47:09] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:47:09] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:47:09] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:09] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:47:11] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:47:11] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:47:11] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:47:11] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:47:11] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:47:11] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:47:11] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:47:12] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:47:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:47:13] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:47:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:47:13] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:47:14] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:47:14] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:47:14] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:47:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:47:14] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:47:14] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:47:14] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:47:14] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-29 07:47:16] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:16] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-29 07:47:16] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:47:16] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-29 07:47:17] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 07:47:18] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:47:18] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:47:18] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-29 07:47:18] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:47:18] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:47:18] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:47:19] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1182 variables, and 291 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 0/565 constraints, Known Traps: 180/180 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 565 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 616/683 places, 566/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61236 ms. Remains : 616/683 places, 566/633 transitions.
Support contains 36 out of 616 places after structural reductions.
[2024-05-29 07:47:21] [INFO ] Flatten gal took : 67 ms
[2024-05-29 07:47:21] [INFO ] Flatten gal took : 34 ms
[2024-05-29 07:47:21] [INFO ] Input system was already deterministic with 566 transitions.
Support contains 31 out of 616 places (down from 36) after GAL structural reductions.
RANDOM walk for 39963 steps (23 resets) in 1245 ms. (32 steps per ms) remains 0/16 properties
Computed a total of 123 stabilizing places and 123 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(p0))) U p1)))'
Support contains 4 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 40 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 07:47:22] [INFO ] Computed 111 invariants in 7 ms
[2024-05-29 07:47:22] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-29 07:47:22] [INFO ] Invariant cache hit.
[2024-05-29 07:47:22] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 07:47:22] [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-05-29 07:47:33] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:47:33] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:47:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:47:33] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:47:33] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 4 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 4 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-29 07:47:34] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 3 ms to minimize.
[2024-05-29 07:47:35] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:47:35] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:47:35] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:47:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:47:35] [INFO ] Deduced a trap composed of 20 places in 37 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-05-29 07:47:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:47:37] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:47:37] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:47:37] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:47:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:47:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:47:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:47:37] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:47:38] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-05-29 07:47:39] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-29 07:47:39] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-29 07:47:39] [INFO ] Deduced a trap composed of 22 places in 111 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-05-29 07:47:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:47:45] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:47:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:47:45] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 4 ms to minimize.
[2024-05-29 07:47:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:47:46] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:47:46] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:47:46] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 07:47:46] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:47:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:47:46] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:47:46] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 2 ms to minimize.
[2024-05-29 07:47:47] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:47] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-29 07:47:47] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-29 07:47:47] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:47:47] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:47:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:47:47] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:47:47] [INFO ] Deduced a trap composed of 23 places in 37 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-05-29 07:47:49] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:47:50] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:50] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-29 07:47:50] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-29 07:47:50] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:47:51] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-29 07:47:52] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 4 ms to minimize.
[2024-05-29 07:47:52] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-29 07:47:52] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:47:52] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:47:52] [INFO ] Deduced a trap composed of 31 places in 50 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 30015 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-05-29 07:47:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:47:59] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:47:59] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-29 07:47:59] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:47:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:48:00] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:48:00] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:48:00] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:48:00] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 3 ms to minimize.
[2024-05-29 07:48:00] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-29 07:48:00] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:48:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:48:01] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:48:01] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:48:01] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:48:01] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-29 07:48:01] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:48:01] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:48:01] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:48:02] [INFO ] Deduced a trap composed of 24 places in 31 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-05-29 07:48:03] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:48:04] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:48:04] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:48:04] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:48:04] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:48:04] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:48:04] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:48:05] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:48:06] [INFO ] Deduced a trap composed of 43 places in 37 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-05-29 07:48:08] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:48:09] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:48:09] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-29 07:48:09] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:48:09] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:48:09] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:48:09] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:48:10] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:48:10] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:48:11] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:48:11] [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-05-29 07:48:13] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:48:13] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:48:13] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:48:14] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:48:14] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:48:14] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:48:14] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:48:14] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2024-05-29 07:48:14] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-05-29 07:48:14] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-29 07:48:15] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:48:15] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:48:15] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:48:15] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-29 07:48:15] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:48:16] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:48:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:48:16] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-29 07:48:17] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-29 07:48:17] [INFO ] Deduced a trap composed of 32 places in 56 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-05-29 07:48:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:48:19] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:48:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:48:19] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-05-29 07:48:19] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:48:19] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:48:20] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:48:20] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-29 07:48:20] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-29 07:48:21] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-29 07:48:21] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-29 07:48:21] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-29 07:48:22] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-29 07:48:22] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1174 variables, and 285 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: 0/561 constraints, Known Traps: 174/174 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 612/616 places, 562/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-00 finished in 61611 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 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 566/566 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 615 transition count 494
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 544 transition count 494
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 544 transition count 445
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 240 place count 495 transition count 445
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 244 place count 491 transition count 441
Iterating global reduction 2 with 4 rules applied. Total rules applied 248 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 248 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 256 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 602 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 604 place count 312 transition count 262
Applied a total of 604 rules in 135 ms. Remains 312 /616 variables (removed 304) and now considering 262/566 (removed 304) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 07:48:23] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 07:48:23] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 07:48:23] [INFO ] Invariant cache hit.
[2024-05-29 07:48:24] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-29 07:48:24] [INFO ] Redundant transitions in 11 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:48:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:48:26] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:48:26] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:48:26] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:48:26] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:48:26] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 0 ms to minimize.
[2024-05-29 07:48:26] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:48:26] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:48:27] [INFO ] Deduced a trap composed of 113 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:48:27] [INFO ] Deduced a trap composed of 129 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:48:31] [INFO ] Deduced a trap composed of 146 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:48:36] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:48:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:48:42] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:48:42] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:48:46] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/574 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:48:50] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 439 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 15/125 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 260/699 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 699 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 16/16 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/616 places, 262/566 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60563 ms. Remains : 312/616 places, 262/566 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-01
Product exploration explored 100000 steps with 136 reset in 462 ms.
Product exploration explored 100000 steps with 136 reset in 484 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 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 2382 steps (1 resets) in 21 ms. (108 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 86 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 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 15 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 07:49:25] [INFO ] Invariant cache hit.
[2024-05-29 07:49:25] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-29 07:49:25] [INFO ] Invariant cache hit.
[2024-05-29 07:49:25] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-29 07:49:25] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:49:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:49:28] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-29 07:49:28] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:49:28] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:49:28] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:49:28] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:49:28] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:49:28] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 2 ms to minimize.
[2024-05-29 07:49:29] [INFO ] Deduced a trap composed of 113 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:49:29] [INFO ] Deduced a trap composed of 129 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:49:33] [INFO ] Deduced a trap composed of 146 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:49:38] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:49:44] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:49:44] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:49:44] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:49:48] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/574 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:49:52] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 439 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 15/125 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 260/699 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 699 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: 16/16 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60539 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 25 ms :[(NOT p0)]
RANDOM walk for 1325 steps (0 resets) in 12 ms. (101 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 188 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 137 reset in 378 ms.
Product exploration explored 100000 steps with 137 reset in 442 ms.
Built C files in :
/tmp/ltsmin10200151039959628873
[2024-05-29 07:50:27] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 07:50:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:50:27] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 07:50:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:50:27] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 07:50:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:50:27] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10200151039959628873
Running compilation step : cd /tmp/ltsmin10200151039959628873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 691 ms.
Running link step : cd /tmp/ltsmin10200151039959628873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10200151039959628873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1256629974964061274.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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-05-29 07:50:42] [INFO ] Invariant cache hit.
[2024-05-29 07:50:42] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-29 07:50:42] [INFO ] Invariant cache hit.
[2024-05-29 07:50:42] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-29 07:50:42] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:50:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 0 ms to minimize.
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:50:45] [INFO ] Deduced a trap composed of 129 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:50:50] [INFO ] Deduced a trap composed of 146 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:50:55] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:01] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:51:01] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:51:01] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:05] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/574 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 439 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 15/125 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 260/699 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 699 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 16/16 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60463 ms. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin13048867285167277794
[2024-05-29 07:51:42] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 07:51:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:51:42] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 07:51:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:51:42] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 07:51:42] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:51:42] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13048867285167277794
Running compilation step : cd /tmp/ltsmin13048867285167277794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 591 ms.
Running link step : cd /tmp/ltsmin13048867285167277794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13048867285167277794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14244778791752630611.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:51:58] [INFO ] Flatten gal took : 16 ms
[2024-05-29 07:51:58] [INFO ] Flatten gal took : 16 ms
[2024-05-29 07:51:58] [INFO ] Time to serialize gal into /tmp/LTL10023154721677249407.gal : 5 ms
[2024-05-29 07:51:58] [INFO ] Time to serialize properties into /tmp/LTL7095034558669867027.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10023154721677249407.gal' '-t' 'CGAL' '-hoa' '/tmp/aut84087859659044441.hoa' '-atoms' '/tmp/LTL7095034558669867027.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL7095034558669867027.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut84087859659044441.hoa
Detected timeout of ITS tools.
[2024-05-29 07:52:13] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:52:13] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:52:13] [INFO ] Time to serialize gal into /tmp/LTL3533700743164363610.gal : 2 ms
[2024-05-29 07:52:13] [INFO ] Time to serialize properties into /tmp/LTL11560619344008038426.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3533700743164363610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11560619344008038426.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p386==0)||(p670==1))"))))
Formula 0 simplified : GF!"((p386==0)||(p670==1))"
Detected timeout of ITS tools.
[2024-05-29 07:52:28] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:52:28] [INFO ] Applying decomposition
[2024-05-29 07:52:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14158000646403813921.txt' '-o' '/tmp/graph14158000646403813921.bin' '-w' '/tmp/graph14158000646403813921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14158000646403813921.bin' '-l' '-1' '-v' '-w' '/tmp/graph14158000646403813921.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:52:28] [INFO ] Decomposing Gal with order
[2024-05-29 07:52:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:52:28] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-29 07:52:28] [INFO ] Flatten gal took : 56 ms
[2024-05-29 07:52:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 8 ms.
[2024-05-29 07:52:28] [INFO ] Time to serialize gal into /tmp/LTL12083873828619496346.gal : 6 ms
[2024-05-29 07:52:28] [INFO ] Time to serialize properties into /tmp/LTL15448329865883037880.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12083873828619496346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15448329865883037880.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.i0.u63.p386==0)||(i9.i2.u109.p670==1))"))))
Formula 0 simplified : GF!"((i5.i0.u63.p386==0)||(i9.i2.u109.p670==1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-01 finished in 259896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 15 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 07:52:43] [INFO ] Computed 111 invariants in 6 ms
[2024-05-29 07:52:43] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-29 07:52:43] [INFO ] Invariant cache hit.
[2024-05-29 07:52:44] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 07:52:44] [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-05-29 07:52:54] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:52:54] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:52:54] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:52:54] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:52:55] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 3 ms to minimize.
[2024-05-29 07:52:55] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 5 ms to minimize.
[2024-05-29 07:52:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:52:55] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:52:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:52:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:52:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:52:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:52:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:52:56] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 4 ms to minimize.
[2024-05-29 07:52:56] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-05-29 07:52:56] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:52:56] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:52:56] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:52:56] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:52:56] [INFO ] Deduced a trap composed of 20 places in 41 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-05-29 07:52:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:52:58] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:52:58] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:52:58] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:52:58] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:52:58] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:52:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 22 places in 110 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-05-29 07:53:06] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:53:06] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:53:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:53:07] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2024-05-29 07:53:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:53:07] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:53:07] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:53:09] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:53:09] [INFO ] Deduced a trap composed of 23 places in 33 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-05-29 07:53:10] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:53:11] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:53:11] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:53:12] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:53:13] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-29 07:53:13] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-29 07:53:13] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-29 07:53:13] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:53:13] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:53:13] [INFO ] Deduced a trap composed of 31 places in 47 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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30012 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-05-29 07:53:21] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:53:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:53:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:53:21] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:53:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:53:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:53:21] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:53:22] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:53:22] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
[2024-05-29 07:53:22] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 3 ms to minimize.
[2024-05-29 07:53:22] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:53:22] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:53:22] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:53:22] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:53:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:53:23] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-29 07:53:23] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:53:23] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:53:23] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:53:23] [INFO ] Deduced a trap composed of 24 places in 33 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-05-29 07:53:24] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:53:25] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:53:25] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:53:25] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-29 07:53:25] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:53:26] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:53:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:53:26] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-29 07:53:27] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-29 07:53:27] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 3 ms to minimize.
[2024-05-29 07:53:27] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:53:27] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:53:27] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:53:27] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:53:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:53:27] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:53:28] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:53:28] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:53:28] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:53:28] [INFO ] Deduced a trap composed of 43 places in 36 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-05-29 07:53:30] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:53:30] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:53:30] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-29 07:53:30] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-29 07:53:31] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:53:31] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-29 07:53:31] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:53:32] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-05-29 07:53:32] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:53:32] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:53:32] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:53:32] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:53:33] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-29 07:53:33] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:53:33] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:53:33] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:53:33] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:53:33] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:53:33] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:53:33] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:53:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:53:35] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:53:35] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:53:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:53:35] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:53:35] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:53:36] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:53:36] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-05-29 07:53:36] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-29 07:53:36] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:53:36] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:53:36] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:53:36] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:53:37] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-29 07:53:37] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:53:37] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:53:37] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:53:38] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-05-29 07:53:39] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-29 07:53:39] [INFO ] Deduced a trap composed of 32 places in 63 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-05-29 07:53:41] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:53:41] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:53:41] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:53:41] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-05-29 07:53:41] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:53:41] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:53:41] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-05-29 07:53:42] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-29 07:53:42] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-05-29 07:53:42] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:53:43] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-29 07:53:43] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-29 07:53:44] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
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 30016 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/616 places, 562/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60832 ms. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-03
Product exploration explored 100000 steps with 439 reset in 322 ms.
Product exploration explored 100000 steps with 438 reset in 280 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 896 steps (0 resets) in 6 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 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 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-29 07:53:45] [INFO ] Invariant cache hit.
[2024-05-29 07:53:45] [INFO ] [Real]Absence check using 111 positive place invariants in 45 ms returned sat
[2024-05-29 07:53:46] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2024-05-29 07:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:53:47] [INFO ] [Nat]Absence check using 111 positive place invariants in 41 ms returned sat
[2024-05-29 07:53:47] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2024-05-29 07:53:47] [INFO ] Computed and/alt/rep : 561/992/561 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-29 07:53:59] [INFO ] Added : 556 causal constraints over 112 iterations in 11713 ms. Result :unknown
Could not prove EG (NOT p0)
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.
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 611 transition count 490
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 540 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 539 transition count 489
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 539 transition count 439
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 489 transition count 439
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 3 with 354 rules applied. Total rules applied 598 place count 312 transition count 262
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 600 place count 310 transition count 260
Applied a total of 600 rules in 45 ms. Remains 310 /612 variables (removed 302) and now considering 260/562 (removed 302) transitions.
// Phase 1: matrix 260 rows 310 cols
[2024-05-29 07:53:59] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:53:59] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 07:53:59] [INFO ] Invariant cache hit.
[2024-05-29 07:54:00] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-29 07:54:00] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 07:54:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:54:02] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:54:02] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:54:02] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:54:02] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:54:02] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:54:02] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:54:02] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:54:02] [INFO ] Deduced a trap composed of 113 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:54:03] [INFO ] Deduced a trap composed of 129 places in 58 ms of which 1 ms to minimize.
[2024-05-29 07:54:03] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:54:07] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:54:11] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:54:13] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 0/570 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 434 constraints, problems are : Problem set: 0 solved, 258 unsolved in 21569 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/434 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 258/692 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 692 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 13/13 constraints]
After SMT, in 51617ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 51620ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/612 places, 260/562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52035 ms. Remains : 310/612 places, 260/562 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 97 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-29 07:54:52] [INFO ] Invariant cache hit.
[2024-05-29 07:54:52] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 07:54:52] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-29 07:54:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:54:52] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 07:54:52] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-05-29 07:54:52] [INFO ] Computed and/alt/rep : 258/493/258 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:54:54] [INFO ] Added : 211 causal constraints over 43 iterations in 1344 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3458 reset in 281 ms.
Product exploration explored 100000 steps with 3503 reset in 325 ms.
Built C files in :
/tmp/ltsmin12187089778136767345
[2024-05-29 07:54:54] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-29 07:54:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:54:54] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-29 07:54:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:54:54] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-29 07:54:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:54:54] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12187089778136767345
Running compilation step : cd /tmp/ltsmin12187089778136767345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin12187089778136767345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12187089778136767345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11210792186217341561.hoa' '--buchi-type=spotba'
LTSmin run took 1105 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-03 finished in 133068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 19 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 07:54:56] [INFO ] Computed 111 invariants in 6 ms
[2024-05-29 07:54:56] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-29 07:54:56] [INFO ] Invariant cache hit.
[2024-05-29 07:54:57] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 07:54:57] [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-05-29 07:55:07] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:07] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:55:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:55:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 3 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 4 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:09] [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-05-29 07:55:11] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 3 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:12] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 22 places in 110 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-05-29 07:55:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:20] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 3 ms to minimize.
[2024-05-29 07:55:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:22] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:55:22] [INFO ] Deduced a trap composed of 23 places in 34 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-05-29 07:55:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-29 07:55:25] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 31 places in 38 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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.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 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.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 1.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 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.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 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)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 191 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: 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-05-29 07:55:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:55:34] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:55:34] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:55:34] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:55:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:35] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:55:35] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 2 ms to minimize.
[2024-05-29 07:55:35] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-05-29 07:55:35] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-29 07:55:35] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:55:35] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:55:35] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:55:36] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:55:36] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:55:36] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-29 07:55:36] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:55:36] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:55:36] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:55:36] [INFO ] Deduced a trap composed of 24 places in 33 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-05-29 07:55:38] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:55:38] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:38] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:55:38] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:39] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:39] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:39] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:55:39] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-29 07:55:40] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-29 07:55:40] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:55:40] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:40] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 43 places in 33 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-05-29 07:55:43] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:55:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-29 07:55:46] [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-05-29 07:55:48] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 27 places in 20 ms of which 0 ms to minimize.
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 07:55:49] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:55:49] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:49] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-29 07:55:49] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
[2024-05-29 07:55:49] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:49] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:49] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:49] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:55:50] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
[2024-05-29 07:55:50] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:55:50] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:55:50] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:55:51] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-05-29 07:55:52] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-29 07:55:52] [INFO ] Deduced a trap composed of 32 places in 50 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-05-29 07:55:54] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:55:54] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:55:54] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:55:54] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:55:54] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:55:55] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 2 ms to minimize.
[2024-05-29 07:55:55] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-29 07:55:56] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-29 07:55:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:55:56] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-29 07:55:56] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 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 30014 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 60090ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 612/616 places, 562/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60688 ms. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 297 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-05 finished in 60796 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(F(p0))||(F(p0)&&p1))))'
Support contains 4 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 613 transition count 563
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 613 transition count 563
Applied a total of 6 rules in 19 ms. Remains 613 /616 variables (removed 3) and now considering 563/566 (removed 3) transitions.
// Phase 1: matrix 563 rows 613 cols
[2024-05-29 07:55:57] [INFO ] Computed 111 invariants in 6 ms
[2024-05-29 07:55:57] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 07:55:57] [INFO ] Invariant cache hit.
[2024-05-29 07:55:58] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 562 sub problems to find dead transitions.
[2024-05-29 07:55:58] [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-05-29 07:56:08] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:56:08] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:56:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 4 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 4 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:56:09] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-29 07:56:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:56:10] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 4 ms to minimize.
[2024-05-29 07:56:10] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 4 ms to minimize.
[2024-05-29 07:56:10] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:56:10] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:56:10] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:56:10] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 07:56:12] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:56:12] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 4 ms to minimize.
[2024-05-29 07:56:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:56:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:56:12] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:56:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:56:13] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:56:14] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:56:14] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 3 ms to minimize.
[2024-05-29 07:56:14] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 3 ms to minimize.
[2024-05-29 07:56:14] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 07:56:20] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:56:20] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 07:56:21] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2024-05-29 07:56:21] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:56:21] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:56:21] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:56:21] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:56:22] [INFO ] Deduced a trap composed of 26 places in 28 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-05-29 07:56:25] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-29 07:56:25] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:56:25] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:56:26] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:56:27] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-29 07:56:27] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-29 07:56:27] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-29 07:56:27] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:56:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:56:27] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30016 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-05-29 07:56:34] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-05-29 07:56:35] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:56:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:56:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:56:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:56:37] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-29 07:56:37] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:56:37] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:56:37] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-29 07:56:37] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-29 07:56:37] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:56:37] [INFO ] Deduced a trap composed of 24 places in 35 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-05-29 07:56:39] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 3 ms to minimize.
[2024-05-29 07:56:40] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 07:56:45] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 4 ms to minimize.
[2024-05-29 07:56:46] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:56:46] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:56:46] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-29 07:56:46] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:56:46] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:56:47] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:56:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:56:48] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 9/240 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 07:56:52] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-29 07:56:52] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:56:53] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:56:53] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-29 07:56:53] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:56:54] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:56:55] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 7/247 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 0)
(s386 1)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/1176 variables, and 247 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 0/562 constraints, Known Traps: 136/136 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 613/616 places, 563/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60709 ms. Remains : 613/616 places, 563/566 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-07
Product exploration explored 100000 steps with 399 reset in 261 ms.
Product exploration explored 100000 steps with 393 reset in 295 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 (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 959 steps (0 resets) in 8 ms. (106 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 101 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-29 07:56:59] [INFO ] Invariant cache hit.
[2024-05-29 07:56:59] [INFO ] [Real]Absence check using 111 positive place invariants in 41 ms returned sat
[2024-05-29 07:57:00] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2024-05-29 07:57:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:57:00] [INFO ] [Nat]Absence check using 111 positive place invariants in 42 ms returned sat
[2024-05-29 07:57:01] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2024-05-29 07:57:01] [INFO ] Computed and/alt/rep : 562/993/562 causal constraints (skipped 0 transitions) in 31 ms.
[2024-05-29 07:57:14] [INFO ] Added : 556 causal constraints over 112 iterations in 12658 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 613 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 : 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 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 594 place count 315 transition count 265
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 313 transition count 263
Applied a total of 596 rules in 43 ms. Remains 313 /613 variables (removed 300) and now considering 263/563 (removed 300) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:57:14] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:57:14] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-29 07:57:14] [INFO ] Invariant cache hit.
[2024-05-29 07:57:14] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-29 07:57:14] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-29 07:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 263/576 variables, 313/424 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 0/576 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 424 constraints, problems are : Problem set: 0 solved, 261 unsolved in 8955 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 263/576 variables, 313/424 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 261/685 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:57:28] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:57:30] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 687 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 38998ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 39001ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/613 places, 263/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39385 ms. Remains : 313/613 places, 263/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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 173 steps (0 resets) in 9 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-29 07:57:54] [INFO ] Invariant cache hit.
[2024-05-29 07:57:54] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 07:57:54] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-29 07:57:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:57:54] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 07:57:54] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-05-29 07:57:54] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-29 07:57:54] [INFO ] Computed and/alt/rep : 261/496/261 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 07:57:56] [INFO ] Added : 260 causal constraints over 52 iterations in 2116 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2103 reset in 280 ms.
Product exploration explored 100000 steps with 2112 reset in 330 ms.
Built C files in :
/tmp/ltsmin8966748125686799275
[2024-05-29 07:57:57] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-05-29 07:57:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:57:57] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-05-29 07:57:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:57:57] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-05-29 07:57:57] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:57:57] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8966748125686799275
Running compilation step : cd /tmp/ltsmin8966748125686799275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 597 ms.
Running link step : cd /tmp/ltsmin8966748125686799275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8966748125686799275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8610301774705641613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 262
Applied a total of 2 rules in 18 ms. Remains 312 /313 variables (removed 1) and now considering 262/263 (removed 1) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 07:58:12] [INFO ] Computed 111 invariants in 0 ms
[2024-05-29 07:58:12] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 07:58:12] [INFO ] Invariant cache hit.
[2024-05-29 07:58:13] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-29 07:58:13] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:58:13] [INFO ] Invariant cache hit.
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, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 262/574 variables, 312/423 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 0/574 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 423 constraints, problems are : Problem set: 0 solved, 260 unsolved in 8694 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 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, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 262/574 variables, 312/423 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 260/683 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:58:28] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:58:28] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:58:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:58:31] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 4/687 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:58:48] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:58:51] [INFO ] Deduced a trap composed of 24 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 689 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 constraints]
After SMT, in 38734ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 38736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 262/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39099 ms. Remains : 312/313 places, 262/263 transitions.
Built C files in :
/tmp/ltsmin5518918306555310120
[2024-05-29 07:58:51] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 07:58:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:58:51] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 07:58:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:58:51] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 07:58:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:58:51] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5518918306555310120
Running compilation step : cd /tmp/ltsmin5518918306555310120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 600 ms.
Running link step : cd /tmp/ltsmin5518918306555310120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5518918306555310120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9419029981605124809.hoa' '--buchi-type=spotba'
LTSmin run took 1124 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-07 finished in 176178 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' '!(((p0 U !p1)&&X((p2 U G(!p0)))))'
Support contains 6 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 614 transition count 564
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 614 transition count 564
Applied a total of 4 rules in 17 ms. Remains 614 /616 variables (removed 2) and now considering 564/566 (removed 2) transitions.
// Phase 1: matrix 564 rows 614 cols
[2024-05-29 07:58:53] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 07:58:53] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-29 07:58:53] [INFO ] Invariant cache hit.
[2024-05-29 07:58:54] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 563 sub problems to find dead transitions.
[2024-05-29 07:58:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 4 ms to minimize.
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 4 ms to minimize.
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:59:05] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 3 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 4 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:59:06] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:59:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:08] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 4 ms to minimize.
[2024-05-29 07:59:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:59:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:59:10] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:16] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:59:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:59:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:59:16] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:59:16] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:59:17] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-29 07:59:17] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 4 ms to minimize.
[2024-05-29 07:59:17] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:59:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:59:17] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:59:17] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-29 07:59:18] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:59:18] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:59:18] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:59:18] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:59:18] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:59:18] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-29 07:59:18] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-29 07:59:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:59:19] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:59:21] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:59:21] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:59:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:59:21] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:59:21] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:59:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:59:21] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:59:22] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:59:22] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:59:22] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-29 07:59:22] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-29 07:59:22] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-29 07:59:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:59:22] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:59:22] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:59:23] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-29 07:59:23] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-29 07:59:23] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-29 07:59:23] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1178 variables, and 191 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/614 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:30] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:59:31] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:59:31] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-29 07:59:31] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-29 07:59:31] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:59:32] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:59:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:59:33] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-29 07:59:33] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-29 07:59:33] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:35] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:59:35] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-29 07:59:36] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:59:36] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:59:36] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:59:36] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:59:36] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 5 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:59:37] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:59:38] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:41] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-29 07:59:41] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 07:59:41] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:59:41] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:59:42] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:59:43] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:59:43] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:59:43] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:59:43] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:47] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-29 07:59:47] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-29 07:59:53] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:59:53] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
[2024-05-29 07:59:53] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:59:53] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1178 variables, and 257 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/614 constraints, PredecessorRefiner: 0/563 constraints, Known Traps: 146/146 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 614/616 places, 564/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 614/616 places, 564/566 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR p1 p0), true, p1, p0, p0]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 366 steps with 0 reset in 6 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-09 finished in 60946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 615 transition count 495
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 141 place count 545 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 544 transition count 494
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 142 place count 544 transition count 443
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 244 place count 493 transition count 443
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 248 place count 489 transition count 439
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 489 transition count 439
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 252 place count 489 transition count 435
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 260 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 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 600 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 602 place count 313 transition count 263
Applied a total of 602 rules in 47 ms. Remains 313 /616 variables (removed 303) and now considering 263/566 (removed 303) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:59:54] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 07:59:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 07:59:54] [INFO ] Invariant cache hit.
[2024-05-29 07:59:54] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-29 07:59:54] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 07:59:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 2/313 variables, 37/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:59:58] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:59:58] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:59:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:59:58] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:59:58] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:00:07] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:00:07] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/576 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:00:11] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/576 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/576 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 432 constraints, problems are : Problem set: 0 solved, 259 unsolved in 23100 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 2/313 variables, 37/112 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:00:20] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 263/576 variables, 313/433 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 259/692 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:00:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:00:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:00:25] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:00:29] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:00:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 5/697 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 697 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 14/14 constraints]
After SMT, in 53148ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 53150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/616 places, 263/566 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53571 ms. Remains : 313/616 places, 263/566 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-10
Product exploration explored 100000 steps with 5943 reset in 308 ms.
Product exploration explored 100000 steps with 5761 reset in 354 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 152 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 176 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-29 08:00:49] [INFO ] Invariant cache hit.
[2024-05-29 08:00:49] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-05-29 08:00:49] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-29 08:00:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:00:50] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-29 08:00:50] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-29 08:00:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 08:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-29 08:00:50] [INFO ] Computed and/alt/rep : 259/566/259 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 08:00:51] [INFO ] Added : 213 causal constraints over 43 iterations in 1556 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 08:00:51] [INFO ] Invariant cache hit.
[2024-05-29 08:00:51] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 08:00:51] [INFO ] Invariant cache hit.
[2024-05-29 08:00:52] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-29 08:00:52] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:00:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 2/313 variables, 37/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:00:56] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:00:56] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:01:04] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:01:04] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/576 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:01:08] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/576 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/576 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 432 constraints, problems are : Problem set: 0 solved, 259 unsolved in 23085 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 2/313 variables, 37/112 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:01:17] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 263/576 variables, 313/433 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 259/692 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:01:23] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 08:01:26] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:01:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 5/697 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 697 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 14/14 constraints]
After SMT, in 53135ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 53137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53486 ms. Remains : 313/313 places, 263/263 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 176 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-29 08:01:45] [INFO ] Invariant cache hit.
[2024-05-29 08:01:46] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 08:01:46] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-05-29 08:01:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:01:46] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-29 08:01:46] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-29 08:01:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-29 08:01:46] [INFO ] Computed and/alt/rep : 259/566/259 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 08:01:48] [INFO ] Added : 213 causal constraints over 43 iterations in 1541 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5880 reset in 305 ms.
Product exploration explored 100000 steps with 5334 reset in 345 ms.
Built C files in :
/tmp/ltsmin953633203358067394
[2024-05-29 08:01:48] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-05-29 08:01:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:01:48] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-05-29 08:01:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:01:48] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-05-29 08:01:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:01:48] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin953633203358067394
Running compilation step : cd /tmp/ltsmin953633203358067394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 621 ms.
Running link step : cd /tmp/ltsmin953633203358067394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin953633203358067394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17700479844658151924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 08:02:04] [INFO ] Invariant cache hit.
[2024-05-29 08:02:04] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 08:02:04] [INFO ] Invariant cache hit.
[2024-05-29 08:02:04] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-29 08:02:04] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:02:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 2/313 variables, 37/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:07] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:02:08] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:02:08] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:02:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:02:08] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:16] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:02:16] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/576 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:21] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/576 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/576 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 432 constraints, problems are : Problem set: 0 solved, 259 unsolved in 22991 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 2/313 variables, 37/112 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:29] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 263/576 variables, 313/433 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 259/692 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:34] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:02:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:02:35] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:02:38] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 5/697 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 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: 313/313 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 14/14 constraints]
After SMT, in 53040ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 53043ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53431 ms. Remains : 313/313 places, 263/263 transitions.
Built C files in :
/tmp/ltsmin18392282849232447394
[2024-05-29 08:02:57] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-05-29 08:02:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:02:57] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-05-29 08:02:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:02:57] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-05-29 08:02:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:02:57] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18392282849232447394
Running compilation step : cd /tmp/ltsmin18392282849232447394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 592 ms.
Running link step : cd /tmp/ltsmin18392282849232447394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin18392282849232447394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12095029577659329048.hoa' '--buchi-type=spotba'
LTSmin run took 1074 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-10 finished in 184650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 615 transition count 495
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 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 140 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 240 place count 495 transition count 445
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 244 place count 491 transition count 441
Iterating global reduction 2 with 4 rules applied. Total rules applied 248 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 248 place count 491 transition count 437
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 256 place count 487 transition count 437
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 594 place count 318 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 316 transition count 266
Applied a total of 596 rules in 47 ms. Remains 316 /616 variables (removed 300) and now considering 266/566 (removed 300) transitions.
// Phase 1: matrix 266 rows 316 cols
[2024-05-29 08:02:59] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 08:02:59] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-29 08:02:59] [INFO ] Invariant cache hit.
[2024-05-29 08:02:59] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-29 08:02:59] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-29 08:02:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 3/316 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:03:02] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:03:03] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:03:03] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:03:03] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:03:03] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:03:03] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:03:03] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:03:04] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:03:04] [INFO ] Deduced a trap composed of 116 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:03:04] [INFO ] Deduced a trap composed of 135 places in 64 ms of which 1 ms to minimize.
[2024-05-29 08:03:04] [INFO ] Deduced a trap composed of 148 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 266/582 variables, 316/438 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:03:07] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:03:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:03:09] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:03:11] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:03:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:03:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:03:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:03:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:03:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:03:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:03:20] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/582 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (OVERLAPS) 0/582 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 449 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28387 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 3/316 variables, 18/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 266/582 variables, 316/451 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 261/712 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:03:57] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 713 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 25/25 constraints]
After SMT, in 58424ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 58427ms
Starting structural reductions in SI_LTL mode, iteration 1 : 316/616 places, 266/566 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58844 ms. Remains : 316/616 places, 266/566 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-12
Product exploration explored 100000 steps with 6181 reset in 260 ms.
Product exploration explored 100000 steps with 6068 reset in 313 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 167 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 266/266 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-29 08:03:59] [INFO ] Invariant cache hit.
[2024-05-29 08:03:59] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 08:03:59] [INFO ] Invariant cache hit.
[2024-05-29 08:03:59] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-29 08:03:59] [INFO ] Redundant transitions in 0 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-29 08:03:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 3/316 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:04:03] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 08:04:03] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:04:03] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:04:03] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:04:03] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:04:03] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:04:04] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:04:04] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:04:04] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:04:04] [INFO ] Deduced a trap composed of 135 places in 59 ms of which 2 ms to minimize.
[2024-05-29 08:04:04] [INFO ] Deduced a trap composed of 148 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 266/582 variables, 316/438 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:04:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:04:07] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:04:09] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:04:11] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:04:12] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:04:12] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:04:13] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:04:14] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:04:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:04:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:04:20] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/582 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (OVERLAPS) 0/582 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 449 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 3/316 variables, 18/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:04:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:04:30] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 266/582 variables, 316/451 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 261/712 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:04:57] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 713 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 25/25 constraints]
After SMT, in 58092ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 58095ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58494 ms. Remains : 316/316 places, 266/266 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 141 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6008 reset in 265 ms.
Product exploration explored 100000 steps with 6056 reset in 297 ms.
Built C files in :
/tmp/ltsmin12835684287684902442
[2024-05-29 08:04:58] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-29 08:04:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:04:58] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-29 08:04:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:04:59] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-29 08:04:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:04:59] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12835684287684902442
Running compilation step : cd /tmp/ltsmin12835684287684902442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 602 ms.
Running link step : cd /tmp/ltsmin12835684287684902442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12835684287684902442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14539463912662509705.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 266/266 transitions.
Applied a total of 0 rules in 19 ms. Remains 316 /316 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-29 08:05:14] [INFO ] Invariant cache hit.
[2024-05-29 08:05:14] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-29 08:05:14] [INFO ] Invariant cache hit.
[2024-05-29 08:05:14] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-29 08:05:14] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-29 08:05:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 3/316 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:05:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:05:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:05:18] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:05:18] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:05:18] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:05:18] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:05:18] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:05:18] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:05:18] [INFO ] Deduced a trap composed of 116 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:05:19] [INFO ] Deduced a trap composed of 135 places in 51 ms of which 2 ms to minimize.
[2024-05-29 08:05:19] [INFO ] Deduced a trap composed of 148 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 266/582 variables, 316/438 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:05:22] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:05:22] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:05:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:05:26] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:05:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:05:27] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:05:28] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:05:29] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:05:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:05:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:05:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/582 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (OVERLAPS) 0/582 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 449 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28238 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 3/316 variables, 18/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 08:05:44] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:05:44] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 266/582 variables, 316/451 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 261/712 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 712 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 24/24 constraints]
After SMT, in 58281ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 58284ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58677 ms. Remains : 316/316 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin12773999969855218847
[2024-05-29 08:06:12] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-29 08:06:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:06:12] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-29 08:06:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:06:12] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-29 08:06:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:06:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12773999969855218847
Running compilation step : cd /tmp/ltsmin12773999969855218847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 618 ms.
Running link step : cd /tmp/ltsmin12773999969855218847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12773999969855218847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10715438043952957637.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:06:27] [INFO ] Flatten gal took : 11 ms
[2024-05-29 08:06:27] [INFO ] Flatten gal took : 10 ms
[2024-05-29 08:06:27] [INFO ] Time to serialize gal into /tmp/LTL1984084802713690467.gal : 2 ms
[2024-05-29 08:06:27] [INFO ] Time to serialize properties into /tmp/LTL17301870059582283608.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1984084802713690467.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10051438329794646994.hoa' '-atoms' '/tmp/LTL17301870059582283608.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17301870059582283608.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10051438329794646994.hoa
Detected timeout of ITS tools.
[2024-05-29 08:06:43] [INFO ] Flatten gal took : 10 ms
[2024-05-29 08:06:43] [INFO ] Flatten gal took : 9 ms
[2024-05-29 08:06:43] [INFO ] Time to serialize gal into /tmp/LTL3996306592967990010.gal : 2 ms
[2024-05-29 08:06:43] [INFO ] Time to serialize properties into /tmp/LTL5972608956349457115.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3996306592967990010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5972608956349457115.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p507==0)||(p59==1))&&(((p614==0)||(p510==1))||((p59==0)&&(p507==1))))"))))
Formula 0 simplified : FG!"(((p507==0)||(p59==1))&&(((p614==0)||(p510==1))||((p59==0)&&(p507==1))))"
Detected timeout of ITS tools.
[2024-05-29 08:06:58] [INFO ] Flatten gal took : 14 ms
[2024-05-29 08:06:58] [INFO ] Applying decomposition
[2024-05-29 08:06:58] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3725869657538319429.txt' '-o' '/tmp/graph3725869657538319429.bin' '-w' '/tmp/graph3725869657538319429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3725869657538319429.bin' '-l' '-1' '-v' '-w' '/tmp/graph3725869657538319429.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:06:58] [INFO ] Decomposing Gal with order
[2024-05-29 08:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:06:58] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-29 08:06:58] [INFO ] Flatten gal took : 19 ms
[2024-05-29 08:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 7 ms.
[2024-05-29 08:06:58] [INFO ] Time to serialize gal into /tmp/LTL22423921809083234.gal : 5 ms
[2024-05-29 08:06:58] [INFO ] Time to serialize properties into /tmp/LTL72207659935857163.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL22423921809083234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL72207659935857163.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...250
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i7.i0.u84.p507==0)||(i0.i2.u10.p59==1))&&(((i8.i2.u102.p614==0)||(i7.i0.u86.p510==1))||((i0.i2.u10.p59==0)&&(i7.i0.u84.p507...167
Formula 0 simplified : FG!"(((i7.i0.u84.p507==0)||(i0.i2.u10.p59==1))&&(((i8.i2.u102.p614==0)||(i7.i0.u86.p510==1))||((i0.i2.u10.p59==0)&&(i7.i0.u84.p507==...161
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-12 finished in 254034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 20 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 08:07:13] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 08:07:13] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 08:07:13] [INFO ] Invariant cache hit.
[2024-05-29 08:07:13] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:07:13] [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-05-29 08:07:24] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 4 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 4 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:07:26] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-29 08:07:26] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 3 ms to minimize.
[2024-05-29 08:07:26] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:07:26] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:07:26] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:07:26] [INFO ] Deduced a trap composed of 20 places in 37 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-05-29 08:07:28] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 4 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:30] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:07:30] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-05-29 08:07:30] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-05-29 08:07:30] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-05-29 08:07:30] [INFO ] Deduced a trap composed of 22 places in 112 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-05-29 08:07:36] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:07:36] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 4 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:07:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:07:38] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:07:38] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:07:38] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:38] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:07:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:07:38] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:07:38] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:07:39] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-29 08:07:39] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-29 08:07:39] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 3 ms to minimize.
[2024-05-29 08:07:39] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:07:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:07:39] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:07:39] [INFO ] Deduced a trap composed of 23 places in 33 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-05-29 08:07:41] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:43] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 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 186 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: 561/561 constraints, Known Traps: 75/75 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, 75/186 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:07:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:07:53] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:07:53] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:07:53] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:07:53] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:55] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:07:55] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:07:57] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:07:57] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:57] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-29 08:07:57] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:07:57] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:07:57] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-29 08:07:57] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-05-29 08:07:58] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:08:00] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:08:02] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:08:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:08:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 13/239 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:08:07] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:08:07] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:08:07] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:08:07] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:08:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:08:08] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:08:08] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:08:08] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-29 08:08:13] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:08:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:08:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:08:13] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-29 08:08:13] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-29 08:08:14] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
SMT process timed out in 60139ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 612/616 places, 562/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60789 ms. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-13
Product exploration explored 100000 steps with 4170 reset in 140 ms.
Product exploration explored 100000 steps with 4201 reset in 146 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/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 2521 steps (0 resets) in 20 ms. (120 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-29 08:08:15] [INFO ] Invariant cache hit.
[2024-05-29 08:08:15] [INFO ] [Real]Absence check using 111 positive place invariants in 43 ms returned sat
[2024-05-29 08:08:16] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2024-05-29 08:08:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:08:16] [INFO ] [Nat]Absence check using 111 positive place invariants in 45 ms returned sat
[2024-05-29 08:08:17] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2024-05-29 08:08:17] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-05-29 08:08:17] [INFO ] Computed and/alt/rep : 561/992/561 causal constraints (skipped 0 transitions) in 31 ms.
[2024-05-29 08:08:29] [INFO ] Added : 556 causal constraints over 112 iterations in 11307 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 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 12 ms. Remains 612 /612 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 08:08:29] [INFO ] Invariant cache hit.
[2024-05-29 08:08:29] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-29 08:08:29] [INFO ] Invariant cache hit.
[2024-05-29 08:08:29] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:08:29] [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-05-29 08:08:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:08:40] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:08:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:08:40] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 4 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 4 ms to minimize.
[2024-05-29 08:08:42] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-05-29 08:08:42] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:08:42] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:08:42] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:08:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:08:42] [INFO ] Deduced a trap composed of 20 places in 29 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-05-29 08:08:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:08:44] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:08:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:08:44] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:08:44] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-29 08:08:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:08:44] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:08:44] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:08:45] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 3 ms to minimize.
[2024-05-29 08:08:46] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2024-05-29 08:08:46] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-29 08:08:46] [INFO ] Deduced a trap composed of 22 places in 119 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-05-29 08:08:52] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:08:52] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:08:52] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:08:52] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 4 ms to minimize.
[2024-05-29 08:08:53] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:08:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:08:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:08:54] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:08:55] [INFO ] Deduced a trap composed of 23 places in 37 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-05-29 08:08:56] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:08:57] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-29 08:08:58] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:08:59] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:08:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:08:59] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-29 08:08:59] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-29 08:08:59] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-29 08:08:59] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:08:59] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:08:59] [INFO ] Deduced a trap composed of 31 places in 37 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-05-29 08:09:06] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:09:06] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:09:06] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:09:06] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:09:07] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:07] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:09:07] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:09:07] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:09:07] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-29 08:09:07] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:09:09] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:09:09] [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-05-29 08:09:10] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:09:11] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-29 08:09:11] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:09:11] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:09:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:09:11] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:09:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:09:12] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:09:13] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:09:14] [INFO ] Deduced a trap composed of 43 places in 43 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-05-29 08:09:16] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:09:16] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:09:16] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-29 08:09:16] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:09:16] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:09:16] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:09:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:09:17] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:09:18] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:09:19] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:09:19] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:09:19] [INFO ] Deduced a trap composed of 33 places in 51 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-05-29 08:09:21] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:09:21] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:09:21] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-29 08:09:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:09:21] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 08:09:21] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:09:21] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:09:22] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-05-29 08:09:22] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-29 08:09:22] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:09:22] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:09:22] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:09:22] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:09:22] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:09:23] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-29 08:09:23] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:09:23] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:09:23] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-29 08:09:24] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:09:24] [INFO ] Deduced a trap composed of 32 places in 50 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-05-29 08:09:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:09:26] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:09:26] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:09:26] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:09:26] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-29 08:09:29] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
SMT process timed out in 60079ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in LTL mode , in 1 iterations and 60681 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
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/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2529 steps (0 resets) in 18 ms. (133 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 08:09:30] [INFO ] Invariant cache hit.
[2024-05-29 08:09:30] [INFO ] [Real]Absence check using 111 positive place invariants in 39 ms returned sat
[2024-05-29 08:09:31] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2024-05-29 08:09:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:09:32] [INFO ] [Nat]Absence check using 111 positive place invariants in 42 ms returned sat
[2024-05-29 08:09:33] [INFO ] [Nat]Absence check using state equation in 1372 ms returned sat
[2024-05-29 08:09:33] [INFO ] Computed and/alt/rep : 561/992/561 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-29 08:09:46] [INFO ] Added : 560 causal constraints over 112 iterations in 12573 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4171 reset in 139 ms.
Product exploration explored 100000 steps with 4193 reset in 145 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 562/562 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 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 71 place count 612 transition count 563
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 92 place count 612 transition count 563
Performed 205 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 297 places in 0 ms
Iterating global reduction 1 with 205 rules applied. Total rules applied 297 place count 612 transition count 563
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 369 place count 540 transition count 491
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 441 place count 540 transition count 491
Deduced a syphon composed of 225 places in 0 ms
Applied a total of 441 rules in 76 ms. Remains 540 /612 variables (removed 72) and now considering 491/562 (removed 71) transitions.
[2024-05-29 08:09:46] [INFO ] Redundant transitions in 3 ms returned []
Running 490 sub problems to find dead transitions.
// Phase 1: matrix 491 rows 540 cols
[2024-05-29 08:09:46] [INFO ] Computed 111 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/540 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 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 TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD463 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 20/131 constraints. Problems are: Problem set: 81 solved, 409 unsolved
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-29 08:09:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 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 TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 20/151 constraints. Problems are: Problem set: 137 solved, 353 unsolved
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD140 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem 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 TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/171 constraints. Problems are: Problem set: 187 solved, 303 unsolved
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-29 08:10:01] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD261 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD284 is UNSAT
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD307 is UNSAT
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD330 is UNSAT
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD353 is UNSAT
[2024-05-29 08:10:03] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-29 08:10:03] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 3 ms to minimize.
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 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 TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/191 constraints. Problems are: Problem set: 221 solved, 269 unsolved
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD376 is UNSAT
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 3 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD399 is UNSAT
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD422 is UNSAT
[2024-05-29 08:10:06] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD445 is UNSAT
[2024-05-29 08:10:06] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:10:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD467 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 10/201 constraints. Problems are: Problem set: 226 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/201 constraints. Problems are: Problem set: 226 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 491/1031 variables, 540/741 constraints. Problems are: Problem set: 226 solved, 264 unsolved
[2024-05-29 08:10:11] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 08:10:11] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:10:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:10:12] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:10:12] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:10:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:10:12] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:10:12] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:10:14] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1031 variables, 17/758 constraints. Problems are: Problem set: 226 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1031/1031 variables, and 758 constraints, problems are : Problem set: 226 solved, 264 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 540/540 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 107/107 constraints]
Escalating to Integer solving :Problem set: 226 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 0/0 constraints. Problems are: Problem set: 226 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 226/540 variables, 111/111 constraints. Problems are: Problem set: 226 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 107/218 constraints. Problems are: Problem set: 226 solved, 264 unsolved
[2024-05-29 08:10:20] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/219 constraints. Problems are: Problem set: 226 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 0/219 constraints. Problems are: Problem set: 226 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 491/1031 variables, 540/759 constraints. Problems are: Problem set: 226 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1031 variables, 264/1023 constraints. Problems are: Problem set: 226 solved, 264 unsolved
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:10:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
SMT process timed out in 60137ms, After SMT, problems are : Problem set: 226 solved, 264 unsolved
Search for dead transitions found 226 dead transitions in 60142ms
Found 226 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 226 transitions
Dead transitions reduction (with SMT) removed 226 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 540/612 places, 265/562 transitions.
Graph (complete) has 826 edges and 540 vertex of which 315 are kept as prefixes of interest. Removing 225 places using SCC suffix rule.1 ms
Discarding 225 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 315 /540 variables (removed 225) and now considering 265/265 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 315/612 places, 265/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60241 ms. Remains : 315/612 places, 265/562 transitions.
Built C files in :
/tmp/ltsmin720228918422774282
[2024-05-29 08:10:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin720228918422774282
Running compilation step : cd /tmp/ltsmin720228918422774282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 995 ms.
Running link step : cd /tmp/ltsmin720228918422774282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin720228918422774282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16080440861030588621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 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 18 ms. Remains 612 /612 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 08:11:02] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 08:11:02] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-29 08:11:02] [INFO ] Invariant cache hit.
[2024-05-29 08:11:02] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:11: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-05-29 08:11:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-29 08:11:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:11:13] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:11:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 3 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 4 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 08:11:14] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 4 ms to minimize.
[2024-05-29 08:11:15] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-05-29 08:11:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:11:15] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:11:15] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:11:15] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:11:15] [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-05-29 08:11:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:11:17] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:11:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:11:17] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:11:17] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:11:17] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:11:17] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:11:17] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 3 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:11:18] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-05-29 08:11:19] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 4 ms to minimize.
[2024-05-29 08:11:19] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-05-29 08:11:19] [INFO ] Deduced a trap composed of 22 places in 104 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-05-29 08:11:25] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:11:25] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 08:11:25] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:11:25] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 3 ms to minimize.
[2024-05-29 08:11:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:11:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:11:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:11:26] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:11:26] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:11:27] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:11:27] [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-05-29 08:11:29] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:11:30] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-29 08:11:30] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:31] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:32] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-29 08:11:32] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-29 08:11:32] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-29 08:11:32] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-29 08:11:32] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:11:32] [INFO ] Deduced a trap composed of 31 places in 44 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-05-29 08:11:39] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:11:39] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:11:39] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-29 08:11:40] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:11:40] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:11:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:11:40] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:11:40] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:11:40] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-29 08:11:41] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-29 08:11:41] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:11:41] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:11:41] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:11:41] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:11:41] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:11:41] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:11:42] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:11:42] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-29 08:11:42] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:11:42] [INFO ] Deduced a trap composed of 24 places in 32 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-05-29 08:11:43] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:11:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:11:44] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:11:44] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:11:44] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:11:44] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:11:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:11:45] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:11:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:11:47] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:11:47] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:47] [INFO ] Deduced a trap composed of 43 places in 41 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-05-29 08:11:49] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:11:49] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-29 08:11:49] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:11:49] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:11:51] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-29 08:11:51] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:11:51] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:11:51] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:11:51] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:11:52] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:11:52] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:11:52] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:11:52] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:11:52] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:11:52] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:11:52] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:11:52] [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-05-29 08:11:54] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:11:54] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:11:54] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:11:54] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:11:54] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 08:11:55] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:11:55] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:11:55] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-05-29 08:11:55] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 3 ms to minimize.
[2024-05-29 08:11:55] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2024-05-29 08:11:55] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:11:55] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-29 08:11:55] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:11:56] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:11:56] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:11:56] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:11:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:11:57] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-29 08:11:58] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-29 08:11:58] [INFO ] Deduced a trap composed of 32 places in 60 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-05-29 08:12:00] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:12:00] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:12:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:12:00] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-05-29 08:12:00] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:12:00] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:12:01] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:12:01] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-29 08:12:02] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:12:02] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-29 08:12:02] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-29 08:12:02] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 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 30014 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 60082ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in LTL mode , in 1 iterations and 60758 ms. Remains : 612/612 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin13999821115935046220
[2024-05-29 08:12:02] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13999821115935046220
Running compilation step : cd /tmp/ltsmin13999821115935046220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1075 ms.
Running link step : cd /tmp/ltsmin13999821115935046220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13999821115935046220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased698018754149084465.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:12:17] [INFO ] Flatten gal took : 16 ms
[2024-05-29 08:12:18] [INFO ] Flatten gal took : 15 ms
[2024-05-29 08:12:18] [INFO ] Time to serialize gal into /tmp/LTL9013598155714517377.gal : 6 ms
[2024-05-29 08:12:18] [INFO ] Time to serialize properties into /tmp/LTL1856475710062013376.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9013598155714517377.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15409608792931054920.hoa' '-atoms' '/tmp/LTL1856475710062013376.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1856475710062013376.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15409608792931054920.hoa
Detected timeout of ITS tools.
[2024-05-29 08:12:33] [INFO ] Flatten gal took : 14 ms
[2024-05-29 08:12:33] [INFO ] Flatten gal took : 13 ms
[2024-05-29 08:12:33] [INFO ] Time to serialize gal into /tmp/LTL987327241003356332.gal : 7 ms
[2024-05-29 08:12:33] [INFO ] Time to serialize properties into /tmp/LTL9157210429399426609.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL987327241003356332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9157210429399426609.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p5==1)"))||("((p331!=0)&&(p552!=1))")))))
Formula 0 simplified : XG(!"((p331!=0)&&(p552!=1))" & X!"(p5==1)")
Detected timeout of ITS tools.
[2024-05-29 08:12:48] [INFO ] Flatten gal took : 13 ms
[2024-05-29 08:12:48] [INFO ] Applying decomposition
[2024-05-29 08:12:48] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8928047417642261199.txt' '-o' '/tmp/graph8928047417642261199.bin' '-w' '/tmp/graph8928047417642261199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8928047417642261199.bin' '-l' '-1' '-v' '-w' '/tmp/graph8928047417642261199.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:12:48] [INFO ] Decomposing Gal with order
[2024-05-29 08:12:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:12:48] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-29 08:12:48] [INFO ] Flatten gal took : 27 ms
[2024-05-29 08:12:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 08:12:48] [INFO ] Time to serialize gal into /tmp/LTL13180379326544386815.gal : 7 ms
[2024-05-29 08:12:48] [INFO ] Time to serialize properties into /tmp/LTL17119831062138170281.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13180379326544386815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17119831062138170281.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i4.i0.i0.u2.p5==1)"))||("((i4.i3.i1.u120.p331!=0)&&(i9.i0.i0.u195.p552!=1))")))))
Formula 0 simplified : XG(!"((i4.i3.i1.u120.p331!=0)&&(i9.i0.i0.u195.p552!=1))" & X!"(i4.i0.i0.u2.p5==1)")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-13 finished in 350132 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 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 566/566 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 615 transition count 493
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 543 transition count 493
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 543 transition count 443
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 493 transition count 443
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 248 place count 489 transition count 439
Iterating global reduction 2 with 4 rules applied. Total rules applied 252 place count 489 transition count 439
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 489 transition count 435
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 260 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 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 602 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 604 place count 312 transition count 262
Applied a total of 604 rules in 43 ms. Remains 312 /616 variables (removed 304) and now considering 262/566 (removed 304) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 08:13:03] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 08:13:03] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 08:13:03] [INFO ] Invariant cache hit.
[2024-05-29 08:13:03] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-29 08:13:03] [INFO ] Redundant transitions in 0 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:13:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:13:06] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:13:06] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:13:06] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:13:06] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:13:10] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:13:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:13:10] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:13:10] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:13:10] [INFO ] Deduced a trap composed of 112 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:13:11] [INFO ] Deduced a trap composed of 130 places in 61 ms of which 1 ms to minimize.
[2024-05-29 08:13:11] [INFO ] Deduced a trap composed of 147 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/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-05-29 08:13:18] [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
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:13:23] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:13:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:13:23] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (OVERLAPS) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 439 constraints, problems are : Problem set: 0 solved, 259 unsolved in 27514 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 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, 101/101 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 259/698 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/698 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 698 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: 16/16 constraints]
After SMT, in 57556ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 57558ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/616 places, 262/566 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57975 ms. Remains : 312/616 places, 262/566 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-14
Product exploration explored 100000 steps with 140 reset in 374 ms.
Product exploration explored 100000 steps with 141 reset in 431 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 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 176 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 13 steps (0 resets) in 5 ms. (2 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 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 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-05-29 08:14:02] [INFO ] Invariant cache hit.
[2024-05-29 08:14:02] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 08:14:02] [INFO ] Invariant cache hit.
[2024-05-29 08:14:03] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-29 08:14:03] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:14:05] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 08:14:05] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:14:05] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:14:05] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:14:05] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:14:09] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:14:09] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:14:09] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:14:09] [INFO ] Deduced a trap composed of 99 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:14:10] [INFO ] Deduced a trap composed of 112 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:14:10] [INFO ] Deduced a trap composed of 130 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:14:10] [INFO ] Deduced a trap composed of 147 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/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-05-29 08:14:17] [INFO ] Deduced a trap composed of 10 places in 23 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
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:14:21] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:14:21] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-29 08:14:22] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (OVERLAPS) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 439 constraints, problems are : Problem set: 0 solved, 259 unsolved in 27076 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 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, 101/101 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 259/698 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/698 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 698 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
After SMT, in 57115ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 57117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57470 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
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 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 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 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 142 reset in 378 ms.
Product exploration explored 100000 steps with 141 reset in 429 ms.
Built C files in :
/tmp/ltsmin17322405606641680294
[2024-05-29 08:15:01] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 08:15:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:15:01] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 08:15:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:15:01] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 08:15:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:15:01] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17322405606641680294
Running compilation step : cd /tmp/ltsmin17322405606641680294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 606 ms.
Running link step : cd /tmp/ltsmin17322405606641680294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17322405606641680294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4672116134994317455.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 9 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 08:15:16] [INFO ] Invariant cache hit.
[2024-05-29 08:15:16] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-29 08:15:16] [INFO ] Invariant cache hit.
[2024-05-29 08:15:16] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-29 08:15:16] [INFO ] Redundant transitions in 0 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:15:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:15:19] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:15:19] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:15:19] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:15:19] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:15:23] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:15:23] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 08:15:23] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:15:23] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:15:23] [INFO ] Deduced a trap composed of 112 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:15:24] [INFO ] Deduced a trap composed of 130 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:15:24] [INFO ] Deduced a trap composed of 147 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/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-05-29 08:15:30] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:15:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:15:35] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-29 08:15:35] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (OVERLAPS) 0/574 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 439 constraints, problems are : Problem set: 0 solved, 259 unsolved in 25844 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 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, 101/101 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 259/698 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/698 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 698 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
After SMT, in 55881ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 55883ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56252 ms. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin14928257828333884327
[2024-05-29 08:16:12] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 08:16:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:16:12] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 08:16:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:16:12] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 08:16:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:16:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14928257828333884327
Running compilation step : cd /tmp/ltsmin14928257828333884327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 590 ms.
Running link step : cd /tmp/ltsmin14928257828333884327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14928257828333884327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11387378413086490552.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:16:27] [INFO ] Flatten gal took : 8 ms
[2024-05-29 08:16:28] [INFO ] Flatten gal took : 15 ms
[2024-05-29 08:16:28] [INFO ] Time to serialize gal into /tmp/LTL1109048483113714891.gal : 2 ms
[2024-05-29 08:16:28] [INFO ] Time to serialize properties into /tmp/LTL16253955270523276410.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1109048483113714891.gal' '-t' 'CGAL' '-hoa' '/tmp/aut542278982488665124.hoa' '-atoms' '/tmp/LTL16253955270523276410.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL16253955270523276410.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut542278982488665124.hoa
Detected timeout of ITS tools.
[2024-05-29 08:16:43] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:16:43] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:16:43] [INFO ] Time to serialize gal into /tmp/LTL7531118754454637840.gal : 2 ms
[2024-05-29 08:16:43] [INFO ] Time to serialize properties into /tmp/LTL546332871211422497.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7531118754454637840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL546332871211422497.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G("((p351==0)||(p626==1))"))))
Formula 0 simplified : GF!"((p351==0)||(p626==1))"
Detected timeout of ITS tools.
[2024-05-29 08:16:58] [INFO ] Flatten gal took : 11 ms
[2024-05-29 08:16:58] [INFO ] Applying decomposition
[2024-05-29 08:16:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5873710505420547439.txt' '-o' '/tmp/graph5873710505420547439.bin' '-w' '/tmp/graph5873710505420547439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5873710505420547439.bin' '-l' '-1' '-v' '-w' '/tmp/graph5873710505420547439.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:16:58] [INFO ] Decomposing Gal with order
[2024-05-29 08:16:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:16:58] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 08:16:58] [INFO ] Flatten gal took : 14 ms
[2024-05-29 08:16:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 3 ms.
[2024-05-29 08:16:58] [INFO ] Time to serialize gal into /tmp/LTL17291206221555978942.gal : 3 ms
[2024-05-29 08:16:58] [INFO ] Time to serialize properties into /tmp/LTL10736177690752192773.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17291206221555978942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10736177690752192773.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.i1.u56.p351==0)||(i9.i0.u101.p626==1))"))))
Formula 0 simplified : GF!"((i5.i1.u56.p351==0)||(i9.i0.u101.p626==1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-14 finished in 249892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 18 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 08:17:13] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 08:17:13] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 08:17:13] [INFO ] Invariant cache hit.
[2024-05-29 08:17:13] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:17:13] [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-05-29 08:17:24] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:17:24] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:17:24] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:17:24] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:17:24] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 4 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 4 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-29 08:17:25] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 3 ms to minimize.
[2024-05-29 08:17:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:17:26] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:17:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:17:26] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:17:26] [INFO ] Deduced a trap composed of 20 places in 29 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-05-29 08:17:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:17:28] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-05-29 08:17:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:17:28] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:17:28] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:17:28] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:17:28] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:17:28] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 3 ms to minimize.
[2024-05-29 08:17:28] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 4 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-29 08:17:29] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-29 08:17:30] [INFO ] Deduced a trap composed of 22 places in 106 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-05-29 08:17:36] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:17:36] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 08:17:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:17:36] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 3 ms to minimize.
[2024-05-29 08:17:36] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:17:37] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 08:17:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:17:37] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:17:37] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:17:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:17:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:17:37] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:17:37] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:17:38] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-29 08:17:38] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:17:38] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:17:38] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:17:38] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:17:38] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:17:38] [INFO ] Deduced a trap composed of 23 places in 30 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-05-29 08:17:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:17:41] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:17:41] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:17:41] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-29 08:17:41] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:17:41] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:17:41] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:17:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-29 08:17:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:17:43] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:17:43] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:17:43] [INFO ] Deduced a trap composed of 31 places in 37 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 30016 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-05-29 08:17:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:17:50] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:17:50] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:17:50] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:17:51] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:17:51] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:17:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:17:51] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:17:51] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 3 ms to minimize.
[2024-05-29 08:17:51] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 3 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-05-29 08:17:52] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:17:53] [INFO ] Deduced a trap composed of 24 places in 31 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-05-29 08:17:54] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-29 08:17:55] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:17:55] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:17:55] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:17:55] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:17:55] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:17:55] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:17:56] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 43 places in 41 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-05-29 08:18:00] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:18:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:18:03] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:18:03] [INFO ] Deduced a trap composed of 33 places in 40 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-05-29 08:18:05] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:18:05] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:18:05] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:18:05] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:18:05] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 08:18:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:18:05] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:18:06] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-05-29 08:18:06] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 3 ms to minimize.
[2024-05-29 08:18:06] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:18:06] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:18:06] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:18:06] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:18:07] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-29 08:18:07] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:18:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:18:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:18:08] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:18:08] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:18:08] [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/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:18:11] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:18:11] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:18:11] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:18:11] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:18:11] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:18:12] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2024-05-29 08:18:12] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:18:12] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-29 08:18:13] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 1)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 0)
(s484 0)
(s485 1)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 0)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 1)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)timeout
(s519 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30015 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 60082ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 612/616 places, 562/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-15 finished in 60812 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' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010B-LTLCardinality-13
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 616/616 places, 566/566 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 615 transition count 493
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 543 transition count 493
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 543 transition count 443
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 493 transition count 443
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 248 place count 489 transition count 439
Iterating global reduction 2 with 4 rules applied. Total rules applied 252 place count 489 transition count 439
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 489 transition count 435
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 260 place count 485 transition count 435
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 598 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 600 place count 314 transition count 264
Applied a total of 600 rules in 52 ms. Remains 314 /616 variables (removed 302) and now considering 264/566 (removed 302) transitions.
// Phase 1: matrix 264 rows 314 cols
[2024-05-29 08:18:14] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 08:18:14] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 08:18:14] [INFO ] Invariant cache hit.
[2024-05-29 08:18:14] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 08:18:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 2/314 variables, 77/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:18] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 08:18:18] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:18:18] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:18:18] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:18:18] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:18:18] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:18:18] [INFO ] Deduced a trap composed of 36 places in 22 ms of which 1 ms to minimize.
[2024-05-29 08:18:19] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:18:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:20] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:18:21] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:18:21] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 30 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:26] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 264/578 variables, 314/443 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:31] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:18:31] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/578 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 445 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23788 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/314 variables, 77/115 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 95 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 52 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:18:41] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-05-29 08:18:42] [INFO ] Deduced a trap composed of 99 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 10/141 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:42] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:18:42] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 264/578 variables, 314/457 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 260/717 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:18:47] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 718 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 33/33 constraints]
After SMT, in 53827ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 53829ms
Starting structural reductions in LI_LTL mode, iteration 1 : 314/616 places, 264/566 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54252 ms. Remains : 314/616 places, 264/566 transitions.
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-13
Stuttering criterion allowed to conclude after 12821 steps with 762 reset in 39 ms.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-13 finished in 54578 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)))'
[2024-05-29 08:19:08] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9712346627669810712
[2024-05-29 08:19:08] [INFO ] Applying decomposition
[2024-05-29 08:19:08] [INFO ] Computing symmetric may disable matrix : 566 transitions.
[2024-05-29 08:19:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:19:08] [INFO ] Computing symmetric may enable matrix : 566 transitions.
[2024-05-29 08:19:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:19:08] [INFO ] Flatten gal took : 12 ms
[2024-05-29 08:19:09] [INFO ] Computing Do-Not-Accords matrix : 566 transitions.
[2024-05-29 08:19:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:19:09] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9712346627669810712
Running compilation step : cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17617365415753130714.txt' '-o' '/tmp/graph17617365415753130714.bin' '-w' '/tmp/graph17617365415753130714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17617365415753130714.bin' '-l' '-1' '-v' '-w' '/tmp/graph17617365415753130714.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:19:09] [INFO ] Decomposing Gal with order
[2024-05-29 08:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:19:09] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-29 08:19:09] [INFO ] Flatten gal took : 40 ms
[2024-05-29 08:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 08:19:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality1729494840041510326.gal : 7 ms
[2024-05-29 08:19:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality1519463049112301033.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1729494840041510326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1519463049112301033.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((F(G("((i7.i0.i4.u139.p386==0)||(i11.i1.i1.u238.p670==1))"))))
Formula 0 simplified : GF!"((i7.i0.i4.u139.p386==0)||(i11.i1.i1.u238.p670==1))"
Compilation finished in 1491 ms.
Running link step : cd /tmp/ltsmin9712346627669810712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)||X((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)||X((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9712346627669810712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-010B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-010B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761100443"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;